US6622281B1 — Rate matching method in mobile communication syst…

Claim 1

Independent Claim 112 words

A rate matching puncturing method in a mobile communication system, comprising: (a) performing a channel coding for bits of a transport channel and outputting a predetermined number of channel-coded sequences; (b) constructing a first interleaving pattern based on the channel-coded sequences; (c) constructing a virtual interleaving pattern for each of the channel-coded sequences based on the first interleaving pattern; (d) calculating shifting values in each column of the virtual interleaving patterns constructed in step (c) and determining bit positions to be punctured in each of the virtual interleaving patterns based on said shifting values; and (e) puncturing bits in the first interleaving pattern based upon the bit positions identified in step (d).

Claim 2

Dependent Claim 112 words

A rate matching puncturing method in a mobile communication system, comprising: (a) performing a channel coding for bits of a transport channel and outputting a predetermined number of channel-coded sequences; (b) constructing a first interleaving pattern based on the channel-coded sequences; (c) constructing a virtual interleaving pattern for each of the channel-coded sequences based on the first interleaving pattern; (d) calculating shifting values in each column of the virtual interleaving patterns constructed in step (c) and determining bit positions to be punctured in each of the virtual interleaving patterns based on said shifting values; and (e) puncturing bits in the first interleaving pattern based upon the bit positions identified in step (d).

Claim 3

Dependent Claim 20 words

The method of claim 1 , wherein in step (e), bits corresponding to a systematic sequence bits are not punctured.

Claim 4

Dependent Claim 46 words

The method of claim 2 , wherein the channel-coded sequences include a turbo-coded first parity sequence and a turbo-coded second parity sequence, and wherein step (e) includes puncturing uniform bit numbers of the first parity sequence and the second parity sequence in the first interleaving pattern.

Claim 5

Dependent Claim 82 words

The method of claim 1 , wherein step (d) comprises: computing initial error offset values after deciding a bit position to be initially punctured in each of the virtual interleaving patterns; calculating a puncturing distance to be applied to each of the virtual interleaving patterns based upon the initially punctured bit position computed for each of the virtual interleaving patterns; and applying the computed initial error offset values and the calculated puncturing distance to compute the shifting values in said each column.

Claim 6

Dependent Claim 45 words

The method of claim 4 , wherein the puncturing distance is a maximum integer value that is not over a column size of each of the virtual interleaved patterns divided by a bit number to be punctured for a column of the virtual interleaved patterns.

Claim 7

Dependent Claim 13 words

The method of claim 1 , wherein the channel-coded sequences are turbo-coded sequences.

Claim 8

Dependent Claim 12 words

The method of claim 1 , wherein said predetermined number is 1.

Claim 9

Dependent Claim 14 words

The method of claim 1 , wherein said predetermined number is greater than 1.

Claim 10

Dependent Claim 18 words

The method of claim 1 , wherein the virtual interleaving patterns have a same number of bit positions.

Claim 11

Dependent Claim 31 words

The method of claim 9 , wherein the calculating step includes: calculating the bit-shifting values so that same bit positions are determined for puncturing in each of the virtual interleaving patterns.

Claim 12

Dependent Claim 20 words

The method of claim 10 , wherein the virtual interleaving patterns include a same number of columns of bit positions.

Claim 13

Dependent Claim 28 words

The method of claim 11 , wherein the number of columns in each of the virtual interleaving patterns equals a number of columns in the first interleaving pattern.

Claim 14

Dependent Claim 27 words

The method of claim 12 , wherein the bit-shifting values determine a same number of bit positions for puncturing in each column of the virtual interleaving patterns.

Claim 15

Dependent Claim 23 words

The method of claim 1 , wherein the channel-coded sequences consists of a turbo-coded first parity sequence and a turbo-coded second parity sequence.

Claim 16

Dependent Claim 184 words

A rate matching puncturing method in a mobile communication system, comprising: (a) performing a channel coding for bits of a transport channel and outputting a predetermined number of channel-coded sequences; (b) constructing a first interleaving pattern based on the channel-coded sequences; (c) constructing a virtual interleaving pattern for each of the channel-coded sequences based on the first interleaving pattern; (d) calculating shifting values in each column of the virtual interleaving patterns constructed in step (c) and determining at least one bit position to be punctured based on said shifting values; and (e) puncturing bits in the first interleaving pattern based upon the at least one bit position identified in step (d), wherein the channel-coded sequences are turbo-coded, and wherein a prescribed puncturing bit number for the turbo coding is P, wherein the determining step in (d) is performed for └P/2┘ number of bits on a first parity sequence and the puncturing is executed for ┌P/2┐ number of bits on a second parity sequence and wherein ┌P/2┐ is a minimum integer value greater than P/2 and └P/2┘ is a maximum integer less than said P/2.

Claim 17

Dependent Claim 184 words

A rate matching puncturing method in a mobile communication system, comprising: (a) performing a channel coding for bits of a transport channel and outputting a predetermined number of channel-coded sequences; (b) constructing a first interleaving pattern based on the channel-coded sequences; (c) constructing a virtual interleaving pattern for each of the channel-coded sequences based on the first interleaving pattern; (d) calculating shifting values in each column of the virtual interleaving patterns constructed in step (c) and determining at least one bit position to be punctured based on said shifting values; and (e) puncturing bits in the first interleaving pattern based upon the at least one bit position identified in step (d), wherein the channel-coded sequences are turbo-coded, and wherein a prescribed puncturing bit number for the turbo coding is P, wherein the determining step in (d) is performed for └P/2┘ number of bits on a first parity sequence and the puncturing is executed for ┌P/2┐ number of bits on a second parity sequence and wherein ┌P/2┐ is a minimum integer value greater than P/2 and └P/2┘ is a maximum integer less than said P/2.

Claim 18

Dependent Claim 184 words

