deposit_your_work

A New MIMO Detector Architecture Based on A Forward-Backward Trellis Algorithm

Files in this item

Files Size Format View
2008_Asilomar_Sun.pdf 174.5Kb application/pdf Thumbnail

Show full item record

Item Metadata

Title: A New MIMO Detector Architecture Based on A Forward-Backward Trellis Algorithm
Author: Sun, Yang; Cavallaro, Joseph R.
Type: Conference Paper
Publisher: IEEE
Citation: Y. Sun and J. R. Cavallaro,"A New MIMO Detector Architecture Based on A Forward-Backward Trellis Algorithm," in 42nd Asilomar Conference on Signals, Systems and Computers, 2008, pp. 1892-1896.
Abstract: In this paper, a recursive Forward-Backward (F-B) trellis algorithm is proposed for soft-output MIMO detection. Instead of using the traditional tree topology, we represent the search space of the MIMO signals with a fully connected trellis and a Forward-Backward recursion is applied to compute the a posteriori probability (APP) for each coded data bit. The proposed detector has the following advantages: a) it keeps a fixed throughput and has a regular datapath structure which makes it amenable to VLSI implementation, and b) it attempts to maximize the a posteriori probability by tracing both forward and backward on the trellis and it always ensures that at least one candidate exists for every possible transmitted bit xk ∈ {− 1, +1}. Compared with the soft K-best detector, the proposed detector significantly reduces the complexity because sorting is not required, while still maintaining good performance. A maximum throughput of 533Mbps is achievable at a cost of 576K gates for 4 x 4 16-QAM system.
Date Published: 2008-10-01

This item appears in the following Collection(s)

  • ECE Publications [1047 items]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students
  • CMC Publications [275 items]
    Publications by Rice Faculty and graduate students in multimedia communications