Pulse or digital communications – Receivers – Particular pulse demodulator or detector
Reexamination Certificate
2007-10-09
2007-10-09
Corrielus, Jean B. (Department: 2611)
Pulse or digital communications
Receivers
Particular pulse demodulator or detector
Reexamination Certificate
active
10644545
ABSTRACT:
A reduced search space minimum distance decoding method provides average probability of error performance close to optimal MAP decoding. The decoding algorithm provides dramatic complexity reductions compared with MAP decoding. A a sub-optimal decoder receives a collection of signal vectors y1. . . yk, with k denoting a positive integer and generates an estimated transmitted multidimensional symbol {tilde over (S)}. The estimated transmitted multidimensional symbol {tilde over (S)} is decoded using hierarchical subset decoding a subset is determined therefrom. A reduced search space V is generated and minimum distance decoding is used to decode the received symbol vectors y1. . . ykin the reduced search space V. one or more of the following: an estimated multidimensional symbol {tilde over (S)}, soft bit information, or hard bit information are cienerated therefrom.
REFERENCES:
patent: 6452964 (2002-09-01), Yoshida
patent: 6470047 (2002-10-01), Kleinerman et al.
patent: 2003/0142765 (2003-07-01), Poklemba et al.
Batra Anuj
Hosur Srinath
Love David J.
Brady W. James
Corrielus Jean B.
Shaw Steven A.
Telecky , Jr. Frederick J.
Texas Instruments Incorporated
LandOfFree
Low-complexity hierarchical decoding for communications... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Low-complexity hierarchical decoding for communications..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low-complexity hierarchical decoding for communications... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3886764