A rate matching puncturing method in a mobile communication system, comprising: (a) performing a channel coding for bits of a transport channel and outputting a predetermined number of channel-coded sequences; (b) constructing a first interleaving pattern based on the channel-coded sequences; (c) constructing a virtual interleaving pattern for each of the channel-coded sequences based on the first interleaving pattern; (d) calculating shifting values in each column of the virtual interleaving patterns constructed in step (c) and determining at least one bit position to be punctured based on said shifting values; and (e) puncturing bits in the first interleaving pattern based upon the at least one bit position identified in step (d), wherein the channel-coded sequences are turbo-coded, and wherein a prescribed puncturing bit number for the turbo coding is P, wherein the determining step in (d) is performed for ┌P/2┐ number of bits on a first parity sequence and the puncturing is executed for └P/2┘ number of bits on a second parity sequence and wherein ┌P/2┐ is a minimum integer value greater than P/2 and └P/2┘ is a maximum integer less than said P/2.

Claim 19

Dependent Claim 184 words

A rate matching puncturing method in a mobile communication system, comprising: (a) performing a channel coding for bits of a transport channel and outputting a predetermined number of channel-coded sequences; (b) constructing a first interleaving pattern based on the channel-coded sequences; (c) constructing a virtual interleaving pattern for each of the channel-coded sequences based on the first interleaving pattern; (d) calculating shifting values in each column of the virtual interleaving patterns constructed in step (c) and determining at least one bit position to be punctured based on said shifting values; and (e) puncturing bits in the first interleaving pattern based upon the at least one bit position identified in step (d), wherein the channel-coded sequences are turbo-coded, and wherein a prescribed puncturing bit number for the turbo coding is P, wherein the determining step in (d) is performed for ┌P/2┐ number of bits on a first parity sequence and the puncturing is executed for └P/2┘ number of bits on a second parity sequence and wherein ┌P/2┐ is a minimum integer value greater than P/2 and └P/2┘ is a maximum integer less than said P/2.

Claim 20

Dependent Claim 208 words

A rate matching puncturing method in a mobile communication system, comprising: (a) performing a channel coding for bits of a transport channel and outputting a predetermined number of channel-coded sequences; (b) constructing a first interleaving pattern based on the channel-coded sequences; (c) constructing a virtual interleaving pattern for each of the channel-coded sequences based on the first interleaving pattern; (d) calculating shifting values in each column of the virtual interleaving patterns constructed in step (c) and determining at least one bit position to be punctured based on said shifting values; and (e) puncturing bits in the first interleaving pattern based upon the at least one bit position identified in step (d), wherein the channel-coded sequences are turbo-coded, and wherein a prescribed puncturing bit number for the turbo coding is P, wherein the determining step in (d) a parameter is decided so that ┌P/2┐ number of bits are each punctured on a first parity sequence and on a second parity sequence and wherein a rate matching pattern determination excludes a final puncturing in a column unit of a first interleaver for one parity sequence out of two parity sequences, said puncturing being for the first parity sequence and the second parity sequence among sequences output after the turbo coding.

Claim 21

Dependent Claim 208 words

A rate matching puncturing method in a mobile communication system, comprising: (a) performing a channel coding for bits of a transport channel and outputting a predetermined number of channel-coded sequences; (b) constructing a first interleaving pattern based on the channel-coded sequences; (c) constructing a virtual interleaving pattern for each of the channel-coded sequences based on the first interleaving pattern; (d) calculating shifting values in each column of the virtual interleaving patterns constructed in step (c) and determining at least one bit position to be punctured based on said shifting values; and (e) puncturing bits in the first interleaving pattern based upon the at least one bit position identified in step (d), wherein the channel-coded sequences are turbo-coded, and wherein a prescribed puncturing bit number for the turbo coding is P, wherein the determining step in (d) a parameter is decided so that ┌P/2┐ number of bits are each punctured on a first parity sequence and on a second parity sequence and wherein a rate matching pattern determination excludes a final puncturing in a column unit of a first interleaver for one parity sequence out of two parity sequences, said puncturing being for the first parity sequence and the second parity sequence among sequences output after the turbo coding.

Claim 22

Dependent Claim 123 words

A rate matching method for uplink in a mobile communication system, comprising: branching off bits of a transport channel into a systematic sequence, a first parity sequence, and a second parity sequence which are outputted from a turbo-encoder; constructing a first interleaving pattern based on the branched-off sequences; constructing a virtual interleaving pattern for each of the first parity sequence and the second parity sequence based on a mapping rule with a corresponding interleaving pattern; calculating shifting values for each column of each of the virtual interleaving patterns; deciding bit positions to be punctured in each of the virtual interleaving patterns using the calculated shifting values; and puncturing bits in the first interleaving pattern according to the decided bit positions to be punctured.

Claim 23

Dependent Claim 123 words

A rate matching method for uplink in a mobile communication system, comprising: branching off bits of a transport channel into a systematic sequence, a first parity sequence, and a second parity sequence which are outputted from a turbo-encoder; constructing a first interleaving pattern based on the branched-off sequences; constructing a virtual interleaving pattern for each of the first parity sequence and the second parity sequence based on a mapping rule with a corresponding interleaving pattern; calculating shifting values for each column of each of the virtual interleaving patterns; deciding bit positions to be punctured in each of the virtual interleaving patterns using the calculated shifting values; and puncturing bits in the first interleaving pattern according to the decided bit positions to be punctured.

Claim 24

Dependent Claim 67 words

The method of claim 18 , wherein the calculating step comprises: computing initial error offset values after deciding a bit position to be initially punctured in the virtual interleaving patterns; calculating a puncturing distance based upon the initial puncturing bit position decided for each of the virtual interleaving patterns; and applying the computed initial error offset values and the calculated puncturing distance to compute the shifting values.

Claim 25

Dependent Claim 37 words

The method of claim 19 , wherein the puncturing distance is a maximum integer value that is not over a column size of each of the virtual interleaving patterns divided by a bit number to be punctured.

Claim 26

Dependent Claim 25 words

The method of claim 19 , wherein the puncturing distance corresponds to code values according to a prescribed puncturing rate for the virtual interleaving patterns.

Claim 27

Dependent Claim 31 words

The method of claim 21 , wherein said puncturing distance is a positive value when said prescribed puncturing rate is over 50%, and said puncturing distance is a negative value otherwise.

Claim 28

