Preview

PDF Restricted - Request a copy 596Kb

Creating the optimal bipartite graph and decoding of a Low Density Parity Check (LDPC) codeword on it is deemed an NP-complete problem. Much work in the last decade has gone into proper construction of LDPC codes with maximum girth and optimized stopping sets; to ensure the BER approaches channel capacity. When an edge alteration to the graph is proposed, it completely changes the performance of the graph and usually leads to the re-analysis of the entire graph’s properties. In this work we propose a method of lowering the error floor experienced in an LDPC code by intelligently inserting a set of known bits in the message frame. This deactivates paths in the graph located around trapping sets without modification of edges in the graph, and provides high log-likelihood information to the induced sub-graph for improved performance.

Item Type:	Refereed Conference Paper
Keywords:	channel coding, linear codes, parity check codes, iterative decoding
Research Division:	Engineering
Research Group:	Communications engineering
Research Field:	Signal processing
Objective Division:	Expanding Knowledge
Objective Group:	Expanding knowledge
Objective Field:	Expanding knowledge in engineering
UTAS Author:	Adolph, JF (Mr Jack Adolph)
UTAS Author:	Olivier, JC (Professor JC Olivier)
UTAS Author:	Salmon, BP (Dr Brian Salmon)
ID Code:	105827
Year Published:	2015
Deposited By:	Engineering
Deposited On:	2016-01-15
Last Modified:	2017-11-06
Downloads:	0