Abstract:
Successive sequences of interleaved data samples extracted from a virtual memory having L0 columns and C0 rows are de-interleaved. The de-interleaving includes receiving each sequence of the interleaved data samples, and writing row by row the received sequences of interleaved data samples in a de-interleaving memory array having L rows and C columns, with L being greater or equal to L0 and C being greater or equal to C0. The data samples stored in the de-interleaving memory array are de-interleaved sub-array by sub-array. Each sub-array is a square cluster array having a number SQ of rows and columns. A cluster array is a row of the square cluster array comprising SQ data samples, with the number L of rows and the number C of columns of the de-interleaving memory array being multiples of the number SQ of rows and columns.
Abstract:
An electronic device may include a source memory device partitioned into N elementary source memories for storing a sequence of input data sets, and a processor clocked by a clock signal and having N outputs for producing, per cycle of the clock signal, N output data sets respectively associated with the N input data sets stored in the N elementary source memories at respective source addresses. The electronic device may also include N single port target memories, N interleaving tables including, for each relative source address, the number of a target memory and the respective target address thereof, N cells connected in a ring structure. Further, each cell may also be connected between an output of the processor, an interleaving table, and a target memory.
Abstract:
An aspect of the present invention is the use of two criteria in channel estimation, e.g. a value related to the length of an estimated Channel Impulse Response (CIR) and a value related to a noise content of the received signal, e.g. a Signal-to-Noise Ratio (SNR). These parameters can be used for the post-processing algorithm. An advantage of the present invention is that it is much more robust against long channels and/or high noise contents in received signals. Additionally it has moderate implementation complexity.
Abstract:
A multi-carrier transmission system has a plurality of transceivers, each having a receiver and a transmitter. Data is transmitted between the transceivers by modulating the data onto a multiplicity of carrier waves in the form of multi-bit symbols, wherein each carrier wave constitutes a channel, and wherein the number of bits per symbol (the bit loading), varies between channels and, within a channel, with time, so that each channel has associated therewith a bit loading parameter. In operation, the multi-carrier system is adapted to synchronously update, at the transceivers, the bit loading parameters associated with each channel by transmission of data over a control channel, in that the control channel is established, at system start-up, on a predetermined one of the multiplicity of carrier waves whose identity is known to the transceivers, and in that the control channel is, after start-up, changed from the predetermined channel to a further channel, selected by the first transceiver on the basis of channel characteristics.
Abstract:
A clock offset compensation arrangement may include a fractional interpolator for applying a trigonometric interpolation to a sampled input signal according to a clock offset signal. It uses transform-based processing in the frequency domain. Compared to a polynomial type interpolation it may be easier to implement, and may achieve a closer approximation to an ideal interpolation. It may reduce the effects of non-linear type errors introduced by truncation of higher powers. The arrangement may be applied to receivers or transmitters of multi-carrier modems, as well as other applications which use rate adaptation or synchronization.
Abstract:
Successive groups of N bits are delivered at a delivery frequency Fe greater than a predetermined frequency PRF. At least one of the successive groups includes at least one subgroup of at least one bit defining at least one digital cue of position and of shape of at least one base pulse within a window of length 1/PRF. This digital cue is converted into the base pulse, and the base pulse is filtered using a high-pass filter for providing a pulse of the ultra wideband type within the window with a temporal accuracy equal to 1/N*Fe.
Abstract translation:N个比特的连续组以大于预定频率PRF的传送频率Fe传送。 连续组中的至少一个包括至少一个位的至少一个子群,其限定长度为1 / PRF的窗口内的至少一个基本脉冲的位置和形状的至少一个数字提示。 该数字提示被转换成基本脉冲,并且使用高通滤波器对基本脉冲进行滤波,以便以等于1 / N * Fe的时间精度在窗口内提供超宽带类型的脉冲。
Abstract:
A method is provided for decoding a turbo-code encoded signal in a receiver. According to the method, the signal is received from a transmission channel, and the signal is digitally turbo-code decoded. Additionally, a quality information representative of conditions of the channel state estimation is dynamically determined, and the quality information is dynamically compared with a predetermined criteria for defining good or bad estimation conditions. A Maximum-A-Posteriori algorithm in the logarithmic domain is dynamically selected for good estimation conditions, or an approximation of the Maximum-A-Posteriori algorithm in the logarithmic domain is dynamically selected for bad estimation conditions. Also provided is a receiver that implements such a decoding method.
Abstract:
The method of interference cancellation in a CDMA wireless communication system comprises receiving an incident digital signal containing a user signal transmitted on a CDMA user physical channel and an interfering signal, projecting said incident digital signal onto a projection space orthogonal to the space containing said interfering signal, filtering said projected signal with a filter matched to the CDMA user physical channel for detecting the data contained in said user signal.
Abstract:
The successive values of the digital symbols which can each take M different possible values are estimated on the basis of the successive values of digital samples each of which results from the combination of at most L successive symbols. This estimation includes a stage by stage progression through a trellis of the Viterbi type with Mk states, with k being less than or equal to Lnull1. All the states of all the stages are respectively provided with aggregate metrics. When taking into account the sample of rank n, all the transitions arriving at the various states of the current stage of the trellis are partitioned into M groups, each group containing all the transitions arising from the states of the preceding stage which are associated with one of the M possible values of the symbol of rank nnullk. The various aggregate metrics are calculated for these various states of the current stage of the trellis. One of the transitions which leads to the state provided with a extremum aggregate metric is determined in each group. A unique decision is taken regarding the value of the symbol of rank nnullk by detecting the group associated with the extremum of these M extremum aggregate metrics. This unique decision is provided with a symbol-confidence index formulated from these M extremum aggregate metrics.
Abstract:
A method for estimating the impulse response of an information transmission channel includes evaluating a useful number of coefficients of an impulse response of the information transmission channel as a function of actual characteristics of the information transmission channel. This evaluation is carried out, for example, by using a time domain spreading parameter of the channel.