Dependent Claim 35 words

The method of claim 21 , wherein shifting parameters for each column are calculated using the number of non-punctured bits for each column when said pre-decided puncturing rate for each parity sequence is over 50%.

Claim 29

Dependent Claim 189 words

A rate matching method for uplink in a mobile communication system, comprising: branching off bits of a transport channel into a systematic sequence, a first parity sequence, and a second parity sequence which are outputted from a turbo-encoder; constructing a first interleaving pattern based on the branched-off sequences; constructing a virtual interleaving pattern for each of the first parity sequence and the second parity sequence based on a mapping rule with a corresponding interleaving pattern; calculating shifting values for each column of each of the virtual interleaving patterns; deciding at least one bit position to be punctured in each of the virtual interleaving patterns using the calculated shifting values; and puncturing bits in the first interleaving pattern according to the at least one decided bit position to be punctured, wherein in said puncturing step, the puncturing is performed for a number of bits equivalent to a maximum integer value not over P/2 for the first parity sequence, and the puncturing is performed for a number of bits equivalent to a minimum integer value larger than P/2 for the second parity sequence, wherein a prescribed puncturing bit number is P.

Claim 30

Dependent Claim 189 words

A rate matching method for uplink in a mobile communication system, comprising: branching off bits of a transport channel into a systematic sequence, a first parity sequence, and a second parity sequence which are outputted from a turbo-encoder; constructing a first interleaving pattern based on the branched-off sequences; constructing a virtual interleaving pattern for each of the first parity sequence and the second parity sequence based on a mapping rule with a corresponding interleaving pattern; calculating shifting values for each column of each of the virtual interleaving patterns; deciding at least one bit position to be punctured in each of the virtual interleaving patterns using the calculated shifting values; and puncturing bits in the first interleaving pattern according to the at least one decided bit position to be punctured, wherein in said puncturing step, the puncturing is performed for a number of bits equivalent to a maximum integer value not over P/2 for the first parity sequence, and the puncturing is performed for a number of bits equivalent to a minimum integer value larger than P/2 for the second parity sequence, wherein a prescribed puncturing bit number is P.

Claim 31

Dependent Claim 189 words

A rate matching method for uplink in a mobile communication system, comprising: branching off bits of a transport channel into a systematic sequence, a first parity sequence, and a second parity sequence which are outputted from a turbo-encoder; constructing a first interleaving pattern based on the branched-off sequences; constructing a virtual interleaving pattern for each of the first parity sequence and the second parity sequence based on a mapping rule with a corresponding interleaving pattern; calculating shifting values for each column of each of the virtual interleaving patterns; deciding at least one bit position to be punctured in each of the virtual interleaving patterns using the calculated shifting values; and puncturing bits in the first interleaving pattern according to the at least one decided bit position to be punctured, wherein in said puncturing step, the puncturing is performed for a number of bits equivalent to a minimum integer value larger than P/2 for the first parity sequence, and the puncturing is performed for a number of bits equivalent to a maximum integer value not over P/2 for the second parity sequence, wherein a prescribed puncturing bit number is P.

Claim 32

Dependent Claim 189 words

A rate matching method for uplink in a mobile communication system, comprising: branching off bits of a transport channel into a systematic sequence, a first parity sequence, and a second parity sequence which are outputted from a turbo-encoder; constructing a first interleaving pattern based on the branched-off sequences; constructing a virtual interleaving pattern for each of the first parity sequence and the second parity sequence based on a mapping rule with a corresponding interleaving pattern; calculating shifting values for each column of each of the virtual interleaving patterns; deciding at least one bit position to be punctured in each of the virtual interleaving patterns using the calculated shifting values; and puncturing bits in the first interleaving pattern according to the at least one decided bit position to be punctured, wherein in said puncturing step, the puncturing is performed for a number of bits equivalent to a minimum integer value larger than P/2 for the first parity sequence, and the puncturing is performed for a number of bits equivalent to a maximum integer value not over P/2 for the second parity sequence, wherein a prescribed puncturing bit number is P.

Claim 33

Dependent Claim 82 words

A sequence repetition method for uplink rate matching in a mobile communication system, comprising: performing in a frame unit a channel coding for bits of a transport channel; constructing a first interleaving pattern; calculating a mean repetition distance according to a prescribed bit repetition rate; computing shifting values based on respective columns in the first interleaving pattern using the mean repetition distance; and deciding a repetition bit position in the constructed first interleaving pattern using a corresponding one of the shifting values.

Claim 34

Dependent Claim 82 words

A sequence repetition method for uplink rate matching in a mobile communication system, comprising: performing in a frame unit a channel coding for bits of a transport channel; constructing a first interleaving pattern; calculating a mean repetition distance according to a prescribed bit repetition rate; computing shifting values based on respective columns in the first interleaving pattern using the mean repetition distance; and deciding a repetition bit position in the constructed first interleaving pattern using a corresponding one of the shifting values.

Claim 35

Dependent Claim 122 words

A sequence repetition method for an uplink rate matching in a mobile communication system comprising: performing in a frame unit a channel coding for bits of a transport channel; constructing a first interleaving pattern; calculating a mean repetition distance according to a prescribed bit repetition rate; computing shifting values based on respective columns in the first interleaving pattern using the mean repetition distance; and deciding a repetition bit position in the constructed first interleaving pattern using a corresponding one of the shifting values, wherein values of 0 and 1 are alternatively used as the shifting values per each column to decide the repetition bit position, when said calculated mean repetition distance is not over 2 and a bit repetition rate exceeds 50%.

Claim 36

Dependent Claim 122 words

A sequence repetition method for an uplink rate matching in a mobile communication system comprising: performing in a frame unit a channel coding for bits of a transport channel; constructing a first interleaving pattern; calculating a mean repetition distance according to a prescribed bit repetition rate; computing shifting values based on respective columns in the first interleaving pattern using the mean repetition distance; and deciding a repetition bit position in the constructed first interleaving pattern using a corresponding one of the shifting values, wherein values of 0 and 1 are alternatively used as the shifting values per each column to decide the repetition bit position, when said calculated mean repetition distance is not over 2 and a bit repetition rate exceeds 50%.

