摘要:
In wireless communication carried out by a user equipment (UE), the UE receives one or more transport blocks and makes a determination on the transport blocks, such as determining whether block size and timing advance exceed thresholds, or determining a control channel type associated with the received transport blocks. The UE makes a determination whether to perform skip-decoding of the received transport blocks based, at least in part, on the determination made.
摘要:
In wireless communication carried out by a user equipment (UE), the UE receives one or. more transport blocks and makes a determination on the transport blocks, such as determining whetlier block st¾e and timing advance exceed thresholds. Or determining a control channel type associated with the received transport blocks. The UE makes a determination whether to perform skip-decoding of the received, transport blocks based, at least in part, on the determination made.
摘要:
To reduce an error rate of received data, a MIMO processing unit (202) receives data transmitted from a transmitter via antennas (201-0 to 201-3) and separates packets of layers 0 to 3 transmitted from respective antennas of the transmitter. Maximal ratio combining units (203-0 to 203-3) perform maximal ratio combining on duplicate portions of packets of the layers 0 to 3. Turbo decoding units (204-0 to 204-3) perform turbo decoding on packets of the layers 0 to 3 in which respective duplicate portions are maximal-ratio-combined. A soft-decision value combining unit (205) combines soft-decision values for respective information bits of the layers 0 to 3 obtained as a result of turbo decoding on packets of the layers 0 to 3 by the turbo decoding units (204-0 to 204-3). A hard-decision unit (206) obtains hard-decision values corresponding to respective information bits of the layers 0 to 3 in the transmitter.
摘要:
An iterative message passing decoder, e.g., an LDPC decoder, operating in conjunction with a soft input-soft output signal processing unit, e.g., an ISI detector, has an error floor performance region influenced by the decoder's sub-optimal message passing nature. Error floor reduction is achieved by a simple message re-initialization mechanism. Decoder edge states, e.g., constraint to variable node messages in decoder memory, are reinitialized, e.g., for an iteration, during the decoding after soft values provided by signal processing unit have improved.; During the message re-initialization and for some subsequent amount of iterative decoder processing, extrinsic information fed back from the decoder to the signal processing unit and/or soft values delivered to the decoder from the signal processing unit, in an outer communications loop, is temporarily frozen, e.g., using a switch and a buffer. Then, the outer communications loop is restored as the decoding continues, achieving improved decoding performance.
摘要:
A receiver employs iterative decoding of packet data, where the packet data represents a data frame encoded with at least two logical dimensions. A logical dimension refers to a layer, or sub-layer, of a layered network architecture. Consequently, a first logical dimension of encoding might refer to error detection in a packet frame at the data link layer, while a second logical dimension of coding might refer to error detection/correction encoding at a physical layer. For example, a data frame might be divided into several packets, each with a corresponding cyclic redundancy check (CRC) value as coding in the first logical dimension, which are then transmitted with a convolutional code as coding in the second logical dimension. The receiver performs iterative decoding in the first and second logical dimensions until either i) all errors are identified and corrected or ii) another type of stopping condition is met.
摘要:
A method and apparatus for providing adaptive cyclic redundancy check (CRC) computation is disclosed. A transport block size is determined. Transport block (TB) CRC bits are computed with a first CRC generator when the TB size is less than or equal to a predetermined threshold. TB CRC bits are computed with a second CRC generator when the transport block size is greater than the predetermined threshold. When the TB is greater than the predetermined threshold, the TB is segmented into code blocks (CBs) and CB CRC bits are computed with the first CRC generator. A method and apparatus for handling adaptively cyclic redundancy check (CRC) encoded transport blocks (TBs) is also disclosed. A TB is received. The TB is CRC checked based on a first CRC generator when the TB size is less than or equal to a predetermined threshold. Code blocks of the TB are CRC checked based on the first CRC generator when the TB size is greater than the predetermined threshold. When the TB size is greater than the predetermined threshold, the code blocks are concatenated, and the TB is CRC checked based on a second CRC generator.
摘要:
Puncture sequences S1, S2, etc. for code rates R1, R2, etc. less than a maximum code rate Rmax are defined subsets of a maximum rate puncture sequence Smax that corresponds to the maximum code rate Rmax. Each puncture sequence Si for a code rate Ri is related to the puncture sequence Si-1 of the previous code rate Ri-1 and preferably S1⊆S2⊆S3⊆ ...⊆Smax-1⊆Smax. The puncture sequences are groups of one or more memory elements, each of which is a variable degree, a variable node location, a check degree, or a check node location. A method for deriving such a puncture sequence for variable code rates is also disclosed.
摘要:
Methods and apparatus for generating cyclic redundancy checks (CRCs). In one aspect of the present invention, a plurality of cyclic redundancy checks are calculated based upon a plurality of bits by using a selected cyclic redundancy check generator polynomial, at least one cyclic redundancy check is calculated based upon a first subset of the plurality of bits with a certain bit ordering, and at least another cyclic redundancy check is calculated based upon a second subset of the plurality of bits with a different bit ordering. The second subset of bits may overlap with the first subset of bits.