Author:
Aqil Chakir,Akharraz Ismail,Ahaitouf Abdelaziz
Abstract
In this work, we introduce a novel decoding algorithm named “Reliability Ratio Weighted Bit Flipping–Sum Product” (RRWBFSP) is proposed for regular LDPC codes. “Sum Product” [4] and “Reliability Ratio Weighted Bit Flipping” [6] are two separate methods that are combined in the new algorithm. The simulations show novel algorithm to exceed Sum-Product decoding algorithms by 0.34 dB. In addition, when compared to the Sum-Product, the RRWBFSP approach has about the same computational complexity. Thus, LDPC codes, of which the “Double-Orthogonal Convolutional Recursive” (RCDO) subfamily is envisioned for use in electronic hard disks and mobile terminals, can be easily iteratively decoded. This would have the impact of prolonging the life of the batteries and consequently reducing the ecological footprint of the discarded batteries.
Reference12 articles.
1. Gallager R.G., Low-density parity check codes, IRE Transaction Info. Theory, vol. IT-8, pp. 21–28, Jan. (1962)
2. IEEE P802.3an, 10GBASE-T task force, http://www.ieee802.org/3/an
3. T.T.S.I. digital video broadcasting (DVB) second generation framing structure for broadband satellite applications, http://www.dvb.org
4. MacKay D.J.C., Good error-correcting codes based on very sparse matrices, IEEE Transactions on Information Theory, vol.45, pp. 399–431, Mar.(1999)
5. Kou Y., Lin S., and M. Fossorier, Low density parity check codes based on finite geometries: A rediscovery and more, IEEE Trans. Inform. Theory, vol. 47, pp. 2711–2736, Nov. (2001)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献