Claim 37

Dependent Claim 166 words

A sequence repetition method for an uplink rate matching in a mobile communication system comprising: performing in a frame unit a channel coding for bits of a transport channel; constructing a first interleaving pattern; calculating a mean repetition distance according to a prescribed bit repetition rate; computing shifting values based on respective columns in the first interleaving pattern using the mean repetition distance; and deciding a repetition bit position in the constructed first interleaving pattern using a corresponding one of the shifting values, wherein when a bit repetition rate exceeds 100%, the shifting values are calculated by performing a one time repetition of an original input sequence, re-computing the mean repetition distance for each sequence provided for deciding a twice repeated bit position from a modulo operation result for the remaining bit number to be repeated on a length of the original input sequence, and re-calculating the mutually shifting values of each column in the constructed first interleaving pattern by using the re-computed mean repetition distance.

Claim 38

Dependent Claim 166 words

A sequence repetition method for an uplink rate matching in a mobile communication system comprising: performing in a frame unit a channel coding for bits of a transport channel; constructing a first interleaving pattern; calculating a mean repetition distance according to a prescribed bit repetition rate; computing shifting values based on respective columns in the first interleaving pattern using the mean repetition distance; and deciding a repetition bit position in the constructed first interleaving pattern using a corresponding one of the shifting values, wherein when a bit repetition rate exceeds 100%, the shifting values are calculated by performing a one time repetition of an original input sequence, re-computing the mean repetition distance for each sequence provided for deciding a twice repeated bit position from a modulo operation result for the remaining bit number to be repeated on a length of the original input sequence, and re-calculating the mutually shifting values of each column in the constructed first interleaving pattern by using the re-computed mean repetition distance.

Claim 39

Dependent Claim 36 words

The method of claim 28 , wherein said bit shifting values are computed again by deciding the mean repetition distance as 1, when the bit repetition rate is twice the length of the original input sequence.

Claim 40

Independent Claim 99 words

A method of calculating a shifting parameter for an uplink of a communication system, comprising: forming a virtual interleaver for each of at least two parity sequences of a bit stream; calculating shifting parameter values for respective ones of at least two parity sequences based on virtual interleavers; mapping each of at least two parity sequences from each of the virtual interleavers to a corresponding radio frame of a first interleaver sequence of a first interleaver, the first interleaver sequence including the at least two parity sequences and a systematic bit sequence; and rate matching the first interleaver sequence.

Claim 41

Independent Claim 99 words

A method of calculating a shifting parameter for an uplink of a communication system, comprising: forming a virtual interleaver for each of at least two parity sequences of a bit stream; calculating shifting parameter values for respective ones of at least two parity sequences based on virtual interleavers; mapping each of at least two parity sequences from each of the virtual interleavers to a corresponding radio frame of a first interleaver sequence of a first interleaver, the first interleaver sequence including the at least two parity sequences and a systematic bit sequence; and rate matching the first interleaver sequence.

Claim 42

Dependent Claim 55 words

The method of claim 30 , wherein the virtual interleaver is formed by sequentially inserting bits from the corresponding parity sequence into an interleaver format having a number of columns equal to a number of columns of the first interleaver, wherein the first bit in the sequence is the first bit in the corresponding interleaver.

Claim 43

Dependent Claim 102 words

The method of claim 31 , wherein the mapping of each of the virtual interleavers to the first interleaver is described by one of Q 1 (k)=(3k+1) mod K and Q 2 (k)=(3k+2) mod K, wherein Q 1 (k) represents the column of the first interleaver to which a kth column of the first virtual interleaver is mapped, Q 2 (k) represents the column of the first interleaver to which a kth column of the second virtual interleaver is mapped, ‘k’ represents a sequence number, and ‘K’ is the number of columns in each of the virtual interleavers and the first interleaver.

Claim 44

Dependent Claim 26 words

The method of claim 30 , wherein the at least two parity bit streams are generated by a turbo encoder along with a systematic bit stream.

Claim 45

Dependent Claim 79 words

The method of claim 33 , wherein a number of bits to be punctured from a first one of the at least two parity bit streams is the lower bound of a total number of bits to be punctured divided by two, and wherein a number of bits to be punctured from a second one of the at least two parity bit streams is the upper bound of the total number of bits to be punctured divided by two.

Claim 46

Independent Claim 150 words

A method of calculating a shifting parameter for an uplink of a communication system, comprising: forming a virtual interleaver for each of at least two parity sequences of a bit stream; calculating shifting parameter values for respective ones of at least two parity sequences based on virtual interleavers; mapping each of at least two parity sequences from each of the virtual interleavers to a corresponding radio frame of a first interleaver sequence of a first interleaver, the first interleaver sequence including the at least two parity sequences and a systematic bit sequence; and rate matching the first interleaver sequence, wherein an initial offset value for the rate matching is described by e ini =(a*S(k)*y+N)mod (a*N), wherein a is a constant, S(k) is the shifting parameter, y is an amount of puncturing or repetition to occur in the rate matching, and N is a number of bits in a radio frame.

Claim 47

Independent Claim 150 words

A method of calculating a shifting parameter for an uplink of a communication system, comprising: forming a virtual interleaver for each of at least two parity sequences of a bit stream; calculating shifting parameter values for respective ones of at least two parity sequences based on virtual interleavers; mapping each of at least two parity sequences from each of the virtual interleavers to a corresponding radio frame of a first interleaver sequence of a first interleaver, the first interleaver sequence including the at least two parity sequences and a systematic bit sequence; and rate matching the first interleaver sequence, wherein an initial offset value for the rate matching is described by e ini =(a*S(k)*y+N)mod (a*N), wherein a is a constant, S(k) is the shifting parameter, y is an amount of puncturing or repetition to occur in the rate matching, and N is a number of bits in a radio frame.

Claim 48

Dependent Claim 8 words

The method of claim 35 , wherein a=2.

Claim 49

Dependent Claim 15 words

The method of claim 35 , wherein S(k) is zero for the first radio frame.

Claim 50

