2010 Asia-Pacific Conference on Information Theory (APCIT 2010 E-BOOK)

Xi'an,China,10.1-10.2,2010

ISBN: 978-1-935068-47-1 Scientific Research Publishing, USA

E-Book 506pp Pub. Date: November 2010

Category: Computer Science & Communications

Price: $80

Title: Analysis of Fast Encoding Algorithm with Low Complexity for QC-LDPC Codes
Source: 2010 Asia-Pacific Conference on Information Theory (APCIT 2010 E-BOOK) (pp 119-123)
Author(s): Lei Wen, School of Electronic Science & Engineering, National University of Defence Technology, Changsha, China
Jing Lei, School of Electronic Science & Engineering, National University of Defence Technology, Changsha, China
Chaojing Tang, School of Electronic Science & Engineering, National University of Defence Technology, Changsha, China
Abstract: Based on structure of QC-LDPC Codes and relationship between parity check matrix and gen- erator matrix, this paper presents tow kinds of fast encoding algorithm. The special algorithm applies char- acter of quasi cyclic, and Gaussian eliminates on block unit, that deduce generator matrix directly. The general algorithm reorders columns on block unit, Gaussian eliminates and compute generator matrix. Si- mulation results show both two algorithms have character of quasi cyclic, low complexity and fast encod- ing.
Free SCIRP Newsletters
Copyright © 2006-2024 Scientific Research Publishing Inc. All Rights Reserved.
Top