Abstract:
The invention relates to de-interleaving successive sequences of interleaved data samples extracted from a virtual memory having L0 columns and C0 rows, in particular for high-throughput applications. The method comprises the steps of:
receiving each sequence of said interleaved data samples and writing row by row said received sequences of interleaved data samples in a de-interleaving memory array (2) having L rows and C columns, L being superior or equal to L0 and C being superior or equal to C0, and de-interleaving the data samples stored in said de-interleaving memory array (2) sub-array by sub-array, the used predetermined sub-array being a square cluster array having a predetermined number SQ of rows and columns, the number L of rows and the number C of columns of the de-interleaving memory array (2) being multiples of the number SQ of rows and columns. De-interleaving the de-interleaving memory array (2) sub-array by sub-array allows to avoid memory re-use bottleneck and allows to decrease memory access rate.
Abstract:
The block de-interleaving system comprises
input means for receiving a set of time-aligned blocks of interleaved data ; physical memory means ; and de-interleaving means for writing said blocks in said memory means in a first predetermined manner and reading said blocks from said memory means in a second predetermined manner in order to deinterleave the data of said blocks.
The physical memory means comprise several different physical elementary memories (M_1, M_2, ..., M_K), and by the fact that said de-interleaving means are adapted to totally write and read a block into and from one physical elementary memory (M_1, M_2, ..., M_K).
Abstract:
Method of de-interleaving S2 received sequences of interleaved received data samples respectively issued from S2 physical channels (phc_0,phc_1,...,phc_S2-1) and able to be associated with S1 output transport channels (otc_0,otc_1,...,otc_S1-1). Said S2 received sequences have been delivered, before transmission, by a two-stages multi-interleaving device (2), from S1 initial sequences of ordered data samples respectively associated to S1 initial transport channels (itc_0,itc_1,...itc_S1-1). Said two-stages multi-interleaving device (2) comprises a first stage (3) including S1 interleaving blocks (Int1_0,Int1_1,...Int1_S1-1) respectively associated to the S1 initial transport channels (itc_0,itc_1,...itc_S1-1), a second stage (4) including S2 interleaving blocks (Int2_0,Int2_1,...Int2_S2-1) respectively associated to the S2 physical channels (phc_0,phc_1,...,phc_S2-1) and an inter-stage of predetermined data-routing functions (5) connected between said first and second stages (3,4). The two stages of interleavers (3,4) and the inter-stage of predetermined data routing functions (5) are merged into one stage and second and first stage de-interleaving is performed when the received data samples are written to memory elements (me_0,me_1,...me_S1-1) that are associated with the S1 output transport channels.
Abstract:
The method comprises: - sampling (50) the signal, - elaborating trellis information (TRIF) representative of a trellis including reference paths respectively associated to different reference values of said drift, - processing (51) the sampled signal along said trellis including selecting at an initial instant at least one sample within a pulse repetition period and for each selected sample going trellis step by trellis step over at least some of said reference paths starting from said selected sample and for each path accumulating at each node of said path the level of the corresponding sample of said signal thereby obtaining a path metric, and - selecting (52) the path having the greatest path metric, the estimated actual drift value being the reference value associated to said selected path.
Abstract:
Method for estimating a sequence of N bits (x̂ 0 x̂ 1 ...x̂ N-1 ) corresponding to a received sequence of M digital data (r 0 r 1 ...r M-1 ). The method comprising the steps of :
determining (31) candidate sequences of M RS digital data from a reduced reference sequence space comprising 2 N RS reduced reference sequences of M RS reference digital data (s 0 s 1 ...s M RS -1 ),M RS being inferior to M and 2 N RS being inferior or equal to 2 N ; making up (32) each candidate sequence with remaining reference symbols to obtain at least one complete candidate sequence of M digital data ; and determining (33) said sequence of N bits (x̂ 0 x̂ 1 ... x̂ N-1 ) from all the complete candidate sequences.
Abstract translation:用于估计与接收的M个数字数据序列(r0r1 ... rM-1)相对应的N位序列(x / 0x / 1 ... x / N-1) 。 该方法包括以下步骤:从包括MRS参考数字数据(s0s1 ... sMRS-1)的2个NRS减少的参考序列的缩减参考序列空间中确定(31)MRS数字数据的候选序列,MRS低于 M和2 低于或等于2 ; 使用剩余的参考符号组成(32)每个候选序列,以获得M个数字数据的至少一个完整候选序列; 以及从所有完整的候选序列确定(33)所述N个比特序列(x / 0 x / 1 ... x / N-1)。