Independent Claim 147 words

A method of calculating a shifting parameter for an uplink of a communication system, comprising: forming a virtual interleaver for each of at least two parity sequences of a bit stream; calculating shifting parameter values for respective ones of at least two parity sequences based on virtual interleavers; mapping each of at least two parity sequences from each of the virtual interleavers to a corresponding radio frame of a first interleaver sequence of a first interleaver, the first 1 interleaver sequence including the at least two parity sequences and a systematic bit sequence; and rate matching the first interleaver sequence, wherein an average puncturing distance is the lower bound of a bit length of each column of the virtual interleaver divided by an absolute value of a difference between a number of bits after rate matching minus the bit length of each column of the virtual interleaver.

Claim 51

Independent Claim 147 words

A method of calculating a shifting parameter for an uplink of a communication system, comprising: forming a virtual interleaver for each of at least two parity sequences of a bit stream; calculating shifting parameter values for respective ones of at least two parity sequences based on virtual interleavers; mapping each of at least two parity sequences from each of the virtual interleavers to a corresponding radio frame of a first interleaver sequence of a first interleaver, the first 1 interleaver sequence including the at least two parity sequences and a systematic bit sequence; and rate matching the first interleaver sequence, wherein an average puncturing distance is the lower bound of a bit length of each column of the virtual interleaver divided by an absolute value of a difference between a number of bits after rate matching minus the bit length of each column of the virtual interleaver.

Claim 52

Dependent Claim 74 words

The method of claim 38 , wherein if the average puncturing distance is even, then a substitute puncturing distance is used to determine the shifting pattern, wherein the substitute puncturing distance is equal to the puncturing distance minus a quotient of a greatest common denominator of the puncturing distance and the interleaver depth, divided by the interleaver depth, and wherein if the puncturing distances is odd, the substitute puncturing distance is the puncturing distance.

Claim 53

Dependent Claim 63 words

The method of claim 38 , wherein a shifting parameter for a radio frame of a first virtual interleaver is calculated as S 1 [R[(3k+1)mod K]]=┌i*q′┐div K, wherein R[x] indicates a bit reversal of x, q′ is the substitute puncturing distance, k represents a sequence number, and K is the number of columns in each of the virtual interleavers and the first interleaver.

Claim 54

Dependent Claim 9 words

The method of claim 40 , wherein k=|└i*q′|┘mod K.

Claim 55

Dependent Claim 63 words

The method of claim 38 , wherein a shifting parameter for a radio frame of a second virtual interleaver is calculated as S 2 [R[(3k+1)mod K]]=┌i*q′┐div K, wherein R[x] indicates a bit reversal of x, q′ is the substitute puncturing distance, k represents a sequence number, and K is the number of columns in each of the virtual interleavers and the first interleaver.

Claim 56

Dependent Claim 31 words

The method of claim 38 , wherein the puncturing distance is a positive number for a puncturing rate over 50% and is a negative number for a puncturing rate under 50%.

Claim 57

Dependent Claim 40 words

The method of claim 38 , wherein the greatest common denominator is calculated using an absolute value of the puncturing distance,and wherein the substitute puncturing distance is calculated by one of adding and subtracting the quotient to/from the puncturing value.

Claim 58

Independent Claim 269 words

A method of calculating a shifting parameter for an uplink of a communication system, comprising: forming a virtual interleaver for each of at least two parity sequences of a bit stream; calculating shifting parameter values for respective ones of at least two parity sequences based on virtual interleavers; mapping each of at least two parity sequences from each of the virtual interleavers to a corresponding radio frame of a first interleaver sequence of a first interleaver, the first interleaver sequence including the at least two parity sequences and a systematic bit sequence; and rate matching the first interleaver sequence, wherein when the rate matching is performed using repetition and the repetition factor is greater than or equal to 50%, an average puncturing distance “q” is defined as a lower bound of a bit length of each column of the virtual interleaver divided by a difference between a number of bits after rate matching minus the bit length of each column of the virtual interleaver, and wherein if the average puncturing distance is even, then a substitute puncturing distance “q′” is defined as the average puncturing distance minus a quotient of a greatest common denominator of the average puncturing distance and the interleaver depth, divided by the interleaver depth, and wherein if the puncturing distances is odd, the substitute puncturing distance is the puncturing distance, and wherein a shifting parameter for a radio frame is calculated as S[R[┌k*q┐mod K]]=┌k*q′┐div K, wherein R[x] indicates a bit reversal of x, k represents a sequence number, and K is the number of columns in each of the virtual interleavers and the first interleaver.

Claim 59

Independent Claim 269 words

A method of calculating a shifting parameter for an uplink of a communication system, comprising: forming a virtual interleaver for each of at least two parity sequences of a bit stream; calculating shifting parameter values for respective ones of at least two parity sequences based on virtual interleavers; mapping each of at least two parity sequences from each of the virtual interleavers to a corresponding radio frame of a first interleaver sequence of a first interleaver, the first interleaver sequence including the at least two parity sequences and a systematic bit sequence; and rate matching the first interleaver sequence, wherein when the rate matching is performed using repetition and the repetition factor is greater than or equal to 50%, an average puncturing distance “q” is defined as a lower bound of a bit length of each column of the virtual interleaver divided by a difference between a number of bits after rate matching minus the bit length of each column of the virtual interleaver, and wherein if the average puncturing distance is even, then a substitute puncturing distance “q′” is defined as the average puncturing distance minus a quotient of a greatest common denominator of the average puncturing distance and the interleaver depth, divided by the interleaver depth, and wherein if the puncturing distances is odd, the substitute puncturing distance is the puncturing distance, and wherein a shifting parameter for a radio frame is calculated as S[R[┌k*q┐mod K]]=┌k*q′┐div K, wherein R[x] indicates a bit reversal of x, k represents a sequence number, and K is the number of columns in each of the virtual interleavers and the first interleaver.

Claim 60

Independent Claim 270 words

