c2006 ieee.pdf

4
Decoders fo r Low-Density Parity- Check Convolutional Codes with Large Memory Stephen Bates*, Logan Gunthorpe*, A l i Emre Pusanet, Zhengang Chen*, Kamil Zigangirovt a n d Daniel J. Costello Jr.t *Department o f Electrical a n d Computer Engineering, University o f Alberta, Edmonton, Canada. tDepartment o f Electrical Engineering, University ofNotre Dame, Notre Dame, I N , USA. Abstract- Low-density parity-check convolutional codes offer * W e demonstrate that LDPC-CCs can be applied t o finite th e same good error-correcting performance a s low-density lengths of data rather than a n infinite stream. parity-check block codes while having t h e ability t o encode a n d  decode arbitrary lengths of data. This makes these codes well demonstrate t h e feasiblity of our architecture w e imple- suited t o certain applications, such a s forward error control o n ment a n encoder a n d decoder f o r a (2048,3,6) LDPC-CC packet switching networks. o n a n Altera Stratix FPGA. This implementation achieves I n this paper w e propose a decoder architecture f o r low-density excellent Frame Error Rate (FER) performance a n d a moderate parity-check convolutional codes with very large memories. These  throughput using only a fraction of t h e FPGA resources. codes have very good error correcting properties a n d a s such m a y Therefore the architecture i s suitable f o r l o w power, moderate be applicable i n wireless sensor networks a n d space communica- tion systems. W e discuss a realization o f this architecture f o r a bandwidth applications where good error correction capabilites (2048,3,6) code implemented o n a field-programmable gate-array. a r e required. Such applications include mobile telephony data transfer, communication over wireless sensor networks, an d Index Terms- Convolutional codes, Data communication, E r - space communications. ror correction coding, High-speed integrated circuits. n Section I I w e present a brief overview of LDPC-CCs.  n Section I II w e discuss t he termination of data streams I . INTRODUCTION encoded with LDPC-CCs. I n Section I V w e demonstrate the performance of these codes via simulation.  n Section V w e Low-Density Parity-Check (LDPC) codes were first pro- posed b y Gallagher i n h i s Ph.D. thesis i n 1960 and were then present the architecture of t h e decoder a n d i n Sections V I a n d V I I w e present synthesis a n d performance results f o r the rediscovered b y , among others, MacKay and Neal i n 1996 implementation ofsuch a decoder f o a (2048,3,6) LDPC-CC. [1]. Since their re-discovery LDPC codes have become very popular. O n e of t he reasons f o r this is that LDPC Block Codes (LDPC-BCs) c a n perform very close t o t h e Shannon Limit I I . A N OVERVIEW O F LDPC-CCs [2]. Another reason i s that a relatively simple message-passing LDPC-CCs' generate parity-bits using only previous infor- decoding algorithm, called belief-propagation, c a n be applied mation bits a n d previously generated parity bits. F o r example t o these codes. t h e generation o f a parity-bit, v(t), f o r a rate 1 / 2 (me, J , K ) Research regarding LDPC codes has, t o date, focused LDPC-CC i s almost exclusively upon LDPC-BCs. However, Low-Density Parity-Check Convolutional Codes (LDPC-CCs) [3], [ 4 ] m a y 7n 7n b e better suited t o certain applications than their block code v(t) h / < (t)u(t i ) + E h j ) (t)v(t -i). ( 1 ) counterparts. This i s because LDPC-CCs a r e able t o encode i=O i=1 an d decode arbitrary lengths o f data without t h e need t o  i fragment them into fixed-sized blocks. Many packet switching I k } a r e taken networks, including those based o n t h e Ethernet frame format, from t he parity-check matrix, H , that defines the code m , is utilize a Protocol Data Unit (PDU) that c a n vary i n size. For denoted a s t h e memory o t h e code, J i s th e number of ones example i n th e IEEE 802.11 wireless standards t h e Ethernet i n each column o f H a n d K i s t h e number o f ones i n each frame ca n vary i n size from 6 4 Bytes t o 1518 Bytes. r o w o f H . I n this paper we present a n architecture f o r decoding LDPC- LDPC-CCs could b e decoded using t h e C Cs with large memory. This architecture i s based upon a However given that their trellis consists of 22mS states, such processor design presented in [5]. I n this paper w e make t w o a decoder i s infeasible. Instead, since t he parity-check matrix m a o exesin tota . o k o f a n LDPC-CC i S designed t o b e sparse, iterative message- Rathr tan ecoing he DPCCC it h anyproes-passing algorithms ca n b e applied. LDPC-CCs are typically sors, w e u s e a single processor that operates upon a 1The nomenclature used i n this paper i s based upon that presented i n [3]. terminated sequence o f data. Please refer t o that paper f o r a more complete overview of LDPC-CCs. 0-7803-9390-2/06/ 20.00 ©C2006 IEEE 5103 ISCAS 2006

Upload: sai-krishna

Post on 14-Apr-2018

215 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: C2006 IEEE.pdf

7/27/2019 C2006 IEEE.pdf

http://slidepdf.com/reader/full/c2006-ieeepdf 1/4

D e c o d e r s f o r L o w - D e n s i t y P a r i t y - C h e c kC o n v o l u t i o n a l C o d e s w i t h L a r g e Memory

S t e p h e n B a t e s * , L o g a n G u n t h o r p e * , A l i Emre P u s a n e t , Z h e n g a n g C h e n * ,

K a m i l Z i g a n g i r o v t a n d D a n i e l J . C o s t e l l o J r . t

