초록 ▼

Methods and apparatus for decoding codewords using message passing decoding techniques which are particularly well suited for use with low density parity check (LDPC) codes and long codewords are described. The described methods allow decoding graph structures which are largely comprised of multiple

Methods and apparatus for decoding codewords using message passing decoding techniques which are particularly well suited for use with low density parity check (LDPC) codes and long codewords are described. The described methods allow decoding graph structures which are largely comprised of multiple identical copies of a much smaller graph. Copies of the smaller graph are subject to a controlled permutation operation to create the larger graph structure. The same controlled permutations are directly implemented to support message passing between the replicated copies of the small graph. Messages corresponding to individual copies of the graph are stored in a memory and accessed in sets, one from each copy of the graph, using a SIMD read or write instruction. The graph permutation operation may be implemented by simply reordering messages, e.g., using a cyclic permutation operation, in each set of messages read out of a message memory so that the messages are passed to processing circuits corresponding to different copies of the small graph.

대표청구항 ▼

Methods and apparatus for decoding codewords using message passing decoding techniques which are particularly well suited for use with low density parity check (LDPC) codes and long codewords are described. The described methods allow decoding graph structures which are largely comprised of multiple

Methods and apparatus for decoding codewords using message passing decoding techniques which are particularly well suited for use with low density parity check (LDPC) codes and long codewords are described. The described methods allow decoding graph structures which are largely comprised of multiple identical copies of a much smaller graph. Copies of the smaller graph are subject to a controlled permutation operation to create the larger graph structure. The same controlled permutations are directly implemented to support message passing between the replicated copies of the small graph. Messages corresponding to individual copies of the graph are stored in a memory and accessed in sets, one from each copy of the graph, using a SIMD read or write instruction. The graph permutation operation may be implemented by simply reordering messages, e.g., using a cyclic permutation operation, in each set of messages read out of a message memory so that the messages are passed to processing circuits corresponding to different copies of the small graph. fel et al.; US-5877859, 19990300, Aspnes et al.; US-5882165, 19990300, Maydan et al.; US-5883374, 19990300, Mathews; US-5883710, 19990300, Nikoonahad et al.; US-5886355, 19990300, Bright et al.; US-5887085, 19990300, Otsuka; US-5889593, 19990300, Bareket; US-5896294, 19990400, Chow et al.; US-5900939, 19990500, Aspnes et al.; US-5910011, 19990600, Cruse; US-5910842, 19990600, Piwonka-Corle et al.; US-5914784, 19990600, Ausschnitt et al.; US-5917588, 19990600, Addiego; US-5917594, 19990600, Norton; US-5920076, 19990700, Burgin et al.; US-5926690, 19990700, Toprac et al.; US-5930138, 19990700, Lin et al.; US-5935338, 19990800, Lei et al.; US-5935397, 19990800, Masterson; US-5943122, 19990800, Holmes; US-5955661, 19990900, Samsavar et al.; US-5959735, 19990900, Maris et al.; US-5959812, 19990900, Rothermel; US-5963314, 19991000, Worster et al., 356/237.2; US-5963329, 19991000, Conrad et al., 356/372; US-5963783, 19991000, Lowell et al.; US-5964643, 19991000, Birang et al.; US-5966312, 19991000, Chen; US-5968691, 19991000, Yoshioka et al.; US-5973323, 19991000, Adler et al.; US-5973787, 19991000, Aspnes et al.; US-5976310, 19991100, Levy; US-5978074, 19991100, Opsal et al.; US-5982482, 19991100, Nelson et al.; US-5985497, 19991100, Phan et al.; US-6008906, 19991200, Maris; US-6012966, 20000100, Ban et al.; US-6020214, 20000200, Watanabe et al.; US-6020957, 20000200, Rosengaus et al.; US-6023338, 20000200, Bareket; US-6025918, 20000200, Maris; US-6038029, 20000300, Finarov; US-6039848, 20000300, Moslehi et al.; US-6040198, 20000300, Komiya et al.; US-6045433, 20000400, Dvir et al.; US-6052185, 20000400, Banet et al.; US-6052188, 20000400, Fluckiger et al., 356/369; US-6052478, 20000400, Wihl et al.; US-6060715, 20000500, England et al.; US-6064517, 20000500, Chuang et al.; US-6072147, 20000600, Koshiishi et al.; US-6072178, 20000600, Mizuno; US-6072320, 20000600, Verkuil; US-6074518, 20000600, Imafuku et al.; US-6078045, 20000600, Maul et al.; US-6078386, 20000600, Tsai et al.; US-6080287, 20000600, Drewery et al.; US-6081325, 20000600, Leslie et al.; US-6083363, 20000700, Ashtiani et al.; US-6084679, 20000700, Steffan et al.; US-6086737, 20000700, Patonay et al.; US-6089181, 20000700, Suemasa et al.; US-6093625, 20000700, Wagner et al.; US-6097205, 20000800, Liberman et al., 324/765; US-6097555, 20000800, Lehmann et al.; US-6099705, 20000800, Chen et al.; US-6101971, 20000800, Denholm et al.; US-6103014, 20000800, Lei et al.; US-6107629, 20000800, Benninghoven et al.; US-6108087, 20000800, Nikoonahad et al.; US-6110287, 20000800, Arai et al.; US-6112697, 20000900, Sharan et al.; US-6114216, 20000900, Yieh et al.; US-6122046, 20000900, Almogy; US-6124924, 20000900, Feldman et al.; US-6141103, 20001000, Pinaton et al.; US-6157032, 20001200, Into, 250/310; US-6159073, 20001200, Wiswesser et al.; US-6172349, 20010100, Katz et al.; US-6175416, 20010100, Maris et al.; US-6175421, 20010100, Fuchs et al., 356/503; US-6175645, 20010100, Elyasaf et al.; US-6178257, 20010100, Alumot et al.; US-6179709, 20010100, Redeker et al.; US-6184984, 20010200, Lee et al.; US-6188478, 20010200, Fuchs et al., 356/381; US-6191605, 20010200, Miller et al.; US-6191855, 20010200, Maris; US-6199157, 20010300, Dov et al.; US-6201601, 20010300, Vaez-Iravani et al.; US-6201998, 20010300, Lin et al.; US-6201999, 20010300, Jevtic; US-6204917, 20010300, Smedt; US-6208418, 20010300, Maris; US-6208421, 20010300, Maris et al.; US-6208751, 20010300, Almogy; US-6211961, 20010400, Maris; US-6212691, 20010400, Heberer; US-6215551, 20010400, Nikoonahad et al.; US-6224638, 20010500, Jevtic et al.;