By Topic

Complexity-reduced decoding algorithm for unmodulated parallel-combinatory high-compaction multicarrier modulation signals

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

2 Author(s)
Hayashi, R. ; Kochi Univ. of Technol., Kami ; Hamamura, M.

A new decoding algorithm that consists of two decoding stages to reduce the complexity of the maximum likelihood decoding for parallel combinatory high-compaction multi-carrier modulation is presented. The first decoding stage is in charge of a preliminary decision that coarsely searches the candidates using the QRD-M algorithm, and the second decoding stage is responsible for the final decision that recovers the message data using the candidates chosen in the first decoding stage. The proposed two-stage decoding algorithm is shown to be effective with respect to bit-error rate performance, with a small increase in computational complexity, compared to the one-stage decoding using the QRD-M algorithm.

Published in:

Innovations in Information Technology, 2008. IIT 2008. International Conference on

Date of Conference:

16-18 Dec. 2008