Pulse or digital communications – Repeaters – Testing
Patent
1986-02-11
1990-06-12
Safourek, Benedict V.
Pulse or digital communications
Repeaters
Testing
371 43, 371 471, 375 58, H04L 100
Patent
active
049339567
ABSTRACT:
A decoder including first and second decoding stages for selecting a codeword near to a given N-tuple r which is a sequence of N real values r.sub.i representing signals. The first stage includes substages associated respectively with sections r.sub.j of N-tuple r, each substage for evaluating distances between multiple sets of possible partial codewords and the section r.sub.j and for selecting a survivor from each of the multiple sets based on the distances. The second stage includes n-1 substages, each of which operates with respect to a supersection made up of a combination of two parts, each part being a section or a supersection combined in an earlier substage of the second stage and it includes a final substage which operates with respect to a final supersection whose parts make up the complete N-tuple r. Eachof the n-1 substages is for evaluating distances between multiple sets of possible partial codewords and the received values in the corresponding supersection based on the survivor distances for the survivors corresponding to each of the two parts and for selecting a survivor from each of the multiple sets based on the distances. The final substage is for evaluating distances between the codewords and the N-tuple r based on the survivor distances for the survivors corresponding to each of two parts, for selecting a finally decoded codeword based on the distances between the codewords and N-tuple r, and for providing information about the finally decoded codeword as decoder output.
REFERENCES:
C. M. Hackett; "An Efficient Algorithm for Soft-Decision Decoding of the Extended Golay Code", IEEE Trans on Communications, vol. Com-29, No. 6, Jun. 1981 pp. 909-911.
C. M. Hackett, Jr., "Correction to an Efficient Algorithm for Soft-Decision". . . IEEE Transactions on Communications, vol. Com-30, No. 3, Mar. 1982, p. 554.
Conway and Sloan, "A Fast Encoding Method for Lattice Codes and Quantizers", IEEE Transactions on Information Theory, vol. IT-29, No. 6, Nov. 1983, pp. 820-824.
Tendolkav and Hartman, "Generalization of Chase Algorithms for Soft Decision Coding of Binary Linear Codes", IEEE Transactions on Information Theory, vol. IT-30, No. 5, Sep. 1984, pp. 714-721.
Sayegh, "A Class of Optimum Block Codes in Signal Space", IEEE Transactions on Communications, vol. COM34, No. 16, Oct., 1986, pp. 1043-1045.
Ginzburg, "Multidimensional Signals for a Continuous Channel", Plenum Publishing Corp. 1984, pp. 20-34.
Imai, "A New Multilevel Coding Method Using Error-Correcting Codes", IEEE Transactions on Information Theory, vol. IT23, No. 3, 1977, pp. 371-377.
Letter to G. D. Forney from Soheil Sayegh, Jan. 5, 1987.
Letter to G. D. Forney from Soheil Sayegh, Oct. 9, 1986.
Leech, J. and Sloane, J. A., "Sphere Packings and Error-Correcting Codes", Can. J. Math., vol. XXIII, No. 4, 1971 pp. 718-745.
Wolf, "Efficient Maximum Likelihood Decoding of Linear Block Codes", IEEE Trans. on Information Theory, vol. IT-24, No. 1, Jan. 1978, pp. 76-80.
Conway et al., "Fast Quantizing and Decoding Algorithms for Lattice Quantizers and Codes", IEEE Trans. on Information Theory, vol. IT-28, No. 2, Mar., 1982, pp. 227-232.
Conway et al., "Soft Decoding Techniques for Codes and Lattices, Including the Golay Code and the Leech Lattice", IEEE Trans. on Information Theory, vol. IT-32, No. 1, Jan., 1986, pp. 41-50.
MacWilliams and Sloane, "The Theory of Error Correcting Codes", Chapter 18, pp. 581-586.
Forney et al., "Efficient Modulation for Band-Limited Channels", IEEE Journal on Selected Areas in Communications, vol. SAC-2, No. 5, Sep., 1984, pp. 632-647.
Solomon et al., "A Connection Between Block and Convolutional Codes", SIAM J. Appl. Math., vol. 37, No. 2, Oct., 1979, pp. 358-369.
Codex Corporation
Safourek Benedict V.
LandOfFree
Simplified decoding of lattices and codes does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Simplified decoding of lattices and codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simplified decoding of lattices and codes will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-623186