Shu Quan Lin

6643332, Nov 4, 2003

Jul 9, 1999

09/350700

Robert Morelos-Zaragoza - Sunnyvale CA
Shu Lin - Honolulu HI
Marc Fossorier - Honolulu HI

LSI Logic Corporation - Milpitas CA

H04L 2302

375265

A method and apparatus for multi-level encrypted encoding and decoding of digital signals, which includes utilizing only one type of encoder and one type of decoder. This can be either the same encoder and decoder used in throughout the process, or multiple, identical encoders and decoders. This allows the system to compensate for atmospheric degradation with higher bandwidth efficiency and a simplified receiver structure. The invention further identifies a 2 symbol generation technique that maps in disjoint regions of X-dimensional space, which allows different data bits to be eliminated from the decoding scheme and maximizes the number of independent data substreams that can be maintained.

43441718, Aug 10, 1982

Dec 11, 1980

6/215489

Shu Lin - Honolulu HI
Philip S. Yu - Pleasantville NY

International Business Machines Corporation - Armonk NY

G06F 1110

371 35

A hybrid scheme for controlling transmission errors in digital data communication systems. Normally, data blocks with a small number of parity digits for error detection are transmitted. When the presence of errors is detected, the retransmissions are not the original data blocks but some properly selected blocks for correcting errors in those erroneously received data blocks which are stored in a buffer at the receiver. The retransmitted blocks are formed based on the original data blocks and error-correcting codes with an invertible property. When such blocks are received, they are used to recover the original data blocks either by an inversion operation or by a decoding process.

57815690, Jul 14, 1998

Oct 28, 1996

8/738261

Marc P. C. Fossorier - Honolulu HI
Shu Lin - Honolulu HI
Dojun Rhee - San Jose CA

LSI Logic Corporation - Milpitas CA

H03M 1312

371 437

A differential trellis decoding method for convolutional codes is provided which eliminates from candidacy half of the transitions in each round that it is used, thereby obviating the need for weight calculations for the eliminated transitions. The method is based on a decomposition of the code trellis into fully connected bipartite graphs and the observation that the symmetry of the bipartite graphs of the trellis permits the comparison and selection process for one state to influence the comparison and selection process for other states in the bipartite graph. This method results in a reduced number of operations and hence a reduced complexity for convolutional decoding.