Tradeoff of complexity and latency of iterative decoding for orthogonal convolutional codes
Tradeoff of complexity and latency of iterative decoding for orthogonal convolutional codes
- Author(s): Y.-C. He ; D. Haccoun ; C. Cardinal
- DOI: 10.1049/iet-com:20070257
For access to this article, please select a purchase option:
Buy article PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
Thank you
Your recommendation has been sent to your librarian.
- Author(s): Y.-C. He 1 ; D. Haccoun 1 ; C. Cardinal 1
-
-
View affiliations
-
Affiliations:
1: Department of Electrical Engineering, École Polytechnique de Montréal, Montreal, Canada
-
Affiliations:
1: Department of Electrical Engineering, École Polytechnique de Montréal, Montreal, Canada
- Source:
Volume 2, Issue 3,
March 2008,
p.
440 – 448
DOI: 10.1049/iet-com:20070257 , Print ISSN 1751-8628, Online ISSN 1751-8636
The complexities and latencies of iterative belief propagation (BP) and threshold decoding techniques for a new class of convolutional self-orthogonal codes are analysed using forward-only pipeline architectures. Computer simulation results show that over the additive white Gaussian noise channel at moderate signal-to-noise ratios, BP decoding yields one half the decoding delay when compared with threshold decoding at essentially the same error performances. However, the reduction in the decoding delay using BP is obtained at the cost of an increase of the implementation complexity.
Inspec keywords: iterative decoding; convolutional codes; orthogonal codes; AWGN channels; channel coding
Other keywords:
Subjects: Codes
References
-
-
1)
- J. Chen , M.P.C. Fossorier . Density evolution for two improved BP-based decoding algorithms of LDPC codes. IEEE Commun. Lett. , 5 , 208 - 210
-
2)
- J. Zhang , M.P.C. Fossorier . A modified weighted bit-flipping decoding of low-density parity-check codes. IEEE Commun. Lett. , 3 , 165 - 167
-
3)
- M.P.C. Fossorier , M. Mihaljevic , H. Imai . Reduced complexity iterative decoding of low density parity check codes based on belief propagation. IEEE Trans. Commun. , 5 , 673 - 680
-
4)
- Y. Kou , S. Lin , M. Fossorier . Low-density parity-check codes based on finite geometries: a rediscovery and new results. IEEE Trans. Inf. Theory , 2711 - 2736
-
5)
- M. Jiang , C. Zhao , Z. Shi , Y. Chen . An improvement on the modified weighted bit flipping decoding algorithm for LDPC codes. IEEE Commun. Lett. , 9 , 814 - 816
-
6)
- R. Lucas , M.P.C. Fossorier , Y. Kou , S. Lin . Iterative decoding of one-step majority logic decodable codes based on belief propagation. IEEE Trans. Commun. , 6 , 931 - 937
-
7)
- F.R. Kschischang , B.J. Frey , H.-A. Loeliger . Factor graphs and the sum-product algorithm. IEEE Trans. Inf. Theory , 2
-
8)
- F. Gagnon , N. Batani , T.Q. Dam . Simplified designs for AAPP soft-decision threshold decoders. IEEE Trans. Commun. , 743 - 750
-
9)
- S. Lin , D.J. Costello . (1983) Error control coding: fundamentals and applications.
-
10)
- C. Cardinal , D. Haccoun , F. Gagnon . Iterative threshold decoding without interleaving for convolutional self-doubly orthogonal codes. IEEE Trans. Commun. , 8 , 1274 - 1282
-
11)
- D. Haccoun , C. Cardinal , F. Gagnon . Search and determination of convolutional self-doubly orthogonal codes for iterative threshold decoding. IEEE Trans. Commun. , 5 , 802 - 809
-
12)
- R.M. Tanner , D. Sridhara , A. Sridharan . LDPC block and convolutional codes based on circulant matrices. IEEE Trans. Inf. Theory , 12 , 2966 - 2984
-
13)
- M. Dubois , Y. Savaria , D. Haccoun . Low-power configurable and generic shift register hardware realisations for convolutional encoders and decoders. IEE Proc.,-Circuits Devices Syst. , 3 , 207 - 213
-
14)
- Cardinal, C., Haccoun, D., He, Y.-C.: `Reduced-complexity convolutional self-doubly orthogonal codes for efficient iterative decoding', Proc. IEEE VTC2006-Spring, May 2006, Melbourne, Australia, 3, p. 1372–1376.
-
15)
- Haccoun, D., He, Y.-C., Cardinal, C.: `Forward-only iterative decoding of convolutional self-orthogonal codes', Proc. 2004 IEEE Int. Symp. Information Theory, June 2004, Chicago, USA, p. 492.
-
16)
- Y.-C. He , D. Haccoun . An analysis of the orthogonality structures of convolutional codes for iterative decoding. IEEE Trans. Inf. Theory , 9 , 3247 - 3261
-
17)
- He, Y.-C., Haccoun, D., Cardinal, C.: `A serial design of iterative belief propagation decoders for convolutional codes', Proc. IEEE VTC2004-Fall, September 2004, Los Angeles, USA, 4, p. 2307–2311.
-
18)
- Y.-C. He , D. Haccoun , C. Cardinal . Parallel processing for fast iterative decoding of orthogonal convolutional codes. IEEE Commun. Lett. , 9 , 664 - 666
-
19)
- A.J. Felstrom , K.Sh. Zigangirov. . Time-varying periodic convolutional codes with low-density parity-check matrix. IEEE Trans. Inf. Theory , 6 , 2181 - 2191
-
20)
- J.L. Massey . (1963) Threshold decoding.
-
21)
- H.H. Ma , J.K. Wolf . On tail biting convolutional codes. IEEE Trans. Commun. , 104 - 111
-
22)
- Pusane, A.E., Lentmaier, M., Zigangirov, K.S.: `Reduced complexity decoding strategies for LDPC convolutional codes', Proc. 2004 IEEE Int. Symp. Information Theory, June 2004, Chicago, USA, p. 490.
-
23)
- M.R. Yazdani , S. Hemati , A.H. Banihashemi . Improving belief propagation on graphs with cycles. IEEE Commun. Lett. , 1 , 57 - 59
-
24)
- Costello, D.J., Pusane, A.E., Bates, S.: `A comparison between LDPC block and convolutional codes', Information Theory and Application Workshop, February 2006, San Diego, USA, p. 6–10.
-
1)