In order to meet the requirements of future wideband wireless communications, a parameter-configurable encoder architecture is proposed in this paper for QC-LDPC (QuasiCyclic Low-Density Parity-Check) codes with high throughput. Distinguished from normal encoder, a CPU-liked architecture including an application specific instruction set and a specialized arithmetic logic unit (ALU) as well as a...

We derive asymptotic expressions for the average distance distributions in ensembles of irregular low-density paritycheck (LDPC) codes. The ensembles are defined by matrices with given profiles of column and row sums.

본 논문은 IEEE 802.16e 표준에서 제시한 효율적인 부호화가 가능한 low-density parity-check (LDPC) 부호에 대하여, 두 가지 대표적인 LDPC 부호의 복호 알고리즘을 기반으로 각각 체크 노드 분할을 이용한 변형된 새로운 복호 방법을 적용하여 수렴 속도 개선을 확인한다. 이는 적은 반복으로 동일한 복호 성능을 보장할 수 있기 때문에, 복호 과정에서 연산의 복잡도를 절반 가량 줄일 수 있는 장점을 갖는다. 또한 IEEE 802.16e 표준에서 제시된 LDPC 부호에 성능과 구현 측면에서 가장 적합한 체크 노드 분할 방법으로 비중복 분할 방법을 제안한다. 새로운 복호 알고리즘은 신뢰할 만한 정보의 복원을 보장하면서도 계산 복잡도를 줄일 수 있다는 의미에서 실제 무선 통신 시스...

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 CHAPTER

In this paper we consider low-density parity-check (LDPC) codes for the classic bursty channel. We present lower bounds on the maximum resolvable erasure burst length, Lmax, for arbitrary LDPC codes and then present constructions for LDPC codes with good burst erasure correction performance for channels with and without the presence of noise in the guard band.

Recent research efforts based on joint code-decoder design methodology have shown that it is possible to construct structured LDPC (Low Density Parity Check) codes without any performance degradation. An interesting new data independence property between the two classes of messages viz. check to bit and bit to check involved in decoding, is observed. This property is a result of the specific st...

The low density parity check codes whose performance is closest to the Shan-non limit arèGallager codes' based on irregular graphs. We compare alternative methods for constructing these graphs and present two results. First, we nd a `super{Poisson' construction which gives a small improvement in empirical performance over a random construction. Second, whereas Gallager codes normally take N 2 t...