Apparatus using concatenations of signal-space codes for jointly encoding across multiple transmit antennas, and employing coordinate interleaving

• US 8,031,793 B2
• Filed: 01/19/2005
• Issued: 10/04/2011
• Est. Priority Date: 01/19/2005
• Status: Expired due to Fees

• Current Assignee: Nokia Corporation
• Original Assignee: Nokia Corporation
• Inventors: Ionescu, Dumitru Mihai, Reid, Tony
• Primary Examiner(s): BURD, KEVIN MICHAEL
• Application Number:
  US11/039,274
• Publication Number:
  US 20060159195A1
• Time in Patent Office: 2,449 Days
• Field of Search: 375/267, 375/260, 375/259, 375/295, 375/299, 375/316, 375/347
• US Class Current: 375/267
• CPC Class Codes: H03M 13/25 Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM] modulation codes H03M13/31
• CPC Class Codes: H03M 13/29 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
• CPC Class Codes: H03M 13/2972 Serial concatenation using convolutional component codes
• CPC Class Codes: H04L 1/0041 Arrangements at the transmitter end
• CPC Class Codes: H04L 1/005 Iterative decoding, including iteration between signal detection and decoding operation
• CPC Class Codes: H04L 1/006 Trellis-coded modulation
• CPC Class Codes: H04L 1/0065 Serial concatenated codes
• CPC Class Codes: H04L 1/0066 Parallel concatenated codes
• CPC Class Codes: H04L 1/0625 Transmitter arrangements
• CPC Class Codes: H04L 1/065 by means of convolutional encoding

Abstract

A system for transmitting data over a MIMO channel has a transmitter and a receiver. In the transmitter, the input data is encoded over at least two pipes by a concatenation of at least two constituent signal-space encoders. Each constituent encoder is used to generate, in response to the input data, a sequence of symbols from a channel alphabet having at least one dimension. Each symbol of the channel alphabet includes at least one complex symbol having real and imaginary coordinates. The transmitter interleaves the coordinates of the sequence of channel alphabet symbols, and transmits (from at least two transmit antennas) the interleaved coordinates. Preferably, each constituent encoder maximizes a minimum coordinate-wise Hamming distance between members of all valid pairs of symbol sequences, maximizes a minimum Euclidean distance between members of all valid pairs of different codewords, and obeys an equal eigenvalue criterion.

Claims

1. A method comprising:

encoding input data over at least two pipes by a concatenation of at least two constituent signal-space encoders, in which each constituent encoder is used to generate, in response to said input data, a sequence of symbols from a channel alphabet having at least one dimension, each symbol of said channel alphabet comprising at least one complex symbol having real and imaginary coordinates;

interleaving the coordinates of said sequence of channel alphabet symbols into codewords that comprise frames;

at least one of puncturing and repeating at least some of the sequence of symbols resulting from concatenation and interleaving; and

transmitting the frames using at least two channels,

where the real coordinate and imaginary coordinate for each complex symbol are transmitted via different channels.

2. The method according to claim 1, in which each constituent signal-space encoder operates to:

maximize a minimum coordinate-wise Hamming distance between members of all valid pairs of sequences of symbols;

maximize a minimum Euclidean distance between members of all valid pairs of different codewords; and

obey an equal eigenvalue criterion.

3. The method according to claim 1, in which said constituent signal-space encoders each comprise a trellis encoder.

4. The method according to claim 1, further comprising interleaving a bit stream input into each constituent signal-space encoder such that each constituent signal space encoder operates on a different stream of input bits.

5. The method according to claim 1, further comprising interleaving a bit stream input into each constituent signal-space encoder except one of said signal-space encoders, such that all constituent signal space encoders operate on a different stream of input information bits.

6. The method according to claim 1, further comprising, prior to encoding input data and for each constituent signal-space encoder:

parsing an input data stream into groups of k bits, where k is an integer; and

interleaving said groups of k bits,

whereby each encoder operates on a different sequence of groups of input bits.

7. The method according to claim 1, further comprising, prior to encoding input data and for each constituent signal-space encoder except one:

parsing an input data stream into groups of k bits; and

interleaving said groups of k bits,

whereby each encoder operates on a different sequence of groups of input bits.

8. A method comprising:

demodulating received data characterized by a concatenated and coordinate-interleaved structure, where the data has been received over multiple channels;

passing the demodulated data through a first decoder to form an intermediate output;

deinterleaving coordinates of the intermediate output to generate a plurality of streams of extrinsic information pertaining to the deinterleaved coordinates;

inputting into each of a plurality of decoders a feedback stream from another of said plurality of decoders and at least one of said plurality of streams; and

permuting said feedback streams, using a quasi-complementary turbo code interleaver, to derive compatible feedback signals,

where a real coordinate and an imaginary coordinate for a complex symbol in the received data are received via different channels.

9. The method according to claim 8 wherein permuting comprises, for at least one iteration, the compatible feedback signals derive from extrinsic probabilities corresponding to a concatenated outer code.

10. The method according to claim 8 wherein permuting comprises, for only a first iteration, the first decoder operates to replace joint probabilities for punctured elements with equal probabilities, said elements comprising real coordinates of complex symbols of the received data.

11. An apparatus comprising:

