Abstract:
A data interleaving device is provided that includes an input, an output, and a data interleaver coupled to the input and the output. The input receives data originating from a plurality of processing blocks. The output transfers interleaved data to the plurality of processing blocks. The data interleaver includes a controller, at least one interconnection module, and a plurality of memories. The controller prepares a data-to-memory assignment data structure. The at least one interconnection module switches data in parallel according to the data-to-memory assignment data structure and acts identically on all data switched simultaneously in parallel. The plurality of memories store the switched data. The data interleaver interleaves data received from the input and provides the interleaved data at the output.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
       [0001]    The present application is related to French Patent Application No. 07-54793, filed Apr. 30, 2007, entitled “METHOD AND DEVICE FOR INTERLEAVING DATA”. French Patent Application No. 07-54793 is assigned to the assignee of the present application and is hereby incorporated by reference into the present disclosure as if fully set forth herein. The present application hereby claims priority under 35 U.S.C. §119(a) to French Patent Application No. 07-54793. 
       TECHNICAL FIELD 
       [0002]    The invention relates to the intermixing of digital data for the implementation of an error correction code. More particularly, the invention relates to error correction coding for high speed data transmission applications, for example in the field of multimedia or telecommunications, in order to minimize the influence of errors by mixing incident data. 
       BACKGROUND 
       [0003]    One particularly useful application of the invention thus relates to the interleaving of data for error correction codes, especially of the LDPC (“Low Density Parity-Check Code”) or Turbo-Codes® type, in order to reduce the influence of errors on a noisy transmission channel. 
         [0004]    Error correction codes of the LDPC or Turbo-Codes type are well-known in the state of the art. 
         [0005]    Reference may thus be made to the prior French patent FR 91 05 280 which discloses the general principle of Turbo-Codes. 
         [0006]    Said coding and decoding techniques are based on iterative processing of data which are mixed, at each processing stage, until succeeding in a decorrelation of the errors likely to be conveyed. Said error correction coding techniques use an interleaver that performs an iterative permutation of symbols of an input code and memory banks in which the data are stored. 
         [0007]      FIG. 1  shows an example of architecture intended for the implementation of such data interleaving. As seen in this figure, the architecture shown is a parallel architecture. It comprises a set of data processing blocks or modules B 1 , B 2 , . . . B n  arranged in parallel ensuring, in parallel, the generation and deliverance of a set of binary symbols, a set of memory banks M 1 , M 2 , . . . M n  arranged in parallel and connected to the blocks B 1 , B 2 , . . . B n  with interposition of interconnection modules I 1  and I 2  intended for the parallel processing of the symbols coming from the blocks B 1 , B 2 , . . . B n , for switching them to the memory banks M 1 , M 2 , . . . M n  by performing an iterative permutation of the symbol data in parallel. 
         [0008]    One of the major problems associated with the implementation of this type of interleaving architecture relates to memory access conflicts. This is because, as seen in  FIG. 2 , with this type of architecture, it is possible that two or more blocks B 1 , B 2 , . . . B n  producing or using data may attempt to write or, on the contrary, to read different data at the same time into or from the same memory bank. 
         [0009]    Various techniques have been developed to try to overcome this drawback. One of these techniques, disclosed in detail in the document FR 02 04 764, called “multiple slice turbo-code”, is based on the definition of a circular interleaving rule that can be used to implement an interleaver having a high degree of parallelism with performances equivalent to, or better than those of the known turbo-codes, whilst enabling the complexity of the interconnection architecture to be reduced, in particular for very high throughput applications. 
         [0010]    The principle of multiple slice turbo-codes is based on splitting an information frame of N symbols into P blocks of M symbols. The coding operation is first performed in a natural order in order to generate a redundancy in a first dimension. Each block is then coded independently by a circular recursive systematic convolutional code (CRSC). The information frame is then permuted by an interleaver of N symbols in size. The interleaved frame is also split into P blocks of length N and each block is coded independently by a CRSC code to produce the redundancy in a second dimension. 
         [0011]    The interleaver is constructed jointly with the memory organization so as to enable parallel decoding of the P blocks. In other words, the interleaver structure is chosen so as to enable the P data necessary to the P decoders of the P memory banks to be read and written at each cycle, without conflict. 
         [0012]    Actually, a single reading may be performed at the same instant in a memory. However, this technique is based on the implementation of a specific interleaving rule and does not therefore conform to a standard. 
         [0013]    Another technique, described in the document “SoC-Network for Interleaving in Wireless Communications” by N. Wehn, MPSoC, 2004, is based on an addition of memories into the network in order to provide a time delay of the data in the event of a conflict situation. However, this technique increases the latency of the circuit and produces complex interconnection networks. Furthermore, it is necessary to carry out the dimensioning of the added memories by simulation. 
         [0014]    Finally, another approach, suggested by Benedetto and described in the article “Mapping Interleaving Laws to Parallel Turbo-decoder Architectures” published in IEEE volume 8, March 2004, consists in arranging the data in memory banks so as to avoid collisions. In particular, this approach suggests identifying the data which are intended to be used at the same time on a tiling matrix. A simple first assignment is made in the memory banks, without generating any conflict and a bank is assigned to the non-allocated data by correcting the conflicts using a so-called “simulated annealing” or “iterative refinement” method. 
         [0015]    Although this technique can be used to find a memory arrangement whatever the interleaving rule, it nevertheless presents a certain number of major drawbacks, chiefly due to the fact that it does not enable a memory arrangement to be generated which can then be used to produce a hardware architecture using simple components, so that the interconnections network is liable to display a complicated architecture. 
         [0016]    Furthermore, the simulated annealing algorithm is relatively complex to implement and does not allow its outcome to be determined a priori. 
         [0017]    Finally, this technique requires the use of two ROM type memories per frame format for storing the natural and interleaved access orders in memory. 
       SUMMARY 
       [0018]    In view of the foregoing, a method of interleaving data is provided comprising the switching of data to means of memory storage by means of a data memory assignment matrix, in which the matrix is prepared so as to switch the data in memory by using systematic processing means adapted for acting identically on all the data switched simultaneously. 
         [0019]    In other words, within the context of the present disclosure, a method of interleaving is provided that enables the interconnections network to be simplified and that implements an interleaving rule in conformity with standards. 
         [0020]    In one embodiment, the data memory assignment matrix is developed by successive stages during which data are assigned to memory locations so as to avoid memory access conflicts. 
         [0021]    In another aspect of the method of interleaving, assignment in memory is determined based on the input data order and an interleaving rule, using two intermediate matrices in each of which memory locations are successively assigned in such a way that switching data at successive instants takes place with the aid of said systematic processing means, and by copying the memory assignments from one of the intermediate matrices to the other. 
         [0022]    For example, the data input order and the interleaving rule are represented by an input matrix and an interleaving matrix respectively, whose columns each correspond to simultaneous accesses to data in parallel. 
         [0023]    In one embodiment, memory locations are assigned to a first intermediate matrix in the form of a first memory location column, the memory locations are transferred into the second intermediate matrix from the corresponding data location in the interleaving matrix. 
         [0024]    In a further embodiment, memory locations are assigned to a first column of the second intermediate matrix and the memory locations are transferred into the first intermediate matrix from the corresponding data location in the input matrix. 
         [0025]    In a further embodiment, the memory locations are successively assigned to one of the intermediate matrices and the memory locations are transferred into other intermediate matrices until all of the first and second intermediate matrices are filled. 
         [0026]    The memory location assignment step may be performed so as to avoid access conflicts. 
         [0027]    According to a second embodiment, a data interleaving device of a first data processing module set arranged in parallel to a second set of processing modules arranged in parallel comprises a set of memory banks in parallel and switching means interposed between the memory banks and the first and second sets of data processing modules. 
         [0028]    In this embodiment, the switching means are achieved from systematic data processing means adapted for acting identically on all the data switched simultaneously in parallel. 
         [0029]    The data processing means may include data permutation means. 
         [0030]    Aspects of the disclosure may be found in a method of interleaving data. The method includes preparing a data-to-memory assignment data structure and switching data in parallel according to the data-to-memory assignment data structure using at least one interconnection module operable to act identically on all data switched simultaneously in parallel. The method also includes storing the switched data in a plurality of memories. 
         [0031]    Other aspects of the disclosure may be found in a data processing module that includes a data interleaving device. The data interleaving device includes a controller, at least one interconnection module, and a plurality of memories. The controller prepares a data-to-memory assignment data structure. The at least one interconnection module switches data in parallel according to the data-to-memory assignment data structure and acts identically on all data switched simultaneously in parallel. The plurality of memories store the switched data. 
         [0032]    Further aspects of the invention may be found in a data interleaving device that includes an input, an output, and a data interleaver coupled to the input and the output. The input receives data originating from a plurality of processing blocks. The output transfers interleaved data to the plurality of processing blocks. The data interleaver includes a controller, at least one interconnection module, and a plurality of memories. The controller prepares a data-to-memory assignment data structure. The at least one interconnection module switches data in parallel according to the data-to-memory assignment data structure and acts identically on all data switched simultaneously in parallel. The plurality of memories store the switched data. The data interleaver interleaves data received from the input and provides the interleaved data at the output. 
         [0033]    Other technical features may be readily apparent to one skilled in the art from the following figures, descriptions and claims. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0034]    For a more complete understanding of this disclosure and its features, reference is now made to the following description, taken in conjunction with the accompanying drawings, in which: 
           [0035]      FIG. 1  illustrates an architecture of a conventional interleaving device; 
           [0036]      FIG. 2  illustrates a drawback associated with the use of the architecture in  FIG. 1 ; 
           [0037]      FIG. 3  illustrates the order of the data as delivered to the switching module, before interleaving and the order of the data after interleaving; 
           [0038]      FIG. 4  is a diagram illustrating a first phase of a mode of implementation of a method of interleaving according to the disclosure; 
           [0039]      FIG. 5  illustrates the phase of copying the memory locations of the first intermediate matrix to the second intermediate matrix; 
           [0040]      FIG. 6  illustrates the phase of assigning memory locations in the second intermediate matrix; 
           [0041]      FIG. 7  illustrates a phase of copying the memory locations of the second intermediate matrix to the first intermediate matrix; 
           [0042]      FIG. 8  illustrates a subsequent step of copying memory locations in the first intermediate matrix; 
           [0043]      FIG. 9  shows a subsequent phase during which the memory locations of the first intermediate matrix are transferred to the second intermediate matrix; 
           [0044]      FIG. 10  shows a subsequent phase of filling the second intermediate matrix; 
           [0045]      FIG. 11  shows a final phase during which the memory locations of the second intermediate matrix are transferred to the first intermediate matrix; 
           [0046]      FIG. 12  is a diagram illustrating the use of a means of data permutation for successively accessing the set of memory banks. 
           [0047]      FIG. 13  is an example of architecture for an implementation of a method of interleaving according to the disclosure; and 
           [0048]      FIGS. 14 to 17  illustrate different embodiments of the disclosure. 
       
    
    
     DETAILED DESCRIPTION 
       [0049]    First of all, a description will be given referring to  FIGS. 3 to 12 , of an example of implementing a method of interleaving data according to one embodiment of the present disclosure. 
         [0050]    In the illustrated embodiment, the data originating from the processing modules are presented in the following natural order: 
         [0051]    {1, 2, 3, . . . , 12} 
         [0052]    After interleaving, the interleaving rule provides that the interleaved data are presented in the following order: 
         [0053]    {10, 1, 4, 7, 8, 11, 3, 6, 2, 5, 9, 12}. 
         [0054]    The natural order of the data and the order of the interleaved data are respectively illustrated by the matrices M 1  and M 2  seen in  FIG. 3 . 
         [0055]    Furthermore, in this embodiment, the data are delivered by four data producing or consuming processing modules. In addition, the interleaving architecture comprises four memory banks, hereafter designated by the references B 1 , B 2 , B 3  and B 4 . The interleaving architecture and the corresponding method of interleaving are intended to enable the data to be arranged in memory starting from the natural order, taking into account the interleaved order whilst avoiding conflicts. 
         [0056]    To do so, starting from the matrix showing the natural order of the data, as delivered by the processing modules, an assignment is first of all made of the four memory banks B 1 , B 2 , B 3  and B 4  to a set of input matrix locations “matrix IN”. 
         [0057]    This involves, e.g. in the illustrated embodiment, assigning the four memory banks B 1 , B 2 , B 3  and B 4  to the four locations of the first column of the input matrix ( FIG. 4 ). 
         [0058]    During the next step, seen in  FIG. 5 , the constraints thus devised are transferred onto the output matrix “matrix OUT”. As shown, this involves identifying in the interleaving matrix M 2 , the memory locations corresponding to the interleaved data. 
         [0059]    The method of interleaving uses two intermediate matrices, namely the input matrix and the output matrix, to assign memory banks into one of the matrices, and to transfer into the other matrix, the memory banks corresponding to the interleaved order. These steps are repeated until the two intermediate matrices are completely filled. 
         [0060]    Thus, as seen in  FIG. 6 , after having transferred into the output matrix, the memory banks assigned to the first column of the input matrix, taking into account the order of the interleaved data, the memory banks are assigned into the output matrix to the next columns of this matrix. 
         [0061]    Thus, in the same way, the memory banks assigned to the output matrix are transferred by identifying the value of the corresponding data in the interleaving matrix and by copying the memory banks into the input matrix, taking into account the natural order of data identified by the matrix M 1  ( FIG. 7 ). 
         [0062]    During the next step, illustrated in  FIG. 8 , a new memory bank assignment step is carried out, on the basis of the natural order. However, in this case, care is taken to assign the memory banks B 3  and B 4  in a particular order in order to avoid access conflicts, but also to enable the use of means of permutation for the passage of data from a previous column to a current column. 
         [0063]    Actually, at this stage, the memory bank B 3  should be assigned to the cell ( 1 ,  2 ) of the input matrix in order to enable the use of means of permutation between the first column and the second column. 
         [0064]    After this assignment has been performed, the memory banks are transferred in the same way, referring to  FIG. 9 , into the output matrix, taking into account the interleaved order. 
         [0065]    As seen in  FIGS. 10 and 11 , the last two free boxes of the output matrix should then simply be filled and the memory banks transferred into the input matrix taking the natural order into account. 
         [0066]    Thus, as seen in  FIG. 12 , starting from the natural order, the data can be successively arranged in the input matrix, producing on the one hand a double offset and, on the other, a neutral offset. 
         [0067]    Thus it will be appreciated that it is possible to minimize the complexity of controlling the means of permutation which, as far as the second offset is concerned, can then be inactivated. 
         [0068]    As far as the interleaved order is concerned, the data are successively arranged in memory by implementing a permutation of “−1” and a double permutation of “+2”. 
         [0069]    Thus it can be seen that the interleaving can be implemented by means of an arrangement of the data in memory using only “barrel-shifter” type offset means. 
         [0070]    The data arranged in memory are then arranged according to the following sequences, as far as banks B 1 , B 2 , B 3  and B 4  are concerned. 
         [0071]    Bank B 1 : {1, 8, 9,} 
         [0072]    Bank B 2 : {4, 11, 12} 
         [0073]    Bank B 3 : {2, 3, 7} 
         [0074]    Bank B 4 : {5, 6, 10} 
         [0075]    Thus, as seen in  FIG. 13 , the architecture enabling the method of interleaving to be implemented that has just been described, only uses regular data permutation means, e.g. of the “barrel-shifter” type,  1 ,  2  each controlled by a means of control  3 ,  4  providing memory storage of the data originating from the processing blocks B 1 , B 2 , . . . , B n  in the memory banks M 1 , M 2 , . . . M n  themselves controlled by a means of control  5  used for addressing the memory banks. 
         [0076]    This overall scheme can be achieved by means of various types of architectures. 
         [0077]    Thus, referring to  FIG. 14 , which illustrates a first embodiment of the disclosure, provision is made to access in parallel different memory banks M 1 , M 2 , M 3 , M 4  and M 5  placed between two permutation stages. As can be seen, the permutation stages BS and the memory banks are each controlled by a control stage CTRL 1 , CTRL 2  and CTRL 3  under the control of a counter CPT. 
         [0078]    As seen in  FIG. 15 , in a second embodiment, a single permutation stage BS can also be used for accessing the set of memory banks M 1 , M 2 , M 3 , M 4  and M 5 . 
         [0079]    In a third embodiment, seen in  FIG. 16 , a single permutation stage BS is used for accessing, in parallel, memory banks M 1 , M 2 , M 3  and M 4  under the control of respective control stages CTRL 1  and CTRL 2 , themselves under the control of a counter CPT. The memory banks M 1 , M 2 , M 3  and M 4  are themselves connected to multiplexers MUX controlled by a control stage CTRL 3 . 
         [0080]    Finally, in a fourth embodiment, shown in  FIG. 17 , the permutation stage BS is placed downstream from the memory banks M 1 , M 2 , M 3 , M 4 , M 5  and M′ 1 , M′ 2 , M′ 3 , M′ 4  and M′ 5  for example for receiving data in parallel originating from said processing stages. 
         [0081]    It may be advantageous to set forth definitions of certain words and phrases used in this patent document. The term “couple” and its derivatives refer to any direct or indirect communication between two or more elements, whether or not those elements are in physical contact with one another. The terms “include” and “comprise,” as well as derivatives thereof, mean inclusion without limitation. The term “or” is inclusive, meaning and/or. The phrases “associated with” and “associated therewith,” as well as derivatives thereof, may mean to include, be included within, interconnect with, contain, be contained within, connect to or with, couple to or with, be communicable with, cooperate with, interleave, juxtapose, be proximate to, be bound to or with, have, have a property of, or the like. 
         [0082]    While this disclosure has described certain embodiments and generally associated methods, alterations and permutations of these embodiments and methods will be apparent to those skilled in the art. Accordingly, the above description of example embodiments does not define or constrain this disclosure. Other changes, substitutions, and alterations are also possible without departing from the spirit and scope of this disclosure, as defined by the following claims.