By Topic

Multi-ary SOVA decoding algorithm for unitary space-time symbol-based turbo code

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)

Unitary space-time (UST) symbol-based turbo code has recently been proposed which can reduce the system complexity and calculation amount compared with bit-wise concatenation scheme. However, the corresponding maximum a posteriori (MAP) decoding algorithm still makes hardware unbearable and later its simplified versions, max-log-MAP and log-MAP algorithms, appeared. In this paper, we propose a multi-ary soft output Viterbi Algorithm (SOVA) decoding algorithm for UST symbol-based turbo code. Using our UST symbol-based SOVA, soft output information from the prior iteration can be accepted as the a priori information for current iteration. Notably, the experimental results show that our algorithm can achieve close performance to max-log-MAP and log-MAP algorithms with lower complexity. The performance of the SOVA and that of MAP algorithm are almost the same at a BER of 10-5, and is even better for a higher BER.

Published in:

Communications and Networking in China, 2009. ChinaCOM 2009. Fourth International Conference on

Date of Conference:

26-28 Aug. 2009