liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Efficient Message Passing Decoding Using Vector-based Messages
Linköping University, Department of Electrical Engineering.
Linköping University, Department of Electrical Engineering.
2005 (English)Independent thesis Basic level (professional degree), 20 points / 30 hpStudent thesis
Abstract [en]

The family of Low Density Parity Check (LDPC) codes is a strong candidate to be used as Forward Error Correction (FEC) in future communication systems due to its strong error correction capability. Most LDPC decoders use the Message Passing algorithm for decoding, which is an iterative algorithm that passes messages between its variable nodes and check nodes. It is not until recently that computation power has become strong enough to make Message Passing on LDPC codes feasible. Although locally simple, the LDPC codes are usually large, which increases the required computation power. Earlier work on LDPC codes has been concentrated on the binary Galois Field, GF(2), but it has been shown that codes from higher order fields have better error correction capability. However, the most efficient LDPC decoder, the Belief Propagation Decoder, has a squared complexity increase when moving to higher order Galois Fields. Transmission over a channel with M-PSK signalling is a common technique to increase spectral efficiency. The information is transmitted as the phase angle of the signal.

The focus in this Master’s Thesis is on simplifying the Message Passing decoding when having inputs from M-PSK signals transmitted over an AWGN channel. Symbols from higher order Galois Fields were mapped to M-PSK signals, since M-PSK is very bandwidth efficient and the information can be found in the angle of the signal. Several simplifications of the Belief Propagation has been developed and tested. The most promising is the Table Vector Decoder, which is a Message Passing Decoder that uses a table lookup technique for check node operations and vector summation as variable node operations. The table lookup is used to approximate the check node operation in a Belief Propagation decoder. Vector summation is used as an equivalent operation to the variable node operation. Monte Carlo simulations have shown that the Table Vector Decoder can achieve a performance close to the Belief Propagation. The capability of the Table Vector Decoder depends on the number of reconstruction points and the placement of them. The main advantage of the Table Vector Decoder is that its complexity is unaffected by the Galois Field used. Instead, there will be a memory space requirement which depends on the desired number of reconstruction points.

Place, publisher, year, edition, pages
Institutionen för systemteknik , 2005. , 88 p.
Keyword [en]
Forward Error Correction, Low Density Parity Check Codes, Message Passing Decoding, Belief Propagation, Extrinsic Information Transfer, Galois Fields, Phase Shift Keying
National Category
URN: urn:nbn:se:liu:diva-5205ISRN: LiTH-ISY-EX--05/3741--SEOAI: diva2:21135
Available from: 2006-02-22 Created: 2006-02-22

Open Access in DiVA

fulltext(1176 kB)1068 downloads
File information
File name FULLTEXT01.pdfFile size 1176 kBChecksum SHA-1
Type fulltextMimetype application/pdf

By organisation
Department of Electrical Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 1068 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 556 hits
ReferencesLink to record
Permanent link

Direct link