초록 ▼

A method and apparatus for encoding and decoding data is described herein. During operation, data enters a convolutional encoder (101). The encoder encodes the information bits from the data at encoding rate (1/R0) to produce data symbols vectors P0, P1, . . . , PR0. Vectors P1, . . . , PR0 are each

A method and apparatus for encoding and decoding data is described herein. During operation, data enters a convolutional encoder (101). The encoder encodes the information bits from the data at encoding rate (1/R0) to produce data symbols vectors P0, P1, . . . , PR0. Vectors P1, . . . , PR0 are each interleaved separately to form vectors P0', P1', . . . , PR0'. A multiplexer (105) multiplexes P0', P1', . . . , PR0' to produce vector Q. The multiplexed interleaved symbols Q are input into symbol adder/remover (107) where appropriate symbols are added or removed to match an over-the-channel transmission rate. Finally, vector Q' is transmitted via over-the-channel transmission.

대표청구항 ▼

The invention claimed is: 1. A method for operating a transmitter, the method comprising the steps of: encoding an information vector to produce data symbol vectors P1, P2, . . . , PR0; interleaving vectors P1, . . . , PR0 to produce vectors P1', P2', . . . , PR0', wherein each vector P1, . . . ,

The invention claimed is: 1. A method for operating a transmitter, the method comprising the steps of: encoding an information vector to produce data symbol vectors P1, P2, . . . , PR0; interleaving vectors P1, . . . , PR0 to produce vectors P1', P2', . . . , PR0', wherein each vector P1, . . . , PR0 is interleaved separately; multiplexing vectors P1', P2', . . . , PR0' to produce vector Q; adding or removing symbols from Q to form a vector Q' having a rate that matches an over-the-channel transmission rate, where Q' comprises symbols from each vector Pi', i=1, 2, . . . , R0; and transmitting vector Q' over-the-channel; wherein the step of interleaving vectors P1, . . . , PR0 comprising the step of using an interleaver for Pi which is different from an interleaver used for Pj, for interleaving certain i≠j, 1≦i, j≦R0. 2. The method of claim 1 wherein vectors P1, P2, . . . , PR0 are parity vectors, not equal to the information vector. 3. The method of claim 1 wherein the step of interleaving vector Ps, 1≦s≦R0, comprises the steps of: writing a vector into an array at addresses from 0 to K minus 1, (K-1), wherein K is a length of the information vector; and reading interleaved symbols out in a permuted order with an i-th symbol being read from an address ADi(i=0, . . . , K-1) via the following steps: 1) determining sub-block interleaver parameters, M and J; 2) initializing i and j to 0; 3) finding a tentative output address description="In-line Formulae" end="lead"Tj=2M(j mod J)+BROM((└j/J┘+Δ)mod 2M), 0≦Δ≦2M-1,description="In-line Formulae" end="tail" where BROM(y) indicates a symbol-reversed M-symbol value of y, and for sub block s, Δ=┌(s-1)*2M/R0┐, s=1, . . . , R0 and 4) having ADi=Tj and incrementing i and j by 1 if Tj is less than K; otherwise Tj is discarded and j is incremented by one; 5) repeating steps 3 and 4 until all interleaver output addresses ADi (i=0, . . . , K-1) are obtained. 4. The method of claim 1 wherein Q=[P1'(1), P2'(1), . . . , PR0'(1), P1'(2), P2'(2), . . . , PR0'(2), . . . , P1'(K), P2'(K), . . . , PR0'(K)], wherein K is a length of the information vector. 5. The method of claim 1 wherein Q=[P1'(1), P1'(2), P2'(1), P2'(2), . . . , PR0'(1), PR0'(2), P1'(3), P1'(4), P2'(3), P2'(4), . . . , PR0'(3), PR0'(4), . . . , P1'(K-1), P1'(K), P2'(K-1), P2'(K), . . . , PR0'(K-1), PR0'(K)], wherein K is a length of the information vector. 6. The method of claim 1 further comprising the step of: receiving an indication that a first Q' was improperly received; and deriving and transmitting a second Q' from vector Q. 7. The method of claim 6 wherein the second Q' differs from the first Q'. 8. The method of claim 6 wherein the second Q' is a subset of or equal to the first Q'. 9. A method for operating a receiver that estimates an information vector, the method comprising the steps of: receiving a signal vector Q' over-the-channel, where Q' comprises symbols from each vector Pi', i=1, 2, . . . , R0; adding or removing symbols from Q' to form a vector Q; de-multiplexing vector Q to produce a plurality of vectors P1', P2', . . . , PR0'; de-interleaving P1', P2', . . . , PR0' to produce vectors P1, . . . , PR0, wherein each vector P1', P2', . . . , PR0' is de-interleaved separately; and decoding P1', P2', . . . , PR0' to produce the estimated information vector; wherein the step of de-interleaving vectors P1', P2', . . . , PR0' comprises the step of using a de-interleaver for Pi which is different from an de-interleaver used for de-interleaving Pj, for certain i≠j, 1≦i, j≦R0. 10. The method of claim 9 wherein symbol vectors P1, P2, . . . , PR0 are parity vectors, not equal to the information vector. 11. The method of claim 9 wherein Q=[P1'(1), P2'(1), . . . , PR0'(1), P1'(2), P2'(2), . . . , PR0'(2), . . . , P1'(K), P2'(K), . . . , PR0'(K)], wherein K is a length of the estimated information vector. 12. The method of claim 9 further comprising the steps of: sending an indication that a first vector Q' was improperly received; and requesting from a transmitter a second vector Q' also derived from vector Q. 13. An apparatus comprising: an encoder encoding an information vector to produce data symbol vectors P1, P2, . . . , PR0; at least one interleaver for interleaving vectors P1, . . . , PR0 to produce vectors P1', P2', . . . , PR0', wherein each vector P1, . . . , PR0 is interleaved separately; a multiplexer multiplexing vectors P1', P2', . . . , PR0' to produce vector Q; a symbol adder/remover adding or removing symbols from Q to form a vector Q' having a rate that matches an over-the-channel transmission rate, where Q' comprises symbols from each vector Pi', i=1, 2, . . . , R0; and a transmitter transmitting vector Q' over-the-channel; wherein the at least one interleaver comprises an interleaver used for interleaving Pi which is different from the interleaver used for interleaving Pj, for certain i≠j, 1≦i, j≦R0. 14. The apparatus of claim 13 wherein Q=[P1'(1), P2'(1), . . . , PR0'(1), P1'(2), P2'(2), . . . , PR0'(2), . . . , P1'(K), P2'(K), . . . , PR0'(K)], wherein K is a length of the information vector. 15. An apparatus comprising: a receiver receiving vector Q' over-the-channel, where Q' comprises symbols from each vector Pi', i=1, 2, . . . , R0; a symbol adder/remover adding or removing symbols from Q' to form a vector Q; a de-multiplexer de-multiplexing vector Q to produce a plurality of vectors P1', P2', . . . , PR0'; at least one de-interleaver de-interleaving P1', P2', . . . , PR0' to produce vectors P1, . . . , PR0, wherein each vector P1', P2', . . . , PR0' is de-interleaved separately; and a decoder decoding P1, P2, . . . , PR0 to produce an estimated information vector; wherein the at least one de-interleaver comprises a de-interleaver used for interleaving Pi which is different from the interleaving used for interleaving Pj, for certain i≠j, 1≦i, j≦R0. 16. The apparatus of claim 15 wherein Q=[P1'(1), P2'(1), . . . , PR0'(1), P1'(2), P2'(2), . . . , PR0'(2), . . . , P1'(K), P2'(K), . . . , PR0'(K)], wherein K is a length of the estimated information vector.