Author
Dharma Teja Bade
Bio: Dharma Teja Bade is an academic researcher. The author has contributed to research in topics: Soft output Viterbi algorithm & Recursion (computer science). The author has co-authored 1 publications.
Papers
More filters
12 Jun 2016
TL;DR: A detection algorithm at the receiver is developed, for a wireless system employing multiple antennas at both the transmitter and receiver, where the knowledge of channel is not available at the transmitter (a.k.a open-loop system).
Abstract: In this paper, we develop a detection algorithm at the receiver, for a wireless system employing multiple antennas at both the transmitter and receiver, where the knowledge of channel is not available at the transmitter (a.k.a open-loop system). The proposed algorithm offers a very good trade-off between implementation complexity and bit-error-rate (BER) performance. In the literature, the fixed complexity sphere decoding (FSD) is known to be state-of-the art decoding algorithm for open-loop multiple input and multiple output (MIMO) systems. The reduced state maximum aposteriori (RS-MAP) algorithm is an extension of FSD where reduced state (RS) receiver delivers bit level soft decisions using maximum aposteriori (MAP) Bahl, Cocke, Jelinek and Raviv (BCJR) recursions that are implemented on the reduced state tree. While RS-MAP employs state dependent hard decision feedback, the proposed algorithm uses a) a state dependent soft/hard symbol feedback b) a scaling of the branch metric with the assumption that soft decision feedback is employed, to obtain a performance improvement over standard RS-MAP algorithm. The proposed modifications to the branch metric are general and can be applied to a number of other sequence estimators such as maximum likelihood soft output viterbi algorithm (ML-SOVA), FSD-SOVA, RS-MAP with forward only recursion etc.