* D e p a r t m e n t o f E l e c t r i c a l a n d C o m p u t e r E n g i n e e r i n g ,U n i v e r s i t y o f A l b e r t a , E d m o n t o n , C a n a d a .

t D e p a r t m e n t o f E l e c t r i c a l E n g i n e e r i n g ,

U n i v e r s i t y o f N o t r e D a m e , N o t r e D a m e , I N , USA.

A b s t r a c t - L o w - d e n s i t y p a r i t y - c h e c k c o n v o l u t i o n a l c o d e s o f f e r * We d e m o n s t r a t e t h a t LDPC-CCs c a n b e a p p l i e d t o f i n i t et h e s a m e g o o d e r r o r - c o r r e c t i n g p e r f o r m a n c e a s l o w - d e n s i t y l e n g t h s o f d a t a r a t h e r t h a n a n i n f i n i t e s t r e a m .p a r i t y - c h e c k b l o c k c o d e s w h i l e h a v i n g t h e a b i l i t y t o e n c o d e a n d  

d e c o d e a r b i t r a r y l e n g t h s o f d a t a . T h i s m a k e s t h e s e c o d e s w e l l T o d e m o n s t r a t e t h e f e a s i b l i t y o f o u r a r c h i t e c t u r e we i m p l e -s u i t e d t o c e r t a i n a p p l i c a t i o n s , s u c h a s f o r w a r d e r r o r c o n t r o l o n m e n t a n e n c o d e r a n d d e c o d e r f o r a ( 2 0 4 8 , 3 , 6 ) LDPC-CCp a c k e t s w i t c h i n g n e t w o r k s . o n a n A l t e r a S t r a t i x FPGA. T h i s i m p l e m e n t a t i o n a c h i e v e s

I n t h i s p a p e r w e p r o p o s e a d e c o d e r a r c h i t e c t u r e f o r l o w - d e n s i t y e x c e l l e n t F r a m e E r r o r R a t e ( F E R ) p e r f o r m a n c e a n d a m o d e r a t ep a r i t y - c h e c k c o n v o l u t i o n a l c o d e s w i t h v e r y l a r g e m e m o r i e s . T h e s e  t h r o u g h p u t u si n g o n l y a f r a c t i o n o f t h e F P G A r e s o u r c e s .

c o d e s h a v e v e r y g o o d e r r o r c o r r e c t i n g p r o p e r t i e s a n d a s s u c h may T h e r e f o r e t h e a r c h i t e c t u r e i s s u i t a b l e f o r l o w p o w e r , m o d e r a t eb e a p p l i c a b l e i n w i r e l e s s s e n s o r n e t w o r k s a n d s p a c e c o m m u n i c a -t i o n s y s t e m s . We d i s c u s s a r e a l i z a t i o n o f t h i s a r c h i t e c t u r e f o r a b a n d w i d t h a p p l i c a t i o n s w h e r e g o o d e r r o r c o r r e c t i o n c a p a b i l i t e s( 2 0 4 8 , 3 , 6 ) c o d e i m p l e m e n t e d o n a f i e l d - p r o g r a m m a b l e g a t e - a r r a y . a r e r e q u i r e d . S u c h a p p l i c a t i o n s i n c l u d e m o b i l e t e l e p h o n y d a t a

t r a n s f e r , c o m m u n i c a t i o n o v e r w i r e l e s s s e n s o r n e t w o r k s , a n d

I n d e x T e r m s - C o n v o l u t i o n a l c o d e s , D a t a c o m m u n i c a t i o n , E r - s p a c e c o m m u n i c a t i o n s .r o r c o r r e c t i o n c o d i n g , H i g h - s p e e d i n t e g r a t e d c i r c u i t s . I n S e c t i o n I I we p r e s e n t a b r i e f o v e r v i e w o f LDPC-CCs.

  n S e c t i o n I I I we d i s c u s s t h e t e r m i n a t i o n o f d a t a s t r e a m s

I . INTRODUCTION e n c o d e d w i t h L D P C - C C s . I n S e c t i o n I V we d e m o n s t r a t e t h ep e r f o r m a n c e o f t h e s e c o d e s v i a s i m u l a t i o n .   n S e c t i o n V we

L o w - D e n s i t y P a r i t y - C h e c k ( L D P C ) c o d e s w e r e f i r s t p r o -p o s e d b y G a l l a g h e r i n h i s P h . D . t h e s i s i n 1 9 6 0 a n d w e r e t h e n p r e s e n t t h e a r c h i t e c t u r e o f t h e d e c o d e r a n d i n S e c t i o n s V I

a n d V I I we p r e s e n t s y n t h e s i s a n d p e r f o r m a n c e r e s u l t s f o r t h e

r e d i s c o v e r e d b y , among o t h e r s , MacKay a n d N e a l i n 1 9 9 6 i m p l e m e n t a t i o n o f s u c h a d e c o d e r f o r a ( 2 0 4 8 , 3 , 6 ) L D P C - C C .[ 1 ] . S i n c e t h e i r r e - d i s c o v e r y L D P C c o d e s h a v e b e c o m e v e r y

p o p u l a r . One o f t h e r e a s o n s f o r t h i s i s t h a t L D P C B l o c k C o d e s

