Sökning: id:"swepub:oai:research.chalmers.se:95c7a41b-cd83-4799-b03e-12d1f93edcbd" >
Locally-Optimized R...
Locally-Optimized Reweighted Belief Propagation for Decoding Finite-Length LDPC codes
-
- Liu, Jingjing (författare)
- University of York
-
- de Lamare, Rodrigo (författare)
- University of York
-
- Wymeersch, Henk, 1976 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
(creator_code:org_t)
- ISBN 9781467359399
- 2013
- 2013
- Engelska.
-
Ingår i: IEEE Wireless Communications and Networking Conference, WCNC. - 1525-3511. - 9781467359399 ; , s. 4311-4316
- Relaterad länk:
-
http://dx.doi.org/10...
-
visa fler...
-
https://research.cha...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- In practice, LDPC codes are decoded using message passing methods. These methods offer good performance but tend to converge slowly and sometimes fail to converge and to decode the desired codewords correctly. Recently, tree-reweighted message passing methods have been modified to improve the convergence speed at little or no additional complexity cost. This paper extends this line of work and proposes a new class of locally optimized reweighting strategies, which are suitable for both regular and irregular LDPC codes. The proposed decoding algorithm first splits the factor graph into subgraphs and subsequently performs a local optimization of reweighting parameters. Simulations show that the proposed decoding algorithm significantly outperforms the standard message passing and existing reweighting techniques.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Kommunikationssystem (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Communication Systems (hsv//eng)
Nyckelord
- decoding techniques
- belief propagation algorithms
- LDPC codes
Publikations- och innehållstyp
- kon (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas