Granted Patent B2

US 8,627,022 · App. 12/812,032 · Granted Jan 7, 2014

Abstract

Claims (22)

1. A parallel access system comprising:

a group of processing entities that comprises N processing entities; wherein N is a positive integer

a group of memory banks that stores K information elements; wherein the group of memory banks comprises N pairs of single access memory banks; each pair of memory banks comprises an even memory bank and an odd memory bank; wherein each pair of memory banks stores sub-set of K/N information elements; wherein an even memory bank of each pair of memory banks stores even address information elements of a certain sub-set of K/N information elements and an odd memory bank of each pair of memory banks stores odd address information elements of the certain sub-set of K/N information elements; wherein K/N is an even positive integer;

wherein during each fetch cycle each processing entity of the group of processing entities fetches a first information element from an odd memory unit of a pair of memory banks and fetches a second information element from an even memory unit of the pair of memory banks; wherein the first and second information elements are two consecutive interleaved address information elements.

2. The parallel access system according to claim 1 wherein the group of memory banks and the group of processing entities belong to a turbo decoder.

3. The parallel access system according to claim 1 wherein the number of processing entities equals four and wherein K equals forty.

4. The parallel access system according to claim 1 wherein the system is LTE 3GP compliant and wherein K is selected from a group consisting of 40, 48, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128, 136, 144, 152, 160, 168, 176, 184, 192, 200, 208, 216, 224, 232, 240, 248, 256, 264, 272, 280, 288, 296, 304, 312, 320, 328, 336, 344, 352, 360, 368, 376, 384, 392, 400, 408, 416, 424, 432, 440, 448, 456, 464, 472, 480, 488, 496, 504, 512, 528, 544, 560, 576, 592, 608, 624, 640, 656, 672, 688, 704, 720, 736, 752, 768, 784, 800, 816, 832, 848, 864, 880, 896, 912, 928, 944, 960, 976, 992, 1008, 1024, 1056, 1088, 1120, 1152, 1184, 1216, 1248, 1280, 1312, 1344, 1376, 1408, 1440, 1472, 1504, 1536, 1568, 1600, 1632, 1664, 1696, 1728, 1760, 1792, 1824, 1856, 1888, 1920, 1952, 1984, 2016, 2048, 2112, 2176, 2240, 2304, 2368, 2432, 2496, 2560, 2624, 2688, 2752, 2816, 2880, 2944, 3008, 3072, 3136, 3200, 3264, 3328, 3392, 3456, 3520, 3584, 3648, 3712, 3776, 3840, 3904, 3968, 4032, 4096, 4160, 4224, 4288, 4352, 4416, 4480, 4544, 4608, 4672, 4736, 4800, 4864, 4928, 4992, 5056, 5120, 5184, 5248, 5312, 5376, 5440, 5504, 5568, 5632, 5696, 5760, 5824, 5888, 5952, 6016, 6080 and 6144.

5. The parallel access system according to claim 1 wherein the system is WiMax compliant and wherein K is selected from a group consisting of 24, 36, 48, 72, 96, 108, 120, 144, 180, 192, 216, 240, 480, 960, 1440, 1920 and 2400.

6. The parallel access system according to claim 1 wherein K/N exceeds seven.

7. The parallel access system according to claim 1 wherein N equals four, K equals forty; and wherein during a j'th fetch cycle a first processing entity fetches a modulo40[(j−1)*6]'th information element and a modulo40[13+(j−1)*6]'th information element; a second processing entity fetches a modulo40[30+(j−1)*6]'th information element and a modulo40[3+(j−1)*6]'th information element; a third processing entity fetches a modulo40[20+(j−1)*6]'th information element and a modulo40[33+(j−1)*6]'th information element; and a fourth processing entity fetches a modulo40[10+(j−1)*6]'th information element and a modulo40[23+(j−1)*6]'th information element.

8. The parallel access system according to claim 1 wherein the group of processing entities apply a third generation partnership project long term evolution quadratic permutation polynomial interleaving function.

9. A method for parallel access to a group of memory banks, the method comprises:

processing fetched information elements by the group of processing entities;