( L D P C - B C s ) c a n p e r f o r m v e r y c l o s e t o t h e S h a n n o n L i m i t I I . A N OVERVIEW O F LDPC-CCs[ 2 ] . A n o t h e r r e a s o n i s t h a t a r e l a t i v e l y s i m p l e m e s s a g e - p a s si n g L D P C - C C s ' g e n e r a t e p a r i t y - b i t s u s i n g o n l y p r e v i o u s i n f o r -d e c o d i n g a l g o r i t h m , c a l l e d b e l i e f - p r o p a g a t i o n , c a n b e a p p l i e d m a t i o n b i t s a n d p r e v i o u s l y g e n e r a t e d p a r i t y b i t s . F o r e x a m p l e

t o t h e s e c o d e s . t h e g e n e r a t i o n o f a p a r i t y - b i t , v ( t ) , f o r a r a t e 1 / 2 ( m e , J , K)R e s e a r c h r e g a r d i n g L D P C c o d e s h a s , t o d a t e , f o c u s e d LDPC-CC i s

a l m o s t e x c l u s i v e l y u p o n L D P C - B C s . H o w e v e r , L o w - D e n s i t y

P a r i t y - C h e c k C o n v o l u t i o n a l C o d e s ( L D P C - C C s ) [ 3 ] , [ 4 ] may 7n 7n

b e b e t t e r s u i t e d t o c e r t a i n a p p l i c a t i o n s t h a n t h e i r b l o c k c o d e v ( t ) h / < ( t ) u ( t i ) +Eh j ) ( t ) v ( t - i ) . ( 1 )c o u n t e r p a r t s . T h i s i s b e c a u s e LDPC-CCs a r e a b l e t o e n c o d e i = O i = 1a n d d e c o d e a r b i t r a r y l e n g t h s o f d a t a w i t h o u t t h e n e e d t o   if r a g m e n t t h e m i n t o f i x e d - s i z e d b l o c k s . Many p a c k e t s w i t c h i n g I k } a r e t a k e nn e t w o r k s , i n c l u d i n g t h o s e b a s e d o n t h e E t h e r n e t f r a m e f o r m a t , f r o m t h e p a r i t y - c h e c k m a t r i x , H , t h a t d e f i n e s t h e c o d e m, i s

u t i l i z e a P r o t o c o l D a t a U n i t ( P D U ) t h a t c a n v a r y i n s i z e . F o r d e n o t e d a s t h e memory o f t h e c o d e , J i s t h e n u m b e r o f o n e s

e x a m p l e i n t h e IEEE 8 0 2 . 1 1 w i r e l e s s s t a n d a r d s t h e E t h e r n e t i n e a c h c o l u m n o f H a n d K i s t h e n u m b e r o f o n e s i n e a c h

f r a m e c a n v a r y i n s i z e f r o m 6 4 B y t e s t o 1 5 1 8 B y t e s . r o w o f H .I n t h i s p a p e r we p r e s e n t a n a r c h i t e c t u r e f o r d e c o d i n g LDPC- L D P C - C C s c o u l d b e d e c o d e d u s i n g t h e V i t e r b i a l g o r i t h m .

CCs w i t h l a r g e m e m o r y . T h i s a r c h i t e c t u r e i s b a s e d u p o n a H o w e v e r g i v e n t h a t t h e i r t r e l l i s c o n s i s t s o f 2 2 m S s t a t e s , s u c h

p r o c e s s o r d e s i g n p r es e nt e d i n [ 5 ] . I n t h i s p a p e r we m a k e t w o a d e c o d e r i s i n f e a s i b l e . I n s t e a d , s i n c e t h e p a r i t y - c h e c k m a t r i xm a o exesin tota . o k o f a n LDPC-CC i S d e s i g n e d t o b e s p a r s e , i t e r a t i v e m e s s a g e -

R a t h r t a n e c o i n g h e D P C C C i t h a n y p r o e s - p a s s i n g a l g o r i t h m s c a n b e a p p l i e d . LDPC-CCs a r e t y p i c a l l y

s o r s , w e u s e a s i n g l e p r o c e s s o r t h a t o p e r a t e s upon a 1 T h e n o m e n c l a t u r e u s e d i n t h i s p a p e r i s b a s e d u p o n t h a t p r e s e n t e d i n [ 3 ] .

t e r m i n a t e d s e q u e n c e o f d a t a . P l e a s e r e f e r t o t h a t p a p e r f o r a m o r e c o m p l e t e o v e r v i e w o f L D P C - C C s .

0 - 7 8 0 3 - 9 3 9 0 - 2 / 0 6 / 2 0 . 0 0

© C 2 0 0 6I E E E 5 1 0 3 ISCAS 2 0 0 6

Page 2: C2006 IEEE.pdf

7/27/2019 C2006 IEEE.pdf

http://slidepdf.com/reader/full/c2006-ieeepdf 2/4

2

d e c o d e d w i t h t h e same B e l i e f P r o p a g a t i o n ( B P ) a l g o r i t h m u s e d Iter T h r e s h o l d

f o r LDPC-BCs [ 1 ] . - x, ( 1 0 0 0 0 0 , 3 , 6 )- 1 . 5 \ -1 + ( 1 0 0 0 0 , 3 , 6 )

I I I . LDPC-CC TERMINATION - 2

As m e n t i o n e d i n S e c t i o n I I a n LDPC-CC e n c o d e r c a n b e 2 5

t h o u g h t o f a s a F i n i t e S t a t e M a c h i n e ( F S M ) . I n t h a t c a s e , a

t e r m i n a t i o n s e q u e n c e i s d e f i n e d a s a s e q u e n c e o f i n f o r m a t i o n m - 3 -