a joint encoder comprising at least two constituent signal-space encoders, said joint encoder configured to encode input data over at least two pipes by concatenating outputs from the at least two constituent signal-space encoders, in which each said constituent encoder is used to generate, in response to said input data, a sequence of symbols from a channel alphabet having at least one dimension, each symbol of said channel alphabet comprising at least one complex symbol having real and imaginary coordinates;

a coordinate interleaver having an input coupled to an output of the joint encoder configured to interleave the coordinates of said sequence of channel alphabet symbols; and

a router having an input coupled to an output of the coordinate interleaver configured to distribute the interleaved coordinates from said sequence of channel alphabet symbols to at least two channels;

where the coordinate interleaver is configured to at least one of puncture and repeat at least some of the sequence of symbols,

where the real coordinate and imaginary coordinate for each complex symbol are transmitted via different channels.

12. The apparatus of claim 11, wherein each constituent signal-space encoder is adapted to:

maximize a minimum coordinate-wise Hamming distance between members of all valid pairs of sequences of symbols;

maximize a minimum Euclidean distance between members of all valid pairs of different codewords that are to be output from the coordinate interleaver; and

obey an equal eigenvalue criterion.

13. The apparatus of claim 11, wherein said constituent signal-space encoders each comprise a trellis encoder.

14. The apparatus of claim 11, further comprising at least two bit interleavers, each disposed such that each signal-space encoder has an input coupled to an output of a bit interleaver.

15. The apparatus of claim 11, further comprising at least one bit interleaver, each disposed such that each signal-space encoder save one has an input coupled to an output of a bit interleaver.

16. The apparatus of claim 11, where for each constituent signal-space encoder, the coordinate interleaver is configured:

to parse an input data stream into groups of k bits; and

to interleave said groups of k bits,

whereby each signal-space encoder receives as input a different sequence of bits.

17. The apparatus of claim 11, further comprising, where for each constituent signal-space encoder save one, the coordinate interleaver is configured:

to parse an input data stream into groups of k bits; and

to interleave said groups of k bits,

whereby each signal-space encoder receives as input a different sequence of bits.

18. An apparatus comprising:

a demodulator configured to receive data characterized by a concatenated and coordinate-interleaved structure, where the data has been received over multiple channels;

a serial decoder having as inputs an output of the demodulator and a serial feedback, said serial decoder configured to decode an inner code;

at least two parallel decoders each having a first input coupled to an output of the serial decoder and a feedback input coupled to a feedback output of another parallel decoder, each parallel decoder operating to deinterleave coordinates of its respective first input and decode an outer code thereof, and each further comprising a second output; and

a quasi-complementary turbo code calculating module having inputs coupled to each of the second outputs of the parallel decoders and an output coupled to the serial feedback of the serial decoder,

where a real coordinate and an imaginary coordinate for a complex symbol in the received data are received via different channels.

19. The apparatus of claim 18, wherein the serial decoder decodes the inner code by deriving extrinsic information about interleaved coordinates input thereto.

20. The apparatus of claim 18, wherein the receiver operates to permute decoding at the parallel decoders until compatible feedback signals are achieved that derive from extrinsic probabilities corresponding to a concatenated outer code.

21. The apparatus of claim 18, wherein the calculating module provides an equal probabilities result on its output at least until it receives a signal on each of its inputs.

22. An apparatus comprising:

means for encoding and concatenating input data over at least two pipes by generating, from the input data, a sequence of channel alphabet symbols, each symbol comprising at least one complex symbol having real and imaginary coordinates;

means for interleaving the coordinates of said sequence of symbols into codewords that each comprise a transmission frame and for at least one of puncturing and repeating at least some of the sequence of symbols; and

means for transmitting the frames simultaneously using at least two channels,

where the real coordinate and imaginary coordinate for each complex symbol are transmitted via different channels.

23. An apparatus comprising:

means for receiving data over multiple channels, where the data is characterized by a concatenated and coordinate-interleaved structure;

means for demodulating the received data;

means for decoding an inner code of the demodulated received data using information about interleaved coordinates;

means for deinterleaving coordinates that are output from the means for decoding an inner code;

parallel means for decoding an outer code of the demodulated received data, each of said parallel means using a feedback from another of said parallel means for decoding an outer code; and

means for determining extrinsic probabilities of an outer code of the received data from outputs of each of the parallel means and a quasi-complementary turbo code, said extrinsic probabilities provided as an output that is coupled to an input of the means for decoding an inner code,

where a real coordinate and an imaginary coordinate for a complex symbol in the received data are received via different channels.

24. A non-transitory computer readable medium tangibly embodying computer readable instructions that are executed by a computer to perform actions comprising:

encoding input data over at least two pipes by a concatenation of at least two constituent signal-space encoders, in which each constituent encoder is used to generate, in response to said input data, a sequence of symbols from a channel alphabet having at least one dimension, each symbol of said channel alphabet comprising at least one complex symbol having real and imaginary coordinates;

interleaving the coordinates of said sequence of channel alphabet symbols into codewords that comprise transmission frames;

at least one of puncturing and repeating at least some of the sequence of symbols resulting from concatenation and interleaving; and

transmitting the frames using at least two channels,

where the real coordinate and imaginary coordinate for each complex symbol are transmitted via different channels.