Abstract:
Apparatus for synchronizing a decoder of convolution codes with a received stream of convolutional code data. Synchronization is achieved with respect to such problems as bit polarity inversion and incorrect boundaries of branch intervals by examining a number of trial message sequences. The trial message sequences are obtained by an algorithm suggested by Viterbi involving selection of one survivor sequence terminating in each data state of the code. When the decoder is synchronized with the received data stream, the survivor data sequences are very probably all identical at a branch interval near the older-data end of the sequences. When the decoder is not synchronized, the survivor sequences, with high probability, differ from each other at that branch interval. Loss of synchronism is detected by simultaneously examining the survivor sequences at a branch interval located at a selected number L of branch intervals before the last-received data, L being less than or equal to the decoding depth. If the survivor sequences are not unanimous at depth L a count is registered. If the number of such counts occurring within a test period of B successive branch intervals exceeds a predetermined threshold T, branch synchronism is presumed to be incorrect and a search is initiated for correct synchronism.
Abstract:
Apparatus for detecting and correcting errors in a digital computer storage system is disclosed. Data is encoded using a generalized Reed-Solomon encoder. Error detection circuitry including power sum calculating devices are used for detection of data in error. The error correction portion of the invention includes an improved decoding scheme for determining the location and magnitudes of errors within the data and has a very low average correction time. Means are provided for determining the starting area of a data block in the presence of errors in the starting area. Further means are provided for detecting a cyclic shift in a data character which, under normal conditions, would appear as an acceptable code word even though in error.
Abstract:
An improved error correcting coding and decoding system for reliable data transmission. During a first subcycle of decoder operation, estimator logic circuitry generates successive sets of estimator function bits from selected bits of a received code word, and a decision circuit generates successive test bits in accordance with a bit derived from a number of the estimator function bits. A modulo 2 adder compares the successive test bits with the corresponding received bits, and a counter circuit counts the number of disagreements. A disagreement count exceeding a predetermined number indicates that the received code word has become inverted, and circuitry then functions to correct for the inversion by either complementing the received code word before the second decoding subcycle or by complementing the output of the decoding decision circuit during the second subcycle. During the second decoding subcycle, the decision circuit generates successive decoded bits as determined from a majority of the estimator function bits and also from a code word bit if desired. In the event of a ''''tie'''' among the estimator bits, the indeterminate majority decision bit is replaced with the corresponding received bit. The encoding and decoding system may be used either for inversion tolerant coding and decoding of an appropriate code (such as the (21,11) code) or for noninversion tolerant coding and decoding of a related type of code (such as the (21,12) code).
Abstract:
Sequences of information, encoded in a self-orthogonal convolution code of rate (b-1)/b and transmitted via a communication channel, are decoded to correct t random errors and bursts of B blocks where each block is b bits in length. The interconnections of the information digit shift registers of the encoder and decoder and their respective parity check digit generating circuits are determined by deriving a difference triangle of order lambda (b-1)t and of size (b-1) (t+1), partitioning the rows of the triangle into b-1 groups of t+1 rows each such that no more than t repetitions of any entry appear in each group, deriving a new difference triangle from each of the b-1 groups by inserting t-2 zeros at the top of the first column of each group and expanding the column into a difference triangle, and reconstructing each new triangle by multiplying each entry by B, and incrementing various entries until each entry of all triangles is different from all other entries of all triangles. The diagonal entries of the resulting triangles determine the interconnections.
Abstract:
A system, method and apparatus for demodulating a received signal using a configurable receiver. The receiver performs the demodulation of a signal according to a selected interference cancellation demodulation scheme. The same receiver can be configured, by setting certain parameters, to behave as a successive interference cancellation (SIC) scheme receiver, a parallel interference cancellation (PIC) scheme receiver, or a hybrid interference cancellation (HIC) scheme receiver. In another aspect of the present invention, the receiver performs its demodulation operation using a single interference cancellation unit (ICU). In addition, the ICU's despreading and respreading functions may be performed by the same processing element.
Abstract:
An FET transmission logic parity circuit is disclosed which determines the odd or even status of register bits using zero DC current transmission logic. The circuit has a first two FET devices which propagate the state of the preceding odd or even nodes and the corresponding register bit is logically a zero. A second pair of FET devices switch the state of the odd or even nodes when the corresponding register bit is logically a one. In this manner, the output nodes are statically conditioned to either a first potential or a second potential, depending upon the register bit states and no DC current flows between the first and second potential.