Low complexity high performance decoder and method of decoding for communications systems using multidimensional signaling
AssigneeTexas Instruments Incorporated
InventorsDavid J. Love, Srinath Hosur, Anuj Batra
Life of this patent
Estimating the term…
Abstract
A reduced search space minimum distance decoding algorithm provides average probability of error performance close to that of optimal MAP decoding. The decoding algorithm provides dramatic complexity reductions compared with MAP decoding. A sub-optimal decoder receives signal vectors y1 . . . yk. Soft output bits are generated as is a reduced search space V via a reduced search space table creation unit in response to the soft output bits and an estimated channel H. A signal vector b is generated via a maximum likelihood decoding unit in response to the reduced search space V and the signal vectors y1 . . . yk.
Claims23
A method of decoding a signal vector, the method comprising:
- receiving signal vectors y1 . . . yk into a sub-optimal decoder and generating soft output bits therefrom;
- generating a reduced search space V via a reduced search space table creation unit in response to the soft output bits and an estimated channel H;
- and
- generating a signal vector Ŝk via a maximum likelihood decoding unit in response to the reduced search space V and the signal vectors y1 . . . yk.
A reduced search space decoder comprising:
- a sub-optimal decoder configured to receive a signal vector y1 . . . yk and generate soft output bits therefrom;
- a decision unit coupled to said sub-optimal decoder and configured to generate a set E of error bit error patterns;
- a reduced search space table creation unit coupled to said sub-optimal decoder and said decision unit, said reduced search space table creation unit configured to generate a reduced search space V in response to the soft output bits and a set of L indices, L>0;
- and
- a minimum distance decoder configured to generate a multidimensional signal Ŝk in response to the reduced search space V and the signal vector y1 . . . yk.
A reduced search space decoder comprising:
- a reduced search space (RSS) decoder configured to receive symbol vectors y1 . . . yk and generate a hard symbol vector estimate {tilde over (S)} therefrom;
- and
- an interference cancellation decoder configured to generate a hard symbol vector Ŝ in response to the symbol vectors y1 . . . yk and the hard symbol vector estimate {tilde over (S)} and further configured to generate hard bits and soft bits in response to the symbol vectors y1 . . . yk and the hard symbol vector estimate {tilde over (S)}.
A method of decoding a signal vector, the method comprising:
- receiving a symbol vector y1 . . . yk via a reduced search space maximum likelihood decoder and generating a hard symbol vector estimate {tilde over (S)} therefrom;
- and
- decoding the hard symbol vector estimate {tilde over (S)} via interference cancellation on each symbol and making a decision associated with the received symbol vector y1 . . . yk and the hard symbol vector estimate {tilde over (S)} to generate a symbol vector Ŝ by using a two-layer zero-forcing decoding algorithm.
Dependencies are inferred from the claim text.