pith. sign in

arxiv: cs/0508064 · v3 · submitted 2005-08-12 · 💻 cs.IT · math.IT

Layered Orthogonal Lattice Detector for Two Transmit Antenna Communications

classification 💻 cs.IT math.IT
keywords algorithmdetectorlatticecommunicationscomplexitytransmitachievesantenna
0
0 comments X
read the original abstract

A novel detector for multiple-input multiple-output (MIMO) communications is presented. The algorithm belongs to the class of the lattice detectors, i.e. it finds a reduced complexity solution to the problem of finding the closest vector to the received observations. The algorithm achieves optimal maximum-likelihood (ML) performance in case of two transmit antennas, at the same time keeping a complexity much lower than the exhaustive search-based ML detection technique. Also, differently from the state-of-art lattice detector (namely sphere decoder), the proposed algorithm is suitable for a highly parallel hardware architecture and for a reliable bit soft-output information generation, thus making it a promising option for real-time high-data rate transmission.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.