By Topic

An Efficient Code Structure of Block Coded Modulations with Iterative Viterbi Decoding Algorithm

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
$33 $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

2 Author(s)
Huan-Bang Li ; National Institute of Information and Communications Technology (NICT), Hikarino-oka, Yokosuka, Japan. e-mail: ; Ryuji Kohno

Block coded modulations (BCM) with iterative Viterbi decoding algorithm can provide both high transmission throughput and small error probability. In this paper, a new code structure is proposed to further improve the performance. The strategy of the new code is to add parity check codes at corresponding coding levels of BCM to increase the Hamming distances among codewords. Decoding trellis of Viterbi decoding to support the new code structure is also developed. It is shown that the proposed code structure can not only guarantee the Euclidean distance of BCM but also mitigate the burden of iterative decoding. As a result, the proposed code structure can provide better transmission rates than the old one with identical or less decoding complexity. Computer simulation shows that the proposed code structure is also beyond the old one in bit error rate performance.

Published in:

2006 3rd International Symposium on Wireless Communication Systems

Date of Conference:

6-8 Sept. 2006