Abstract—two Decoding Schedules and the Corresponding Serialized Architectures for Low-density Parity-check (ldpc)
暂无分享,去创建一个
Payam Pakzad | Borivoje Nikolic | Venkat Anantharam | Engling Yeo | V. Anantharam | E. Yeo | P. Pakzad | B. Nikoli
[1] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[2] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[3] Radford M. Neal,et al. Near Shannon limit performance of low density parity check codes , 1996 .
[4] John M. Cioffi,et al. Constrained coding techniques for soft iterative decoders , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).
[5] Robert J. McEliece,et al. The generalized distributive law , 2000, IEEE Trans. Inf. Theory.
[6] Shu Lin,et al. Low density parity check codes based on finite geometries: a rediscovery , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).
[7] A. Blanksby,et al. A 220 mW 1 Gb/s 1024-bit rate-1/2 low density parity check code decoder , 2001, Proceedings of the IEEE 2001 Custom Integrated Circuits Conference (Cat. No.01CH37169).
[8] Payam Pakzad,et al. VLSI architectures for iterative decoders in magnetic recording channels , 2001 .
[9] John M. Cioffi,et al. Optimizing the mapping of low-density parity check codes on parallel decoding architectures , 2001, Proceedings International Conference on Information Technology: Coding and Computing.
[10] Karsten P. Ulland,et al. Vii. References , 2022 .