A Turbo-Decoding Message-Passing Algorithm for Sparse Parity-Check Matrix Codes

A turbo-decoding message-passing (TDMP) algorithm for sparse parity-check matrix (SPCM) codes such as low-density parity-check, repeat-accumulate, and turbo-like codes is presented. The main advantages of the proposed algorithm over the standard decoding algorithm are 1) its faster convergence speed...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on signal processing Ročník 54; číslo 11; s. 4376 - 4392
Hlavní autor:	Mansour, M.M.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.11.2006 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithm design and analysis Algorithms Applied sciences Architecture Charts Code standards Codes Coding Coding, codes Decoders Decoding Digital video broadcasting Exact sciences and technology Information, signal and communications theory Iterative decoding Iterative methods low-density parity-check (LDPC) codes Maximum likelihood decoding Parity check codes Ramanujan graphs repeat-accumulate (RA) codes Signal and communications theory Sparse matrices Telecommunications and information theory Throughput Turbo codes turbo decoding algorithm Very large scale integration very large scale integration (VLSI) decoder architectures Performance evaluation Information rate Iterative method very large scale integration (VLSI) decoder architectures Iterative decoding Implementation low-density parity-check (LDPC) codes Coding Algorithm complexity Sparse matrix Convergence rate Parity check codes Ramanujan graphs turbo decoding algorithm Turbo code Algorithm Information transmission Circuit architecture Boarded computer Message passing Algorithm performance Error correcting code Error correction repeat-accumulate (RA) codes Parity check Signal to noise ratio
ISSN:	1053-587X, 1941-0476
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!