LDPC code aided phase ambiguity resolution

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Low-density parity-check codes (LDPC) are known to perform close to the Shannon limit as the block length increases. Residual frequency offsets make iterative decoding difficult for longer block lengths. Sub-block decoding techniques provide a practical, low-complexity approach to deal with residual frequency offsets. However they require phase ambiguity resolution(PAR) in every sub-block. This paper presents a new approach called 'localized decoding' to resolve the phase ambiguity over sub-blocks. The algorithm involves modifying the parity-check matrix of the existing LDPC code to create 'local check nodes' and operating on them to resolve phase ambiguity. Simulation results of this approach show a negligible loss for small residual frequency offsets. © 2007 IEEE.

Cite

CITATION STYLE

APA

Karuppasami, S., & Cowley, W. G. (2007). LDPC code aided phase ambiguity resolution. In Conference Proceedings of 2007 Information, Decision and Control, IDC (pp. 205–208). https://doi.org/10.1109/IDC.2007.374550

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free