Back to results
US 7,890,834 B2Granted
Apparatus comprising a circular buffer and method for assigning redundancy versions to a circular buffer
AssigneeMotorola Mobility LLC
InventorsYufei W. Blankenship, T. Keith Blankenship, Brian K. Classon, Ajit Nimbalker
Life of this patent
Estimating the term…
Abstract
During operation of a transmitter a circular buffer is created where only column tops of the circular buffer are defined as a starting position for a redundancy version. Where the circular buffer is in sequence format, all possible redundancy versions are at positions ┌Kstream/32┐(12×i+σ), i=0, 1, . . . , 7 where σ indicates the column index of the starting position of the first RV (RV0).
Claims31
A method for assigning redundancy versions to a circular buffer of a transport block, the method comprising the steps of:
- segmenting a transport block into multi code block segments;
- encoding a segment associated with transport block with an encoder to generate a systematic bit stream and two parity bit streams;
- inserting dummy bits in each stream to generate systematic bits, a first block of parity bits, and second block of parity bits, wherein the systematic bits, the first block of parity bits, and the second block of parity bits all comprise dummy bits;
- individually block interleaving the systematic bits, first block of parity bits, and second block of parity bits;
- interlacing the first block of parity bits with the second block of parity bits to create interlaced parity bits;
- pre-pending the interleaved systematic bits to the interlaced parity bits to create a circular buffer;
- determining a buffer size of a shortened circular buffer per segment based on floor(NIR/C), where C is the number of segments for the Transport block, determined by the code block segmentation rule and wherein NIR is the total soft buffer size per Hybrid Automatic Repeat reQuest process;
- receiving a redundancy version (RV) and a number of desired bits;
- and
- outputting from the shortened circular buffer the number of desired bits starting at the RV position.
7 more elements
A method for assigning redundancy versions to a circular buffer of a transport block, the method comprising the steps of:
- segmenting a transport block into multi code block segments,
- encoding a segment associated with transport block with an encoder to generate a systematic bit stream and two parity bit streams;
- rate matching the systematic bit stream and two parity streams to create a circular buffer;
- determining a buffer size per segment based on floor(NIR/C), where C is the number of segments for the Transport block, determined by the code block segmentation rule and wherein NIR is the total soft buffer size per Hybrid Automatic Repeat reQuest process;
- shortening the circular buffer based on the buffer size per segment;
- receiving a redundancy version (RV) and a number of desired bits;
- and
- outputting from the shortened circular buffer the number of desired bits starting at the RV position.
5 more elements
A method for assigning redundancy versions to a circular buffer, the method comprising the steps of:
- receiving systematic bits, a first block of parity bits, and a second block of parity bits, wherein the systematic bits, the first block of parity bits, and the second block of parity bits all comprise dummy bits;
- individually block interleaving the systematic bits, first block of parity bits, and second block of parity bits;
- interlacing the first block of parity bits with the second block of parity bits to create interlaced parity bits;
- pre-pending the interleaved systematic bits to the interlaced parity bits to create a circular buffer;
- defining redundancy versions to start in a particular row of the circular buffer;
- receiving a redundancy version (RV) and a number of desired bits;
- and
- outputting the number of desired bits starting at the RV bit position.
5 more elements
An apparatus comprising:
- an encoder outputting systematic bits, a first block of parity bits, and a second block of parity bits;
- rate matching circuitry receiving the systematic bits, first block of parity bits, and second block of parity bits and creating a circular buffer having dummy bits, and wherein a particular row of the circular buffer contains starting points of the redundancy versions (RVs), and wherein the rate matching circuitry outputs non-dummy bits from the circular buffer to a transmitter starting at a particular RV;
- transmission circuitry receiving the non-dummy bits and transmitting the non-dummy bits.
An apparatus comprising:
- an encoder outputting systematic bits, a first block of parity bits, and a second block of parity bits, each of length Kstream;
- rate matching circuitry receiving the systematic bits, first block of parity bits, and second block of parity bits and individually interleaving the systematic bits, first block of parity bits, and second block of parity bits;
- logic circuitry defining redundancy versions (RV) corresponding to a bit position within a stream of data to start outputting data, and wherein the RVs start at positions ┌Kstream/32┐(C×i+σ), i=0, 1, . . . , Y−1 and
- where C indicates the number of columns between two adjacent RVs, Y is the number of RVs defined, σ indicates the column index of the starting position of the first RV (RV0), and
- wherein the stream comprises the interleaved systematic bits, and an interleaved and interlaced first and second block of parity bits, and dummy bits;
- and
- transmission circuitry receiving non-dummy bits starting at a particular RV and transmitting the non-dummy bits.
4 more elements
Dependencies are inferred from the claim text.