Sperry Corporation

Other

Unisys Corporation

L-3 Communications Corporation

Robert J Currie

John W Zscheile, Jr

Glen D Rattlingourd

Billie M Spencer

Craig K Rushforth

Ayyoob Dehgani Abbaszadeh

Elwyn R Berlekamp

Po Tong

Stanley D Moss

A method of branch metric calculation of trellis coded data, suitable for a decoder of phase angle on a carrier modulated with phase shift keying (PSK) modulation, begins with an expressing angles of phase shift by a vectorial representation of sectors within quadrants of a circle. The sectors are subdivided into sub-sectors of differing sizes, and the sub-sectors are divided further into equal increments of angle referred to as PIEs. The PIEs and the quadrants are identified and, in each quadrant, there is an assigning of a set of branch metrics to serve as identifiers of respective ones of the sub-sectors in each sector of the quadrant. The set of branch metrics in one sector of the quadrant differs from the set of branch metrics in another of the sectors of the quadrant by a permutation of the branch metrics. The phase data is outputted in the form of branch metrics and quadrant for use by a decoder such as a Viterbi decoder.

Simplified branch metric calculation in pragmatic trellis decoders

This circuit permits M-sequence signals to be generated and decoded very fast while using relatively low power, low speed circuitry components.

High speed M-sequence generator and decoder circuit

Transmitting and receiving apparatus for transmitting data which includes a purged extended Golay (22,7) code encoder at the transmitter for encoding digital data into constant weight unbalanced codewords representative of the digital data. The constant weight unbalanced codewords contain error correction bits and are preferably transmitted as balanced codewords. When the receiver decodes the original digital data, improved tracking and acquisition of the transmitted data is achieved.

Coder-decoder for purged extended golay (22,7) codes

Transmitting and receiving apparatus for transmitting data includes a purged code encoder at the transmitter for encoding digital data into constant weight unbalanced codewords representative of the digital data. The constant weight unbalanced codewords containing error correction bits are preferably transmitted as balanced codewords and are decoded at the receiver employing Golay decoders or algebraic decoders to recover the original digital data without the requirement of a large number of matched filter previously employed for decoding.

Coder-decoder for purged binary block codes

A novel maximum likelihood sequence detector is provided for decoding linear cyclic error correction codes. The detector comprises one cyclic correlator for each two shaft sets of the code which have weights greater than one, and a serial correlator for detecting the shift sets of all zero's and all one's. The number of cyclic correlators required to decode linear codes is reduced to less than half the number of shift sets which define all the codewords instead of half the number of codewords where the number of shift sets is always less than the number of codewords.

Maximum likelihood sequence decoder for linear cyclic codes

A decoder for forward-error-correcting (FEC) convolutional codes. The decoder uses the Viterbi algorithm for decoding the rate 1/2, constraint length 7 code with generator polynomials x.sup.6 +x.sup.5 +x.sup.3 +x.sup.2 +1, and x.sup.6 +x.sup.3 +x.sup.2 +x+1. The architecture of the instant decoder is appropriate for implementation on a single, monolithic VLSI integrated circuit chip and includes a branch metric calculator circuit which produces output signals representative of input symbol signals. These output signals are supplied to a metric update circuit which evaluates the signals from the calculator circuit and provides decisions to a path update circuit which converges the signals thereto and the output signals of which are evaluated by a majority vote circuit which produces data output signals representative of data input signals.

Bit serial convolutional decoder for VLSI implementation

A novel interleaver-de-interleaver is provided which is adapted to store bits of a data stream after being error encoded. The data bits are stored in a random access memory in addresses identifiable by an array of columns and rows. The interleaver comprises address pointer means and logic for reading the data bits out of the memory addresses in a predetermined reordered sequence to provide a quasi-random pattern sequence of data bits which when transmitted are substantially immune to periodic bursts of radio frequency interference signals.

Growing community of inventors

Salt Lake City, UT, United States of America

Robert J Currie