b i t s t h a t t a k e s t h e e n c o d e r f r o m a n y g i v e n s t a t e b a c k t o t h e Xa l l - z e r o s t a t e 2 . B e f o r e LDPC-CCs c a n b e u s e d i n a c o m m u n i - - 3 5c a t i o n s y s t e m we n e e d t o d e t e r m i n e i f t e r m i n a t i o n s e q u e n c e s

o f r e a s o n a b l e l e n g t h s , e x i s t f o r a l l p o s s i b l e s t a t e s . We a l s o - 4

n e e d t o d e t e r m i n e i f we c a n g e n e r a t e t h e s e s e q u e n c e s i n a n- 4 . 5 -

e f f i c i e n t m a n n e r .   n [ 6 ] we s h o w e d t h a t m o s t LDPC-CCs c a n

b e t e rm in a t ed u s i ng a s e q u e n c e o f , a t m o s t , m , + E i n f o r m a t i o n 15   1b i t s ( e << m j ) .   n [ 7 ] we s h o w e d how t o c o n s t r u c t s i m p l e E b / N o , d B

VLSI c i r c u i t s t o g e n e r a t e t e r m i n a t i o n s e q u e n c e s f o r a v a r i e t yo f L D P C - C C s . F i g . 1 . T h e s i m u l a t e d p e r f o r m a n c e o f t h e ( 2 0 4 8 , 3 , 6 ) LDPC-CC v e r s u s a

N o t e t h a t t h e t e r m i n a t i o n s e q u e n c e h a s a n i m p a c t on t h e n u m b e r o f L D P C - B C s . T h e t h r e s h o l d f o r i t e r a t i v e d e c o d i n g o f   3 , 6 ) c o d e s i sE b a l s o s h o w n .

N o p e r f o r m a n c e o f a n LDPC-CC c o d e . S i n c e t h e s e q u e n c e

c a n n o t c o n v e y i n f o r m a t i o n i t r e d u c e s t h e o v e r a l l r a t e o f t h e

c o d e . T h e r e f o r e i f t h e i n f o r m a t i o n t o b e e n c o d e d i s o f l e n g t h t h e p r o c e s s o r a r r a y a n d t h e o u t p u t i s r e t u r n e d t o m e m o r y . A tL b i t s , t h e n e w c o d e r a t e , R ' , i s g i v e n b y

t h a t p o i n t t h e c o n t r o l l e r can e i t h e r o u t p u t t h e d a t a o r s e n d i t

R ' = L   ( 2 ) t h r o u g h t h e p r o c e s s o r a r r a y a g a i n . I n t h i s p a p e r we u s e t h eL + mS E t h e r n e t f r a m e f o r m a t a s t h e b a s i s f o r o u r f i n i t e d a t a . We

T h e r e f o r e a n y g i v e n B E R w i l l n ow o c c u r a t a h i g h e r E b t h a n d o t h i s b e c a u s e E t h e r n e t i s o n e o f t h e most p r e v a l e n t f r a m eN ~ 0 f o r m a t s i n d a t a c o m m u n i c a t i o n s .

b e f o r e . I f L i s s m a l l w r t m , t h e e f f e c t o f t e r m i n a t i o n i s v e r y

l a r g e . H o w e v e r , i f L >> m S , t h e n t h e i m p a c t o f t e r m i n a t i o n S i n c e o u r f r a m e s a r e c o m p l i a n t w i t h t h e E t h e r n e t f r a m e

i s m i n i m a l . f o r m a t , w e c h e c k t h e 4 B y t e C y c l i c R e d u n d a n c y C h e c k( C R C ) a f t e r e v e r y l o o p t h r o u g h t h e a r r a y . We c a n t h e r e f o r e

I V . L D P C - C C PERFORMANCE d e t e r m i n e i f t h e p a c k e t h a s b e e n d e c o d e d c o r r e c t l y a n d u s e t h i si n f o r m a t i o n t o d e c i d e w h e t h e r o r n o t t o s e n d t h e d a t a t h r o u g h

A s m e n t i o n e d i n S e c t i o n l I I t h e e r r o r c o r r e c t i n g c a p a b i l i t i e s tharyagi Tefmewllophouhhedcers

of a L D C - C C s h o l dncrese

s weinceas m , . I n h i s t h ea r r a y a g a i n . T h e f r a m e w i l l l o o p t h r o u g h t h e d e c o d e r a s

o f a n LDPC-CC s h o u l d i n c r e a s e a s we i n c r e a s e m . I n t h i ss ~ ~ m a n y t i m e s a s n e c e s s a r y u n t i l i t p a s s e s t h e CR C c h e c k o r ap a p e r we f o c u s u p o n c o d e s w i t h much l a r g e r m e m o r i e s t h a n m a x i m u m n e r e o f a i t e r a t i o i s e a h e d .maximum n u m b e r o f i t e r a t i o n s i S r e a c h e d .t h o s e t h a t h a v e b e e n i m p l e m e n t e d p r e v i o u s l y . We c h o o s ea t 2 0 4 8 , 3 , 6 ) LDPC-CC,h i c h i m p l e m w a s e d r e v i o n s t r t e d u

e We a p p r o a c h e d t h e d e s i g n i n s u c h a way t h a t t h e n u m b e r o fa i n 3 [ 8 ] . T h e s a t e drm n c t h i p r o c e s s o r s , maximum n u m b e r o f i t e r a t i o n s a n d memory l e n g t hm e t h o d p r o p o s e d i n [ 8 ] . T h e s i m u l a t e d p e r f o r m a n c e O f t h i s o f t h deoe ca  o svrabe uigsnhssLDPC-CC v e r s u s s e v e r a l ( 3 , 6 ) LDPC-BCs i s g i v e n i n F i g . 1 . o f t h e d e c o d e r c a n b e c h o s e n a s v a r i a b l e s d u r i n g s y n t h e s i s .h e ( 2 0 4 8 , 3 , 6 ) L D P C - C C o u t p e r f o r m s a ( 1 0 0 0 0 0 3 6 ) T h i s a l l o w s u s t o t e s t many d i f f e r e n t c o n f i g u r a t i o n s w i t h t h e