A method of calculating a shifting parameter for an uplink of a communication system, comprising: forming a virtual interleaver for each of at least two parity sequences of a bit stream; calculating shifting parameter values for respective ones of at least two parity sequences based on virtual interleavers; mapping each of at least two parity sequences from each of the virtual interleavers to a corresponding radio frame of a first interleaver sequence of a first interleaver, the first interleaver sequence including the at least two parity sequences and a systematic bit sequence; and rate matching the first interleaver sequence, wherein when the rate matching is performed using repetition and the repetition factor is greater than or equal to 100%, an average puncturing distance “q” is defined as a lower bound of a bit length of each column of the virtual interleaver divided by a difference between a number of coded bits after rate matching minus the bit length of each column of the virtual interleaver, and wherein if the average puncturing distance is even, then a substitute puncturing distance “q′” is defined as the average puncturing distance minus a quotient of a greatest common denominator of the average puncturing distance and the interleaver depth, divided by the interleaver depth, and wherein if the puncturing distances is odd, the substitute puncturing distance is the puncturing distance, and wherein a shifting parameter for a radio frame is calculated as S[R[┌k*q┐mod K]]=┌k*q′┐div K, wherein R[x] indicates a bit reversal of x, k represents a sequence number, and K is the number of columns in each of the virtual interleavers and the first interleaver.

Claim 61

Independent Claim 270 words

A method of calculating a shifting parameter for an uplink of a communication system, comprising: forming a virtual interleaver for each of at least two parity sequences of a bit stream; calculating shifting parameter values for respective ones of at least two parity sequences based on virtual interleavers; mapping each of at least two parity sequences from each of the virtual interleavers to a corresponding radio frame of a first interleaver sequence of a first interleaver, the first interleaver sequence including the at least two parity sequences and a systematic bit sequence; and rate matching the first interleaver sequence, wherein when the rate matching is performed using repetition and the repetition factor is greater than or equal to 100%, an average puncturing distance “q” is defined as a lower bound of a bit length of each column of the virtual interleaver divided by a difference between a number of coded bits after rate matching minus the bit length of each column of the virtual interleaver, and wherein if the average puncturing distance is even, then a substitute puncturing distance “q′” is defined as the average puncturing distance minus a quotient of a greatest common denominator of the average puncturing distance and the interleaver depth, divided by the interleaver depth, and wherein if the puncturing distances is odd, the substitute puncturing distance is the puncturing distance, and wherein a shifting parameter for a radio frame is calculated as S[R[┌k*q┐mod K]]=┌k*q′┐div K, wherein R[x] indicates a bit reversal of x, k represents a sequence number, and K is the number of columns in each of the virtual interleavers and the first interleaver.

Claim 62

Dependent Claim 56 words

The method of claim 46 , wherein if the modulus of th e difference between a number of bits after rate matching minus the bit length of each column of the virtual interleaver modulo the bit length of each column of the virtual interleaver is ‘0′’, then the average puncturing sequence “q” is set to ‘1’.

Claim 63

Dependent Claim 108 words

A communication device for calculating a shifting parameter for an uplink of a communication system, comprising: means for forming a virtual interleaver for each of at least two parity sequences of a bit stream; means for calculating shifting parameter values for respective ones of at least two parity sequences based on virtual interleavers; means for mapping each of at least two parity sequences from each of the virtual interleavers to a corresponding radio frame of a first interleaver sequence of a first interleaver, the first interleaver sequence including the at least two parity sequences and a systematic bit sequence; and means for rate matching the first interleaver sequence.

Claim 64

Dependent Claim 108 words

A communication device for calculating a shifting parameter for an uplink of a communication system, comprising: means for forming a virtual interleaver for each of at least two parity sequences of a bit stream; means for calculating shifting parameter values for respective ones of at least two parity sequences based on virtual interleavers; means for mapping each of at least two parity sequences from each of the virtual interleavers to a corresponding radio frame of a first interleaver sequence of a first interleaver, the first interleaver sequence including the at least two parity sequences and a systematic bit sequence; and means for rate matching the first interleaver sequence.

Claim 65

Dependent Claim 55 words

The device of claim 40 , wherein the virtual interleaver is formed by sequentially inserting bits from the corresponding parity sequence into an interleaver format having a number of columns equal to a number of columns of the first interleaver, wherein the first bit in the sequence is the first bit in the corresponding interleaver.

Claim 66

Dependent Claim 102 words

The device of claim 49 , wherein the mapping of each of the virtual interleavers to the first interleaver is described by one of Q 1 (k)=(3k+1) mod K and Q 2 (k)=(3k+2) mod K, wherein Q 1 (k) represents the column of the first interleaver to which a kth column of the first virtual interleaver is mapped, Q 2 (k) represents the column of the first interleaver to which a kth column of the second virtual interleaver is mapped, k represents a sequence number, and K is the number of columns in each of the virtual interleavers and the first interleaver.

Claim 67

Dependent Claim 58 words

The device of claim 48 , wherein an initial offset value for the rate matching is described by eini=(a*S(k)* y+N) mod (a*N), wherein a is a constant, S(k) is the shifting parameter, y is an amount of puncturing or repetition to occur in the rate matching, and N is a number of coded bits in a radio frame.

Claim 68

Dependent Claim 8 words

The device of claim 51 , wherein a=2.

Claim 69

Dependent Claim 15 words

The device of claim 51 , wherein S(k) is zero for the first radio frame.

Claim 70

Dependent Claim 155 words

A communication device for calculating a shifting parameter for an uplink of a communication system, comprising: means for forming a virtual interleaver for each of at least two parity sequences of a bit stream; means for calculating shifting parameter values for respective ones of at least two parity sequences based on virtual interleavers; means for mapping each of at least two parity sequences from each of the virtual interleavers to a corresponding radio frame of a first interleaver sequence of a first interleaver, the first interleaver sequence including the at least two parity sequences and a systematic bit sequence; and means for rate matching the first interleaver sequence, wherein an average puncturing distance is the lower bound of a bit length of each column of the virtual interleaver divided by an absolute value of a difference between a number of bits after rate matching minus the bit length of each column of the virtual interleaver.

Claim 71

Dependent Claim 155 words

