Error detection/correction and fault detection/recovery – Pulse or data error handling – Digital data error correction
Patent
1998-02-04
2000-08-08
De Cady, Albert
Error detection/correction and fault detection/recovery
Pulse or data error handling
Digital data error correction
H03M 1303
Patent
active
061016268
ABSTRACT:
The purpose of the present invention is to provide a method for choosing the coding schemes, mappings, and puncturing rates for a modulation/demodulation system which would allow the system to compensate for certain transformations of the code in a post-Viterbi step as opposed to pre-Viterbi. This would allow for faster and simpler decoding of a code. The method includes the steps of: choosing a coding scheme and puncturing rate; determining a code generator matrix using said coding scheme and puncturing rate; multiplying the code generator matrix by the transformation matrix by the code generator matrix's feedback free right inverse and seeing if the outcome is equal to the code generator matrix multiplied by the transform matrix; multiplying the error matrix by the code generator matrix's feedback free right inverse by the code generator matrix and seeing if the outcome is equal to the error matrix; repeating all the steps until a code generator matrix that satisfies said invariancy equations is found; and choosing a mapping scheme that takes advantage of the invariancy.
REFERENCES:
patent: 5150381 (1992-09-01), Forney, Jr. et al.
patent: 5621761 (1997-04-01), Heegard
Pietrobon, et al., Rotationally Invariant Nonlinear Trellis Codes for Two-Dimensional Modulation, IEEE, 1994, pp. 1773-1791.
Berg, L et al., Design Procedure for Optimum or Rotationally Invarinat trellis Codes, IEEE, 1990, pp. 607-613.
Lee-Fang Wei, Rotationally Invariant Trellis-Coded Modulations with Multidimensional M-PSK, IEEE, 1989, pp. 1281-1295.
McEliee, R. et al. The Extended Invariant Factor Algorithm with Application to the Forney Analysis of Convolutional Codes, IEEE, p. 142.
Esmaeili et al., Canonical Representation of Quasi-Cyclic Codes, IEEE, p. 348, 1995.
Rossin et al., Rotationally Invariant, Punctured Trellis Coding, IEEE, p. 126, 1995.
Henkel et al., A Semi-Algebraic Construction to Achieve Rotationally Invariant Coded QAM on the Basis of Multilevl Convolutional Codes, IEEE, p. 285, 1993.
Kasami et al., ON Linear Structure and Phase Rotation Invariant Properties of Block M-Psk Modulation Codes, IEEE, p. 164-167, 1991.
Kjell Jorgen Hole, Rate k/(k+1) Minimal Punctured Convolutional Encoders, IEEE, p. 653-655, 1991.
Yow-Jong Liu et al., On TCM Schemes Transparent to Constant Phase and Frequency Shifts, IEEE, p. 384-388, 1990.
Mengali et al., Phase Ambiguity Resolution in Trellis-Coded Modulations, IEEE, p. 2087-2088, 1990.
Fettweis, New Rotationally Invariant Trellis Codes for 8PSK Modulation, IEEE, p. 1388-1392, 1989.
Mogre Advait M.
Morelos-Zaragoza Robert
Cady Albert De
Chase Shelly A
LSI Logic Corporation
LandOfFree
Method for choosing coding schemes, mappings, and puncturing rat does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for choosing coding schemes, mappings, and puncturing rat, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for choosing coding schemes, mappings, and puncturing rat will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1160909