L D P C - B C . , 3 w i c s u g g e s t i t o i s t a p v e r y f p o w e r f u l cd How- c o d e . We u s e t h e n a m i n g s c h e m e  m, p x n t o d e s i g n a t eDPC BC whichs u g g e s t sitis ve. Ha d e s i g n u s i n g a memory o f m , w i t h p p r o c e s s o r s a n d a

e v e r , w h a t i s n o t c a p t u r e d h e r e i s t h a t t h e LDPC-CC r e q u i r e su p t o 1 0 0 p r o c e s s o r s i n o r d e r t o a c h i e v e t h i s p e r f o r m a n c e . T h i si s a s e r i o u s i s s u e s i n c e i t r e n d e r s p r e v i o u s l y r e p o r t e d LDPC- U p o n i m p l e m e n t a t i o n , we f o u n d i t a d v a n t a g e o u s t o u s e a

C C a r c h i t e c t u r e s s u c h a s [ 5 ] a n d [ 9 ] i m p r a c t i c a l . T h e r e f o r e we s i n g l e p r o c e s s o r i n t h e d e c o d e r . T h i s r e s u l t s i n a d e c o d e r t h a t i s

p r o p o s e a n o v e l a r c h i t e c t u r e f o r t h e s e l o n g e r memory c o d e s . v e r y s m a l l i n t e r m s o f a r e a a n d p o w e r . S u c h a d e c o d e r c o u l d b e

i n t e g r a t e d w i t h a n E t h e r n e t MAC t o p r o d u c e a v e r y l o w - p o w e rV . DECO DE R ARCHITECTURE d a t a - l i n k l a y e r s o l u t i o n . A l s o , w i t h o n e p r o c e s s o r a f r a m e

o n l y g o e s t h r o u g h e x a c t l y a s many p r o c e s s o r s a s a r e n e e d e dWe o v e r c o m e t h e f a c t t h a t LDPC-CCs w i t h l a r g e memory t o p r o p e r l y d e c o d e i t d u e t o t h e i n t e r m e d i a t e v e r i f i c a t i o n o f

r e q u i r e many p r o c e s s o r s b y w r a p p i n g a t e r m i n a t e d s e q u e n c e f r a m e s . T h i s g r e a t l y i m p r o v e s t h e t h r o u g h p u t o f t h e d e c o d e r a t( a f r a m e ) o f d a t a t h r o u g h a r e l a t i v e l y s m a l l n u m b e r ( p o s s i b l y h i g h e r S N R . H o w e v e r m u l t ip r o c es s o r d e s i g n s w i l l h a v e b e t t e ro n e ) o f p r o ce s s or s many t i m e s . We a c c o m p l i s h t h i s b y u s i n g a t h r o u g h p u t a t l o w e r S N R s .c o n t r o l l e r t h a t m a n a g e s t h e f l o w o f f r a m e s t h r o u g h a n a r r a y o f Tharitcueotepoesrisdnialotemmry

p r o c e s s o r s ( F i g . 2 ) . T h e c o n t r o l l e r t a k e s a s i n g l e f r a m e a s a n baedsinpsntdn[5exptfrheactatheiml

i n p u t a n d p l a c e s i t i n m e m o r y . I t t he n p a ss e s t h e f r a m e t hr o u g h prt oei 1]wsue Teapoiaingvsams

2 T h e a l l - z e r o s t a t e i s t h e s t a t e i n w h i c h t h e m o s t r e c e n t m 8 i n f o r m a t i o n t h e f u l l p e r f o r m a n c e o f t h e B P a l g o r i t h m w i t h a m u c h s i m p l e rb i t s a n d p a r i t y b i t s a r e a l l z e r o . i m p l e m e n t a t i o n .

5 1 0 4

Page 3: C2006 IEEE.pdf

7/27/2019 C2006 IEEE.pdf

http://slidepdf.com/reader/full/c2006-ieeepdf 3/4

3

i n f o r m n a t i o n LLRs

p a r i t y L L R s

i n f o r m a t i o n LLRs i n f o r r n a t i o n LLRsmemory

p a r i t y L L R s p a r i t y L L R s

p r o c e s s o rAWN K AarrayAWGNw

i n f o r m a t i o n b i t s p a r i t y b i t t sDC D e c n t o d e r o

information 1 0 ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~u t p u ti t s 0 -

a r , a e o r c t e n c o d e rcaled r utputa l i n

