Hard and Soft Spherical-Bound Stack decoder for MIMO systems

Details Hard and Soft Spherical-Bound Stack decoder for MIMO systems Hard and Soft Spherical-Bound Stack decoder for MIMO systems

2008-11-06

arxiv.org/abs/0811.1000v1

Computer Science

Information Theory

Scientific paper

Classical ML decoders of MIMO systems like the sphere decoder, the Schnorr-Euchner algorithm, the Fano and the stack decoders suffer of high complexity for high number of antennas and large constellation sizes. We propose in this paper a novel sequential algorithm which combines the stack algorithm search strategy and the sphere decoder search region. The proposed decoder that we call the Spherical-Bound-Stack decoder (SB-Stack) can then be used to resolve lattice and large size constellations decoding with a reduced complexity compared to the classical ML decoders. The SB-Stack decoder will be further extended to support soft-output detection over linear channels. It will be shown that the soft SB-Stack decoder outperforms other MIMO soft decoders in term of performance and complexity.

Affiliated with

Also associated with

No associations

Rating

Hard and Soft Spherical-Bound Stack decoder for MIMO systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hard and Soft Spherical-Bound Stack decoder for MIMO systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hard and Soft Spherical-Bound Stack decoder for MIMO systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-631177