fetching, during each fetch cycle and by each processing entity of a group of N processing entities, a first information element from an odd memory unit of a pair of memory banks and a second information element from an even memory unit of the pair of memory banks; wherein the first and second information elements are two consecutive interleaved address information elements; wherein the memory banks are single access memory banks; wherein N pairs of memory banks form a group of memory banks; wherein the group of memory banks that stores K information elements; wherein each pair of memory banks comprises an even memory bank and an odd memory bank; wherein each pair of memory banks stores a sub-set of K/N information elements; wherein an even memory bank of each pair of memory banks stores even address information elements of a certain sub-set of K/N information elements and an odd memory bank of each pair of memory banks stores odd address information elements of the certain sub-set of K/N information elements; wherein K/N is an even positive integer; wherein the group of processing entities is coupled to the group of memory banks by a non-blocking interconnect.

10. The method according to claim 9 wherein the processing is followed by storing the processed information entities in the group of the memory banks.

11. The method according to claim 9 wherein the fetching is followed by processing the fetched information elements by the group of processing entities and storing the processed information entities in the group of the memory banks; wherein the fetching and processing are repeated during a turbo decoding process.

12. The method according to claim 9 wherein K equals forty; and wherein the number or processing entities equals four.

13. The method according to claim 9 wherein the fetching is LTE 3GP compliant and wherein K is selected from a group consisting of 40, 48, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128, 136, 144, 152, 160, 168, 176, 184, 192, 200, 208, 216, 224, 232, 240, 248, 256, 264, 272, 280, 288, 296, 304, 312, 320, 328, 336, 344, 352, 360, 368, 376, 384, 392, 400, 408, 416, 424, 432, 440, 448, 456, 464, 472, 480, 488, 496, 504, 512, 528, 544, 560, 576, 592, 608, 624, 640, 656, 672, 688, 704, 720, 736, 752, 768, 784, 800, 816, 832, 848, 864, 880, 896, 912, 928, 944, 960, 976, 992, 1008, 1024, 1056, 1088, 1120, 1152, 1184, 1216, 1248, 1280, 1312, 1344, 1376, 1408, 1440, 1472, 1504, 1536, 1568, 1600, 1632, 1664, 1696, 1728, 1760, 1792, 1824, 1856, 1888, 1920, 1952, 1984, 2016, 2048, 2112, 2176, 2240, 2304, 2368, 2432, 2496, 2560, 2624, 2688, 2752, 2816, 2880, 2944, 3008, 3072, 3136, 3200, 3264, 3328, 3392, 3456, 3520, 3584, 3648, 3712, 3776, 3840, 3904, 3968, 4032, 4096, 4160, 4224, 4288, 4352, 4416, 4480, 4544, 4608, 4672, 4736, 4800, 4864, 4928, 4992, 5056, 5120, 5184, 5248, 5312, 5376, 5440, 5504, 5568, 5632, 5696, 5760, 5824, 5888, 5952, 6016, 6080 and 6144.

14. The method according to claim 9 wherein the fetching is WiMax compliant and wherein K is selected from a group consisting of 24, 36, 48, 72, 96, 108, 120, 144, 180, 192, 216, 240, 480, 960, 1440, 1920 and 2400.

15. The method according to claim 9 , comprising performing turbo decoding.

16. The method according to claim 9 wherein N equals four, K equals forty; and wherein the fetching comprises fetching, during a j'th fetch cycle, by a first processing entity a modulo40[(j−1)*6]'th information element and a modulo40[13+(j−1)*6]'th information element; fetching, during the j'th fetch cycle, by a second processing entity, a modulo40[30+(j−1)*6]'th information element and a modulo40[3+(j−1)*6]'th information element; fetching, during the j'th fetch cycle, by a third processing entity a modulo40[20+(j−1)*6]'th information element and a modulo40[33+(j−1)*6]'th information element; and fetching, during the j'th fetch cycle, by a fourth processing entity a modulo40[10+(j−1)*6]'th information element and a modulo40[23+(j−1)*6]'th information element.

17. The method according to claim 9 wherein the fetching comprises applying a third generation partnership project long term evolution quadratic permutation polynomial interleaving function.

Assignments (31)