t e r m i n a t e C R C |[

TAL  R

C l R C r e z s u l te V a l u ~ e a l t i c i t (

F i g . 2 . T h e s y s t e m i m p l e m e n t e d on FPGA. T h i s i n c l u d e s t h e LDPC-CC e n c o d e r , d e c o d e r , a n d n o i s e g e n e r a t o r s . T h e d e c o d e r c o n s i s t s o f m e m o r y , a p r o c e s s o ra r r a y , a d e c o d e r c o n t r o l l e r , a n d a C R C e v a l u a t o r .

T A B L E I s i n g l e p r o c e s s o r u n t i l e i t h e r t h e C R C w a s e v a l u a t e d c o r r e c t l yHE FPA R o r t h e maximum n u m b e r o f i t e r a t i o n s w a s r e a c h e d . F o r a l l

LDPC-CC DECODER WITH A P R O C E S S O R ARRAY O F S I Z E O N E . T H Et h r e e p a c k e t s i z e s t h e FER, a v e r a g e number o f i t e r a t i o n s , a n d

W O R D - L E N G T H S OF T H E LLR I S W= 8 B I T S . T H E FIGURES I N B R A C K E T S

REFER TO U T I L I Z A T I O N OF THAT R E S O U RCE O N T HE FPGA TARGETED. a g e t h r o u h p t w e r e n d e t e r m i n e d .T h e t e r m i n a t i o n s e q u e n c e w a s a c c o u n t e d f o r w h e n d e t e r -

P a r a m e t e r V a l u e m i n i n g t h e E b / N O b y u s i n g ( 2 ) . A s d i s c u s s e d i n S e c t i o n I I ID e v i c e N a m e A l t e r a S t r a t i x E P I S 8 0 t h i s s e q u e n c e h a s a l a r g e i m p a c t a t s m a l l f r a m e s i z e s . H o w e v e r

L o g i c E l e m e n t s 4 0 0 4 ( 5 . 0 5 % )

M e m o r y   b i t s ) 1 3 1 4 5 6 ( 1 . 6 3 ) a t v e r y l a r g e p a c k e t s i z e s i t s i m p a c t i S m i n i m a l .Max C l o c k F r e q . 60MHz

Max x 3 C l o c k F r e q . 180MHz 0

- i 2 0 4 8 l x 1 0 0 1 2 8 BA - 2 0 4 8 1 x 1 0 0 2 5 6 B

- 0 . 5 2 0 4 8 1 x 10 0 6 4 0 B

<~~~~ - * ~ ~ ~ 2 0 4 8 l x 1 0 0 1 2 8 0 BV I . D E C O D E R IMPLEMENTAT I O N 2 1 0 0 0 , 3 , 6 4 L D P C - B C

> ( 1 0 0 0 0 , 3 , 6 ) L D P C - BC

T h e d e c o d e r was i m p l e m e n t e d f o r t h e ( 2 0 4 8 , 3 , 6 ) LDPC-CC <   1 0 0 0 0 0 3 6 ) L D P C B

o n a n A l t e r a S t r a t i x FPGA. T h i s i s a m i d - s i z e d F P G A w i t h o n -

c h i p RAM a n d d e d i c a t e d a r i t h m e t i c b l o c k s . T h e a r c h i t e c t u r e - 2

o f e a c h p r o c e s s o r i s b a s e d o n t h e d e s i g n p r e s e n t e d i n [ 5 ] ,w h i c h h a s b e e n s h o w n t o b e a v e r y e f f i c i e n t a r c h i t e c t u r e f o rFP G A i m p l e m e n t a t i o n s . T h e a d d i t i o n a l s t a t e m a c h i n e s a n d E * 3RAM m e n t i o n e d i n S e c t i o n V w e r e a l s o i m p l e m e n t e d o n t h e

d e v i c e . 5A s c a n b e s e e n f r o m T a b l e I , t h e d e c o d e r o c cu p i e s o n l y a

f e w p e r c e n t o f t h e t a r g e t e d FPGA. T h e r e f o r e i t i s e x p e c t e dt h a n a n ASIC i m p l e m e n t a t i o n o f t h e s a m e d e s i g n w o u l d - 4 5 5 d B 2 . 5

o c c u p y v e r y l i t t l e a r e a a n d c o n s u m e v e r y s m a l l a m o u n t s o f E b / N d B

p o w e r .F i g . 3 . T h e FER p e r f o r m a n c e o f t h e d e c o d e r a n d s e v e r a l LDPC-BCs f o r a

VII. DECODER PERFORMANCEvaitofrmesz

T h e d e c o d e r w a s t e s t e d u s i n g d i f f e r e n t f r a m e s i z e s r a n g i n g I n F i g . 3 t h e e r r o r c o r r e c t i n g c a p a b i l i t i e s o f t h e LDPC-f r o m 1 2 8 B y t e s t o 8 0 6 4 B y t e s . T h i s a l l o w s u s t o c o m p a r e CC c a n b e s e e n . A s l o n g a s a c e r t a i n t h r e s h o l d i n Eb/No i s

t h e p e r f o r m a n c e f o r s m a l l a n d l a r g e f r a m e s . A s n o t e d i n r ea c h e d, t he n s ma l l i n c r e a s e s i n s i g n a l p o w e r l e a d t o a l a r g eS e c t i o n V t h e d e c o d e r l o o p e d t h e r e c e i v e d d a t a t h r o u g h t h e d r o p i n F E R . When t h e f r a m e s i z e i s s m a l l , t h e o v e r h e a d

5 1 0 5

Page 4: C2006 IEEE.pdf

7/27/2019 C2006 IEEE.pdf

http://slidepdf.com/reader/full/c2006-ieeepdf 4/4

4

1 0 0 2 0 4 8 1 x 0 0 1 2 8 B 5 ) . T h e maximum t h r o u g h p u t o c c u r s when t h e f r a m e s i z e i s

9 0 j l 2 0 4 8 1 x l 0 0 6 4 0 B l a r g e a n d t h e E b / N o i s h i g h . I n t h i s c a s e w e c a n a t t a i n o v e r\ l k \ x - ~ ~ ~ ~ ~ ~ 2 0 4 8 x l 1 0 0 1 2 8 0 B