A communication device for calculating a shifting parameter for an uplink of a communication system, comprising: means for forming a virtual interleaver for each of at least two parity sequences of a bit stream; means for calculating shifting parameter values for respective ones of at least two parity sequences based on virtual interleavers; means for mapping each of at least two parity sequences from each of the virtual interleavers to a corresponding radio frame of a first interleaver sequence of a first interleaver, the first interleaver sequence including the at least two parity sequences and a systematic bit sequence; and means for rate matching the first interleaver sequence, wherein an average puncturing distance is the lower bound of a bit length of each column of the virtual interleaver divided by an absolute value of a difference between a number of bits after rate matching minus the bit length of each column of the virtual interleaver.

Claim 72

Dependent Claim 64 words

The device of claim 54 , wherein a shifting parameter for a radio frame of a first virtual interleaver is calculated as S 1 [R[(3k+1)mod K]]=i*q’ div K, wherein R[x] indicates a bit reversal of x, q′ is the substitute puncturing distance, k represents a sequence number, and K is the number of columns in each of the virtual interleavers and the first interleaver.

Claim 73

Dependent Claim 10 words

The device of claim 55 , wherein k=i*q′ mod K.

Claim 74

Dependent Claim 64 words

The device of claim 54 , wherein a shifting parameter for a radio frame of a second virtual interleaver is calculated as S 2 [R[(3k+2)mod K]]=i*q′ div K, wherein R[x] indicates a bit reversal of x, q′ is the substitute puncturing distance, k represents a sequence number, and K is the number of columns in each of the virtual interleavers and the first interleaver.

Claim 75

Independent Claim 102 words

A method of calculating a shifting factor, comprising: identifying first and second parity bits in an interleaved bit stream containing a plurality of first and second bits; forming first and second virtual interleavers from respective sequences of first and second parity bits, the first and second virtual interleavers having a same number of columns as the interleaved bit stream; performing a shifting algorithm to the bits of the virtual interleaver to determine bits to be selected for one of puncturing and repeating; and mapping the selected bits to corresponding positions on the interleaved bit stream to perform one of puncturing and repeating.

Claim 76

Independent Claim 102 words

A method of calculating a shifting factor, comprising: identifying first and second parity bits in an interleaved bit stream containing a plurality of first and second bits; forming first and second virtual interleavers from respective sequences of first and second parity bits, the first and second virtual interleavers having a same number of columns as the interleaved bit stream; performing a shifting algorithm to the bits of the virtual interleaver to determine bits to be selected for one of puncturing and repeating; and mapping the selected bits to corresponding positions on the interleaved bit stream to perform one of puncturing and repeating.

Claim 77

Independent Claim 137 words

A method of rate matching in a communication channel, comprising: receiving a number of bits, the bits including a first plurality of bits, a second plurality of bits and third plurality of bits; interleaving the number of received bits to a matrix having a first prescribed number of rows and a second prescribed number of columns; providing at least one first shifting parameter for the second plurality of bits based on a first prescribed variable mod K; providing at least one second shifting parameter for the third plurality of bits based on a second prescribed variable mod K; and rate matching the number of interleaved bits based on at least one of the first shifting parameter and the second shifting parameter to a channel bit rate of the communication channel, wherein K=the second prescribed number of columns.

Claim 78

Independent Claim 137 words

A method of rate matching in a communication channel, comprising: receiving a number of bits, the bits including a first plurality of bits, a second plurality of bits and third plurality of bits; interleaving the number of received bits to a matrix having a first prescribed number of rows and a second prescribed number of columns; providing at least one first shifting parameter for the second plurality of bits based on a first prescribed variable mod K; providing at least one second shifting parameter for the third plurality of bits based on a second prescribed variable mod K; and rate matching the number of interleaved bits based on at least one of the first shifting parameter and the second shifting parameter to a channel bit rate of the communication channel, wherein K=the second prescribed number of columns.

Claim 79

Dependent Claim 17 words

The method of claim 59 , wherein the first prescribed variable is 3k+1, wherein k=0 to k<K.

Claim 80

Dependent Claim 17 words

The method of claim 60 , wherein the second prescribed variable is 3k+2, wherein k=0 to k<K.

Claim 81

Dependent Claim 15 words

The method of claim 61 , wherein K equals 8, and k equals K−a constant.

Claim 82

Dependent Claim 33 words

The method of claim 59 , wherein an output of the rate matching step is N+ΔN, where N is the number of bits and ΔN is indicative of an amount of rate matching.

Claim 83

Dependent Claim 15 words

The method of claim 63 , wherein ΔN is a negative value indicative of puncturing.

Claim 84

Dependent Claim 67 words

The method of claim 64 , wherein a number of bits to be punctured from the second plurality of bits is the lower bound of a total number of bits to be punctured divided by two, and wherein a number of bits to be punctured from the third plurality of bits is the upper bound of the total number of bits to be punctured divided by two.

Claim 85

Dependent Claim 84 words

The method of claim 65 , wherein a first average puncturing distance is the lower bound of a bit length of the second plurality of bits divided by an absolute value of the number of bits to be punctured from the second plurality of bits and a second average puncturing distance is the lower bound of a bit length of the third plurality of bits divided by an absolute value of the number of bits to be punctured from the third plurality of bits.

Claim 86

Dependent Claim 15 words

The method of claim 63 , wherein ΔN is a positive value indicative of repetition.

Claim 87

Dependent Claim 14 words

The method of claim 59 , wherein the communication channel is the transport channel.

Claim 88

Dependent Claim 15 words

The method of claim 68 , wherein the transport channel is an uplink transport channel.

Claim 89

Dependent Claim 34 words

The method of claim 59 , wherein the rate matching step further comprises: providing an initial offset value based on at least one of the first and second shifting parameters and a prescribed value.

Claim 90

Dependent Claim 46 words

The method of claim 70 , wherein the rate matching step further comprises at least one of incrementing and decrementing the initial offset value for updating an offset value based on a bit position of at least one of the second and third plurality of bits.

Claim 91

Dependent Claim 35 words

The method of claim 70 , wherein the prescribed value is equal to one of 1 or 2 depending upon whether the bits are the second plurality of bits or the third plurality of bits.

