Implementation aspects of list sphere decoder algorithms for MIMO-OFDM systems
From MaRDI portal
Publication:1957283
DOI10.1016/j.sigpro.2010.04.014zbMath1197.94096OpenAlexW1988543836MaRDI QIDQ1957283
Markus Myllylä, Joseph R. Cavallaro, Markku Juntti
Publication date: 24 September 2010
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1911/64207
Cites Work
- A note on two problems in connexion with graphs
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Computationally Optimal Metric-First Code Tree Search Algorithms
- On maximum-likelihood detection and the search for the closest lattice point
- A unified framework for tree search decoding: rediscovering the sequential decoder
- Bit-interleaved coded modulation
- Convergence behavior of iteratively decoded parallel concatenated codes
- Iterative decoding of binary block and convolutional codes
- Efficient detection algorithms for mimo channels: a geometrical approach to approximate ml detection
- Instrumentable tree encoding of information sources (Corresp.)
This page was built for publication: Implementation aspects of list sphere decoder algorithms for MIMO-OFDM systems