2 0 4 8 1 x 0 0 8 0 6 4 B 6 MBPS. N o t e t h a t a s t h e f r a m e s i z e i s r e d u c e d , t h e p o t e n t i a lt h r o u g h p u t o f t h e d e c o d e r i s a l s o d e c r e a s e d . T h i s i s d u e t o t h e

V 7 0 f a c t t h a t t h e o v e r h e a d o f t e r m i n a t i o n i s a f i x e d n u m b e r o f b i t s

o 6 0 - l l l \ \ a n d h e n c e b e g i n s t o d o m i n a t e a t s m a l l f r a m e s i z e s .

5 0 V I I I .CONCLUSIONS  4 0 -   i \ \   n t h i s p a p e r we h a v e p r e s e n t e d an LDPC-CC d e c o d e r

3 0 s u i t a b l e f o r d e c o d i n g c o d e s w i t h l a r g e m e m o r y . T h e s e c o d e s

c a n b e a p p l i e d w h e r e s t r o n g e r r o r c o r r e c t i o n i s r e q u i r e d a n d2 0 - w h e r e t h r o u g h p u t a n d l a t e n c y a r e l e s s o f a n i s s u e . S u c h

1 0 7 a p p l i c a t i o n s i n c l u d e d a t a t r a n s m i s s i o n o n m o b i l e t e l e p h o n y

  I:   n e t w o r k s a n d s p a c e a n d s a t e l l i t e c o m m u n i c a t i o n s . T h e d e c o d e r0 0   2 3 4 5 6 7 c a n b e e f f i c i e n t l y i m p l e m e n t e d o n a f r a c t i o n o f a m o d e r n

E / N O dBE b / N o

dB

FP G A a n d u t i l i z e s i t s o n - c h i p m e m o r y . We p r o p o s e t h a t a n

F i g . 4 . T h e a v e r a g e n u m b e r o f p r o c e s s o r i t e r a t i o n s f o r a v a r i e t y o f f r a m e A S I C i m p l e m e n t a t i o n o f t h i s d e c o d e r c o u l d y i e l d a v e r y lows i z e s . p o w e r d e s i g n . T h i s i s t h e s u b j e c t o f o n g o i n g w o r k .

We s h o w e d t h a t a n i m p l e m e n t a t i o n o f t h i s c o d e i s c a p a b l e8 0 0 0 - o f d e c o d i n g 8 0 6 4 B y t e f r a m e s w i t h a n F ER o f a b o u t l e - 3

2 0 4 8 l x l O O 1 2 8 B

A 2 0 4 8 1 x 1 0 0 2 5 6 B a n d a t h r o u g h p u t o f 1 M B P S a t a n E b / N o o f 1 . 3 7 d B . T h i s7 0 0 0 - + - 2 0 4 8 l x l O O 0 6 4 0 B i n l d s a d t o l o f r m e e q r d- * 2 0 4 8 l x l O O 1 2 8 0 B i n c l u d e s t h e a d d i t i o n a l o v e r h e a d o f f r a m e t e r m i n a t i o n r e q u i r e d_ V _ 2 0 4 8 1 x 1 0 0 8 0 6 4 B

6 0 0 0 b y t h e LDPC-CC. H o w e v e r r e s u l t s d o s u g g e s t t h a t , t o a c h i e v eo p t i m u m r e s u l t s , s m a l l f r a m e s s ho u l d b e a v o i d e d w h e n e v e r

5 0 0 0 p o s s i b l e .

s Q 4 0 0 0 - / W x s I X . A C K N OW L E D G M E N T S

H 3 0 0 0 _ w , + ABv T h i s w o r k was s u p p o r t e d i n p a r t b y an N S E R C D i s c o v e r yG r a n t , SRC G r a n t 1 1 7 0 . 0 0 1 , N SF G r a n t C C R O 2 - 0 5 3 1 0 a n d

2 0 0 0 N A S A G r a n t NNG05GH736.

R E F E R E N C E S

0 [ 1 ] C . S c h l e g e l a n d L . P e r e z , T r e l l i s a n d T u r b o C o d i n g . I E E E , 2 0 0 4 .0 1 2 E3 4 5 6 7 [ 2 ] S . Y C h u n g , G . D . F o r n e y , T . J . R i c h a r d s o n , a n d R . U r b a n k e ,  On

E b N O d B t h e d e si gn o f l o w- de n s i t y p a r i t y - c h e c k c o d e s w i t h i n 0 . 0 0 4 5 d B o f t h e

S h a n n o n l i m i t , i n IEEE C o m m . L e t t . , v o l . 5 , n o . 2 , 2 0 0 1 , p p . 5 8 - 6 0 .F i g . 5 . T h e a v e r a g e t h r o u g h p u t f o r a v a r i e t y o f f r a m e s i z e s . [ 3 ] A . J i me n e z - Fe l s tr o m a n d K . S h . Z i g a n g i r o v ,   T i m e - v a r y i n g p e r i o d i c

c o n v o l u t i o n a l c o d e s w i t h l o w - d e n s i t y p a r i t y - c h e c k m a t r i x , IEEE T r a n s .I n f o r m a t i o n T h e o r y , v o l . 4 5 , n o . 6 , p p . 2 1 8 1 - 2 1 9 1 , S e p t e m b e r 1 9 9 9 .

[ 4 ] R . T a n n e r , D . S r i d h a r a , A . S r i d h a r a n , T . F u j a , a n d D . C o s t e l l o J r . ,   LDPC

