Abstract:
PROBLEM TO BE SOLVED: To provide a method of generating addresses for an interleaver of an encoder encoding multiple bits in parallel.SOLUTION: The method comprises: determining a first counter value corresponding to a first valid address; generating the first valid address from the first counter value; determining a second counter value corresponding to a second valid address; and generating the second valid address on the basis of the second counter value.
Abstract:
PROBLEM TO BE SOLVED: To reduce delay relating to convolutional or turbo coding. SOLUTION: In a method and an apparatus for encoding multiple bits in parallel, outputs are generated recursively. During each clock cycle, an encoder processes multiple bits and generates outputs consistent with those generated sequentially over multiple clock cycles in a conventional convolutional encoder. In one embodiment, input data are stored in multiple memory storage units, which are then each uniquely addressed to provide data to parallel encoders. COPYRIGHT: (C)2009,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To provide a method and an apparatus for efficient use of communication resources for processing a plurality of data frames in a communication system. SOLUTION: A data frame is partitioned into a plurality of portions of data symbols. A plurality of channel elements is assigned to demodulate data symbols of the plurality of portions of data symbols. Channel elements are assigned to the data frame at high data rate more than to the data frame at low data rate. COPYRIGHT: (C)2009,JPO&INPIT
Abstract:
Un procedimiento de codificación 5 de datos con un codificador (1200) de un sistema de comunicación inalámbrica, en el que el codificador es síncrono, comprendiendo el procedimiento: recibir una pluralidad de bits de información de entrada I[0]:I[3] en el codificador, en donde el procedimiento procesa la pluralidad de bits de información de entrada, I, y realiza los siguientes pasos durante un solo ciclo de reloj: - calcular los valores de estado S0[1]:S0[3], S1[1]:S1[3], S2[1]:S2[3], para el codificador, en base a la pluralidad de bits de información de entrada I[0]:I[3] y los valores de estado iniciales o almacenados S0[0] y S1[0]; y - generar un conjunto de valores codificados de salida X[0]:X[3], Y0[0]:Y0[3], Y1[0]:Y1[3] usando los valores de estado calculados S0[1]:S0[3], S1[1]:S1[3], S2[1]:S2[3], y la pluralidad de bits de información de entrada I[0]:I[3] y los valores de estado iniciales o almacenados S0[0] y S1[0] aplicando de forma recursiva: X[n] >= I[n]; Y0 [n] >= I[n] - S1[n] - S0[n]; y Y1 [n] >= I[n] - S0[n]; en las que I[n] representa un elemento n-ésimo de bits de dicha pluralidad de bits de información de entrada I[0]:I[3], X[n] representa una salida del codificador igual al n-ésimo bit de información de entrada; S0[n] y S1[n] representan elementos n-ésimos de bit de un primer y un segundo valor de estado de los valores de estado S0[0]:S03], S1[0]:S1[3], Y0[n] representa el primer elemento de bit de paridad enésimo de dicho conjunto de valores codificados de salida X[0]:X[3], Y0[0]: Y0[3], Y1[0]:Y1[3], Y1[n] representa el segundo elemento de bit de paridad enésimo de dicho conjunto de valores codificados de salida X[0]:X[3], Y0[0]:Y0[3], Y1[0]:Y1[3], - representa la operación lógica digital XOR y n representa un índice de iteración de la operación recursiva, en el que dicha etapa de cálculo de dichos valores de estado S0[1]:S0[3], S1[1]:S1[3], S2[1]:S2[3] utiliza: S0 [n + 1] >= I[n] - S1[n] - S2[n]; S1 [n + 1] >= S0[n]; y S2 [n + 1] >= S1[n], en las que S2[n] representa un elemento enésimo de bit de un tercer valor de estado S2[0]:S2[3].
Abstract:
The frame of data is partitioned into a plurality of portions of data symbols. A plurality of channel elements is assigned to demodulate data symbols of correspondingly the plurality of portions of data symbols. The number of the plurality of portions of data symbols is higher in a case at high data rate than a case at low data rate.
Abstract:
A method and apparatus for encoding multiple bits in parallel wherein outputs arc generated recursively. During each clock cycle, the encoder (1500) processes multiple bits and generates outputs consistent with those generated sequentially over multiple clock cycles in a conventional convolutional encoder. In one embodiment, input data is stored in multiple memory storage units (1104 to 1106), which are then each uniquely addressed to provide data to parallel encoders.
Abstract:
A method and apparatus for encoding multiple bits in parallel wherein outputs arc generated recursively. During each clock cycle, the encoder (1500) processes multiple bits and generates outputs consistent with those generated sequentially over multiple clock cycles in a conventional convolutional encoder. In one embodiment, input data is stored in multiple memory storage units (1104 to 1106), which are then each uniquely addressed to provide data to parallel encoders.
Abstract:
A method and apparatus for encoding multiple bits in parallel wherein outputs arc generated recursively. During each clock cycle, the encoder (1500) processes multiple bits and generates outputs consistent with those generated sequentially over multiple clock cycles in a conventional convolutional encoder. In one embodiment, input data is stored in multiple memory storage units (1104 to 1106), which are then each uniquely addressed to provide data to parallel encoders.
Abstract:
The frame of data is partitioned into a plurality of portions of data symbols. A plurality of channel elements is assigned to demodulate data symbols of correspondingly the plurality of portions of data symbols. The number of the plurality of portions of data symbols is higher in a case at high data rate than a case at low data rate.
Abstract:
Providing for noise estimation in wireless communication, and particularly for access request signals transmitted by a user equipment (UE), is described herein. By way of example, a wireless signal receiver can employ unused signal dimensions of a wireless network for noise estimation. In addition, the unused signal dimensions can be selected for time-frequency resources that are associated with a particular wireless channel, in order to obtain a noise estimate for that channel. By employing unused signal dimensions, a noise measurement is likely to include no other signal transmissions, and provide an accurate estimate of noise on that channel. According to various aspects of the subject disclosure, one or more Chu sequences employed for signal transmissions, root sequences thereof, or one or more cyclic shifts of a root sequence can be employed for the unused signal dimension.