http://swrc.ontoware.org/ontology#Article
Two-stage decoding algorithm for unmodulated parallel combinatory high-compaction multicarrier modulation signals
en
Hayashi Ryuji
Li Yingsong
Hamamura Masanori
A new decoding algorithm that consists of two decoding stages to reduce the computational complexity of maximum likelihood decoding for parallel combinatory high-compaction multicarrier modulation is proposed. The first decoding stage is responsible for a preliminary decision that serves to roughly find candidate messages using the QRD-M algorithm, and the second decoding stage is responsible for the final decision that reduces the error contained in the candidate and determines the message using the minimum value of the Hamming distances between the candidate and the replicas of the message. The complexity is considerably reduced by the proposed two-stage decoding algorithm at a cost of approximately 1.5 dB or less in Eb/N0 with respect to the bit-error rate of 10^<−3> under the given parameter settings.
EURASIP Journal on Wireless Communications and Networking
2013
2013-04-16
10.1186/1687-1499-2013-75
© 2013 Hayashi et al.; licensee Springer. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
http://creativecommons.org/licenses/by/2.0|http://creativecommons.org/licenses/by/2.0
Springer