Claim 92

Dependent Claim 32 words

The method of claim 70 , wherein the initial offset value is based on (a*S(k)* third prescribed variable) mod (a*fourth prescribed variable), where S(k) is one of first and second shifting parameters.

Claim 93

Dependent Claim 45 words

The method of claim 73 , wherein the third prescribed variable equals y+N, where y is an amount of puncturing or repetition to occur in the rate matching and N is a number of bits of one of the second and third plurality of bits.

Claim 94

Dependent Claim 30 words

The method of claim 73 , wherein the fourth prescribed variable is a*N, where N is a number of bits of one of the second and third plurality of bits.

Claim 95

Dependent Claim 20 words

The method of claim 59 , wherein the number of bits comprises turbo encoded bits of an uplink transport channel.

Claim 96

Dependent Claim 27 words

The method of claim 59 , wherein rate matching is performed for at least one of the second plurality of bits and the third plurality of bits.

Claim 97

Dependent Claim 11 words

The method of claim 77 , wherein the constant equals 1.

Claim 98

Dependent Claim 35 words

The method of claim 59 , wherein the rate matching is performed based on the number of bits of a radio frame or based on column by column of the second prescribed number of columns.

Claim 99

Dependent Claim 25 words

The method of claim 59 , wherein the shifting parameter is indicative of a shift of a puncturing or repetition pattern for a radio frame.

Claim 100

Independent Claim 123 words

A method of rate matching in a communication channel, comprising: receiving a number of bits, the bits including a first plurality of bits, a second plurality of bits and third plurality of bits; interleaving the number of received bits to a matrix having a first prescribed number of rows and a second prescribed number of columns; providing a plurality of shifting parameters based on a plurality of prescribed factors multiplied by a first prescribed value, wherein the first prescribed value is different depending upon whether the bits are the second plurality of bits or the third plurality of bits; and rate matching the number of interleaved bits based on the plurality of shifting parameters to a channel bit rate of the communication channel.

Claim 101

Independent Claim 123 words

A method of rate matching in a communication channel, comprising: receiving a number of bits, the bits including a first plurality of bits, a second plurality of bits and third plurality of bits; interleaving the number of received bits to a matrix having a first prescribed number of rows and a second prescribed number of columns; providing a plurality of shifting parameters based on a plurality of prescribed factors multiplied by a first prescribed value, wherein the first prescribed value is different depending upon whether the bits are the second plurality of bits or the third plurality of bits; and rate matching the number of interleaved bits based on the plurality of shifting parameters to a channel bit rate of the communication channel.

Claim 102

Dependent Claim 31 words

The method of claim 81 , wherein the first prescribed value equals one of (1) two for the second plurality of bits and (2) one for the third plurality of bits.

Claim 103

Dependent Claim 30 words

The method of claim 81 , wherein the first plurality of bits are systematic bits and the second and third plurality of bits are first and second parity bits, respectively.

Claim 104

Dependent Claim 26 words

The method of claim 81 , wherein the plurality of prescribed factors is based (3*k+a second prescribed value) mod K, where k equals 0 to K−1.

Claim 105

Dependent Claim 19 words

The method of claim 84 , wherein the second prescribed value equals 1 for the second plurality of bits.

Claim 106

Dependent Claim 19 words

The method of claim 84 , wherein the second prescribed value equals 2 for the third plurality of bits.

Claim 107

Dependent Claim 20 words

The method of claim 81 , wherein the number of bits comprises turbo encoded bits of an uplink transport channel.

Claim 108

Dependent Claim 28 words

The method of claim 81 , wherein the rate matching is performed for at least one of the second plurality of bits and the third plurality of bits.

Claim 109

Dependent Claim 35 words

The method of claim 81 , wherein the rate matching is performed based on the number of bits of a radio frame or based on column by column of the second prescribed number of columns.

Claim 110

Independent Claim 106 words

A method of rate matching in a communication system, comprising: receiving a number of bits, the bits including a first plurality of bits, a second plurality of bits and third plurality of bits; interleaving the number of received bits to a matrix having a first prescribed number of rows and a second prescribed number of columns; providing a plurality of shifting parameters based on R=ΔNi mod N; and rate matching the number of interleaved bits based on the plurality of shifting parameters to a channel bit rate of the communication channel, where ΔNi equals bit quantity for rate matching and N equals the number of bits.

Claim 111

Independent Claim 106 words

A method of rate matching in a communication system, comprising: receiving a number of bits, the bits including a first plurality of bits, a second plurality of bits and third plurality of bits; interleaving the number of received bits to a matrix having a first prescribed number of rows and a second prescribed number of columns; providing a plurality of shifting parameters based on R=ΔNi mod N; and rate matching the number of interleaved bits based on the plurality of shifting parameters to a channel bit rate of the communication channel, where ΔNi equals bit quantity for rate matching and N equals the number of bits.

Claim 112

Dependent Claim 24 words

The method of claim 90 , wherein if R≠0 and 2*R≦R, q=┌N/R┐ else q=┌N/(R−N)┐, where q is equal the amount to be rate matched.

Claim 113

Dependent Claim 15 words

The method of claim 90 , wherein ΔN is a negative value indicative of puncturing.

Claim 114

Dependent Claim 15 words

The method of claim 90 , wherein ΔN is a positive value indicative of repetition.

Claim 115

Dependent Claim 27 words

The method of claim 90 , wherein rate matching is performed for at least one of the second plurality of bits and the third plurality of bits.

Claim 116

Dependent Claim 35 words

The method of claim 90 , wherein the rate matching is performed based on the number of bits of a radio frame or based on column by column of the second prescribed number of columns.

Claim 117

Dependent Claim 33 words

The method of claim 95 , wherein the first interleaving pattern includes a plurality of columns and wherein a same number of bits are punctured in each column of the first interleaving pattern.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	2006-09-15	2007-03-17	2007-09-16	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2010-09-15	2011-03-17	2011-09-16	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2014-09-15	2015-03-17	2015-09-16	$7700.00	Window Closed / Lapsed

Rate matching method in mobile communication system

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag