Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
HIGH-PERFORMANCE SOFT DECISION DECODING METHOD USING TABLE-AIDED ALGORITHM FOR BLOCK CODE
Autore:
MINAMI H; SASAOKA H;
Indirizzi:
CHUO UNIV,FAC SCI & ENGN TOKYO 112 JAPAN MINIST POSTS & TELECOMMUN,COMMUN RES LAB TOKYO 112 JAPAN
Titolo Testata:
Electronics & communications in Japan. Part 1, Communications
fascicolo: 9, volume: 80, anno: 1997,
pagine: 56 - 67
SICI:
8756-6621(1997)80:9<56:HSDDMU>2.0.ZU;2-M
Fonte:
ISI
Lingua:
ENG
Soggetto:
EFFICIENT;
Keywords:
NONLINEAR CODING; SOFT DECISION DECODING METHODS; MAXIMUM LIKELIHOOD DECODING METHODS; TABLE REFERENCE DECODING METHODS;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Science Citation Index Expanded
Science Citation Index Expanded
Citazioni:
11
Recensione:
Indirizzi per estratti:
Citazione:
H. Minami e H. Sasaoka, "HIGH-PERFORMANCE SOFT DECISION DECODING METHOD USING TABLE-AIDED ALGORITHM FOR BLOCK CODE", Electronics & communications in Japan. Part 1, Communications, 80(9), 1997, pp. 56-67

Abstract

Although various methods exist in soft decision decoding methods for block codes, of those that can be applied to linear and nonlinear coding, there are not many with low levels of computation that provide high levels of performance. In this paper, a method is proposed that reduces computation requirements while maintaining performance close to that of maximum likelihood decoding by a decision-making procedure in which a candidate codeword table is referenced by performing Euclidean distance comparisons on the received signal's hard decision binary sequence. The computation requirements and the block error rate performance are investigated through computer simulation to demonstrate the effectiveness of the proposed method in nonlinear beta codes in additive Gaussian noise channels and fading channels. These results show that the block error rate performance of the proposed method in the additive Gaussian noise channel is about the same as the performance of the Chase II algorithm and is only slightly inferior to that of maximum likelihood decoding. Concerning the amount of computations, it is possible to reduce the complexity down to about 1% of that required by maximum likelihood decoding, and also the complexity can be reduced below thatof the Chase II algorithm. On the other hand, in the fading channel, the block error rate performance of the proposed method, when comparedto maximum likelihood decoding performance, reveals a decrease in E-b/N-0 of about 1 dB, and it is seen to have good performance compared to the Chase II algorithm. Also, application toward quasi-cyclic coding/4-ary ASK coding using a candidate word table with respect to a 4-arysequence applied with BCH coding is investigated, and superior results are obtained. (C) 1997 Scripta Technica, Inc.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 05/07/20 alle ore 02:35:49