o f t e r m i n a t i o n h a s a l a r g e i m p a c t on t h e E b / N o , s in ce t h e b l o c k a n d c o n v o l u t i o n a l c o d e s b a s e d o n c i r c u l a n t m a t r i c i e s , I E E E T r a n s .

e f f e c t i v e r a t e o f t h e c o d e i s much l e s s t h a n 1 / 2 . A t v e r y l a r g e I n f o r m a t i o n T h e o r y , v o l . 5 0 , n o . 1 2 , p p . 2 9 6 6 - 2 9 8 4 , D e c e m b e r 2 0 0 4 .[ 5 ] S . B a t e s a n d G . B l o c k ,   A memory b a s e d a r c h i t e c t u r e f o r l o w - d e n s i t y

f r a m e s i z e s , t h i s o v e r h e a d i s much s m a l l e r . p a r i t y - c h e c k c o n v o l u t i o n a l d e c o d e r s , i n P r o c e e d i n g s o f t h e I E E E S y m -T h e s i m u l a t e d p e r f o r m a n c e o f t h r e e LDPC-BCs i s a l s o p o s i u m o n C i r c u i t s a n d S y s t e m s ( I S C A S ) , K ob e , J ap a n, May 2 0 0 5 .

[ 6 ] Z . C h e n , S . B a t e s , a n d X . D o n g ,  L o w - d e n s i t y p a r i t y - c h e c k c o n v o -p l o t t e d . Our d e c o d e r s i g n i f i c a n t l y o u t p e r f o r m s t h e ( 1 0 0 0 , 3 , 6 ) l u t i o n a l c o d e s a p p l i e d t o p a c k e t b a s e d c o m m u n i c a t i o n s y s t e m s , i n

L D P C - BC f o r m o s t f r a m e s i z e s . A l s o , f o r t h e l a r g e s t f r a m e P r o c e e d i n g s o f I E E E G l o b a l T e l e c o m m u n i c a t i o n s C o n f e r e n c e ( G L O B E -

s i z e o u r d e c o d e r o u t p e r f o r m s t h e ( 1 0 0 0 0 , 3 , 6 ) LDPC-BC a n d C O M ) , N o v e m b e r 2 0 0 5 .

p e r f o r m s w i t h i n 0 . 1 5 d B o f t h e ( 1 0 0 0 0 0 , 3 , 6 ) LDPC-B C a t [ 7 ] 5 . B a t e s , D. E l l i o t , an d R . Swamy,  Termination s e q u e n c e g e n e r a t i o np e r f o r m s w t h i n.15d of the  10 0 0 0 , 3 , 6 ) DPC BC a t c i r c u i t s f o r l o w - d e n s i t y p a r i t y - c h e c k c o n v o l u t i o n a l c o d e s , S u b m i t t e d t o

a FER o f 1 x 1 0 - 3 . . T h i s i s a s i g n i f i c a n t r e s u l t s i n c e w e C i r c u i t s a n d S y s t e m s I , I E E E T r a n s a c t i o n s o n , M a r c h 2 0 0 5 .c o n j e c t u r e o u r d e c o d e r i s much s i m p l e r t o i m p l e m e n t t h a n [ 8 ] A . S r i d h a r a n a n d D . C o s t e l l o J r . ,   A n e w c o n s t r u c t i o n m e t h o d f o r l o w

d e n s i t y p a r i t y c h e c k c o n v o l u t i o n a l c o d e s , i n P r o ce e di n gs o f T h e IEEEs u c h l a r g e b l o c k - c o d e d e c o d e r s . We a l s o c o n j e c t u r e t h a t , b a s e d I n f o r m a t i o n T h e o r y W o r k s h o p , O c t o b e r 2 0 0 2 , p . 2 1 2 .o n t h e s l o p e s o f t h e c u r v e s , t h e 8 0 6 4 B c a s e w i l l o u t p e r f o r m [ 9 ] R . S w a m y , S . B a t e s , a n d T . L . B r a n d o n ,   A r c h i t e c t u r e s f o r A S I C

t h e ( 1 0 0 0 0 0 , 3 , 6 ) L D P C - B C a t h i g h e r Eb/NO. i m p l e m e n t a t i o n s o f l o w - d e n s i t y p a r i t y - c h e c k c o n v o l u t i o n a l e n c o d e r s a n dd e c o d e r s , i n P r o c e e d i n g s o f t h e IEEE S y m p o s i u m o n C i r c u i t s a n d

F i g . 4 s h o w s t h a t t h e a v e r a g e n u m b e r o f i t e r a t i o n s t h r o u g h S y s t e m s ( I S C A S ) , K o b e , J a p a n , 2 0 0 5 .t h e s i n g l e p r o c e s s o r i n t h e d e c o d e r r e d u c e s a s t h e E b / N O i s [ 1 0 ] 5 . H o w a r d , C . S c h l e g e l , a n d V . G a u d e t ,   A d e g r e e - m a t c h e d c h e c k n o d e

i n c r e a s e d . ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~h i h aetipc n t e t r u h u , s i c a p p r o x i m a t i o n f o r LDPC d e c o d i n g , i n P r o c e e d i n g s o f t h e I E E E I n t l .  ~ ~ S y m p o s i u m o n I n f o r m a t i o n T h e o r y , I S I T , A d e l a i d e , A u s t r a l i a , S e p t e m b e r

we c a n p r o c e e d t o t h e n e x t f r a m e i n a much s h o r t e r t i m e ( F i g . 2 0 0 5 .

5 1 0 6