Abstract: For the transmission of data in the form of difference signals between subscribers connected to a bus, bus couplers are provided which permit switching between transmit and receive operation. The bus couplers each include a multiplexer connected in such a manner that, for receive operation, only push-pull states of the difference signal are evaluated. If common-mode states occur, the immediately previously decoded data are used. In the case of interference, e.g. one subscriber experiences a short circuit, his bus is terminated passively so that the bus traffic for the other subscribers is not adversely affected.

Abstract: A method and apparatus for editing a high-convolutional code for transmisison and its reconversion at a receiver using code puncturing n-output bit streams of a convolutional encoder. The device includes parallel switched data rearrangers at the transmitter provided with control switching circuits which evenly distribute bit streams to the transmission channels. At the receiver, a de-puncturer processes all transmission channels in parallel, downstream of which dummy bits are inserted by a multiplexer and a convolutional decoder subsequently decodes the received data.

Abstract: A bus coupling circuit couples data between a transmitting subscriber and a receiving subscriber using a data transfer bus. Each subscriber includes a bidirectional driver for transmitting and receiving data. Each bidirectional driver includes an apparatus for reintroducing a direct voltage at the bus-sided input of each driver, and a direct voltage splitting device connected between the driver and the bus. Each driver has an input/output port. A hysteresis circuit is connected to each driver and includes a voltage divider disposed between the an input of the driver and a source of supply voltage.

Abstract: A method and a system for processing a data stream for transmission. In order to process the data stream for transmission, particularly for satellite transmission, data substreams are formed and then difference coded and convolutionally coded. After the data substreams are coded, they are combined into phase components in such a manner that all phase components contain convolutionally coded data from each data substream. The convolutional decoding of each data substream again utilizes all phase components.

Abstract: A method and apparatus for correcting errors in convolutional code signals prior to Viterbi decoding. Branch metrics in the decoding of n-PSK convolution code signals are used to obtain a differential metric with calculations in both the logical and arithmetic domain. The differential metric is used to obtain a phase error signal which includes information on the quality of the convolution code signals, and control signals for the resolution of phase ambiguity in the demodulation of the convolution code signals are obtained using the phase error signal, such that an improvement in the bit error rate and synchronization is made possible, in particular in decoders for error-correctable convolution code signals. The phase error signal is produced when, over a predetermined time period the differential metric is less than a given threshold value or is decreasing, so as to indicate an error in the demodulated convolution signal over such time period and therefore the probable presence of a phase error.

Abstract: A method and circuit for decoding binary signals processed according to an error correcting convolution code, in which the path metrics are transformed from the arithmetic into the logic range of operation. The path metric having the extreme value is subtracted from all other path metrics. All possible binary signal states occurring at the encoder are simulated in real time and are utilized to address hypothetical source data channels. From such a hypothetical source data channel fed by path decision bits, a buffer memory is actualized as well as the simulated binary signal states at the encoder. The output of decoded data from a buffer memory is effected in accordance with their addresses, namely for the extreme value of the path metric. For branching in the trellis diagram, the buffer memories whose associated trellis paths did not survive are overwritten.