Trellis-Search Based Soft-Input Soft-Output MIMO Detector: Algorithm and VLSI Architecture

• Published in: IEEE transactions on signal processing 2012-05, Vol.60 (5), p.2617-2627
• Main Authors: Yang Sun, Cavallaro, J. R.
• Format: Article
• Language: English
• Subjects: Algorithms; Applied sciences; Approximation; Approximation algorithms; Architecture; ASIC; Coding, codes; Detection algorithms; Detection, estimation, filtering, equalization, prediction; Detectors; Exact sciences and technology; Information, signal and communications theory; Integrated circuits; MIMO; MIMO algorithm; Modulation, demodulation; Searching; Signal and communications theory; Signal, noise; soft-input soft-output MIMO detection; Studies; Telecommunications and information theory; Transmitting antennas; trellis-search algorithm; Vectors; Very large scale integration; VLSI; Workload
• ISSN: 1053-587X; 1941-0476
• DOI: 10.1109/TSP.2012.2187646

In this paper, we propose a trellis-search based soft-input soft-output detection algorithm and its very large scale integration (VLSI) architecture for iterative multiple-input multiple-output (MIMO) receivers. We construct a trellis diagram to represent the search space of a transmitted MIMO signal. With the trellis model, we evenly distribute the workload of candidates searching among multiple trellis nodes for parallel processing. The search complexity is significantly reduced because the number of candidates is greatly limited at each trellis node. By leveraging the trellis structure, we develop an approximate Log-MAP algorithm by using a small list of largest exponential terms to compute the LLR (log-likelihood ratio) values. The trellis-search based detector has a fixed-complexity and is very suitable for parallel VLSI implementation. As a case study, we have designed and synthesized a trellis-search based soft-input soft-output MIMO detector for a 4 × 4 16-QAM system using a 1.08 V TSMC 65 nm technology. The detector can achieve a maximum throughput of 1.7 Gb/s with a core area of 1.58 mm 2 .