Referenced Items are not available for this document.
This paper proposes three kinds of simplified complexity-reduced algorithms for a low density parity check (LDPC) decoder. First, sequential decoding using a partial group is proposed. Second, an early detection method for reducing the computational complexity is proposed. Finally, in order to support the high-speed systems, we implemented LDPC decoder using three algorithms by N=648, R=1/2. And the decoder runs at a clock speed of 10ns. Therefore we implemented the LDPC decoder with the decoding speed of 110 Mbps.
Published in:
Communication Technology (ICCT), 2010 12th IEEE International Conference on
Date of Conference: 11-14 Nov. 2010
- Page(s):
- 1460 - 1463
- Print ISBN:
- 978-1-4244-6868-3
- INSPEC Accession Number:
- 11761056
- Conference Location :
- Nanjing
- Digital Object Identifier :
- 10.1109/ICCT.2010.5688980
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
