Abstract:
According to the invention, a pair of coordinates (c1, r1) of a rectangular matrix is calculated for a certain index k of an interleaved or deinterleaved sequence of symbols. Said pair of coordinates is corrected so as to take into account fillers in the rectangular matrix. A transformed pair of coordinates (c6, r6) is determined for the corrected pair of coordinates (c4, r5) by means of a matrix coordinate transformation (T1) process. A valid interleaving address or deinterleaving address I (k) is then calculated from the transformed pair of coordinates (c6, r6) at a timing step k.
Abstract:
A method for detection of a control channel includes receiving data transmitted via the control channel. A control channel receive quality is estimated based on a metric difference between a metric of a known final trellis state and a minimum metric amongst the metrics of the trellis states based on the received data. It is decided whether or not to detect the control channel depending on the estimated control channel receive quality.
Abstract:
The receiver synchronization method provides transmission time interval synchronization by repetitive checking of the reception signal for detection of a synchronization time slot within a signal structure contained in the reception signal, the maximum number of repetitions being greater than the number of possible synchronization time slots within the signal structure, the actual number of repetitions controlled by an interrupt condition (3).
Abstract:
A decoding apparatus includes at least one decoder both for a turbo-decoding and for a Viterbi decoding, at least one first data path for the Viterbi decoding of a convolution code, at least one second data path for the decoding of a turbo code, and a common memory having a multiplicity of individual memory areas. It is possible to allocate at least one memory area both through the first data path in the Viterbi mode and through the second data path in the turbo mode. The invention also includes a trellis processor and a method for operating a decoding apparatus in which at least parts of the first data path and of the second data path can be utilized jointly both for the turbo decoding and for the Viterbi decoding.
Abstract:
Depending on the sequence of the decoded payload signal bits (am1, . . . , amA) and redundancy checking bits (pm1, . . . , pmL) which are produced by the Viterbi traceback, either some of these bits are inserted by means of a distribution device (1) from the front into a linear feedback shift register (10), or some of these bits are inserted by means of the distribution device (1) from the rear into a linear feedback shift register (10), or all of them are inserted into a linear feedback shift register (20) from the rear with the allocated coefficients being unchanged, or all of them are inserted into a shift register from the front with the allocated coefficients being inverted. This allows a redundancy checking process to be carried out on a transmitted data block in the shift register (10; 20) without temporary storage of the bits produced by the decoding process.
Abstract:
The method involves the computation of a data channel by path weights for a data signal in a receiver and computing an uncorrected path weight for the data signal transmitted over a regulated data channel using a common pilot channel (CPICH). The uncorrected path weight is corrected by multiplication of a correction factor which contains the relationship of a data channel-specific reinforcement estimation to a pilot-channel-based reinforcement estimation. - An INDEPENDENT CLAIM is included for a device for the computation of a data channel regulated by path weights of a data signal
Abstract:
The method involves calculating a coordinate pair of a square matrix, in dependence on k. The coordinate pair is corrected to allow for fill characters (d). The transformed coordinate pair is determined from the corrected coordinate pair by matrix-coordinate transformation. A valid interleaving or de-interleaving address is calculated from the transformed coordinate pair in accordance with the writing allocation rule. Independent claims are included for : (1) an apparatus for calculating interleaving and de-interleaving addresses; (2) a turbo decoder; and (3) a turbo encoder.
Abstract:
Depending on the sequence of the decoded payload signal bits (am1, . . . , amA) and redundancy checking bits (pm1, . . . , pmL) which are produced by the Viterbi traceback, either some of these bits are inserted by means of a distribution device (1) from the front into a linear feedback shift register (10), or some of these bits are inserted by means of the distribution device (1) from the rear into a linear feedback shift register (10), or all of them are inserted into a linear feedback shift register (20) from the rear with the allocated coefficients being unchanged, or all of them are inserted into a shift register from the front with the allocated coefficients being inverted. This allows a redundancy checking process to be carried out on a transmitted data block in the shift register (10; 20) without temporary storage of the bits produced by the decoding process.
Abstract:
A decoding apparatus includes at least one decoder both for a turbo-decoding and for a Viterbi decoding, at least one first data path for the Viterbi decoding of a convolution code, at least one second data path for the decoding of a turbo code, and a common memory having a multiplicity of individual memory areas. It is possible to allocate at least one memory area both through the first data path in the Viterbi mode and through the second data path in the turbo mode. The invention also includes a trellis processor and a method for operating a decoding apparatus in which at least parts of the first data path and of the second data path can be utilized jointly both for the turbo decoding and for the Viterbi decoding.