This invention relates to TCM, MLCM, or BIMLCM coding of data into symbols before the symbols are placed in an SCBT block such that one or more bits are left uncoded and performance is thereby improved.
In Single Carrier Block Transmission (SCBT) systems, a block of symbols (e.g. QAM or PSK) with length N, is preceded by a Guard Interval (GI), i.e. Cyclic Prefix (CP) or Zero Padding (ZP), before it is transmitted. Such a system is equivalent to an OFDM system with full spreading, if an N×N Fourier matrix is used as the spreading (code) matrix. The use of the GI and the block format of the SCBT enable the receiver to avoid any inter-block interference and use low complexity frequency domain equalization. Hence, similar to an OFDM system, an SCBT system can also be implemented with lower computational complexity.
The SCBT systems have the advantages of OFDM system in dealing with multipath but do not have some of the disadvantages of OFDM systems, e.g. high Peak to Average Power Ratio (PAPR). In terms of performance, the single carrier systems with GI outperform OFDM systems, if a weak and/or a high rate channel code (or no coding) is used.
In Trellis Coded Modulation (TCM) the encoding of the bits and mapping of the coded bits to a constellation are not performed independently. Instead the bits are mapped to the constellation based on the level of protection that each bit enjoys from the encoding process. For example, as illustrated in
In the Multi-Level Coded Modulation, different sets of data bits are coded using different codes, or are left uncoded. The coded bits are then mapped to the constellation points with regards to the amount of redundancy they receive from each code, illustrated in
TCM and MLCM can provide better performance than regular convolutional codes, if they experience an AWGN channel. When channel fading exists, the performance of TCM and MLCM degrades significantly. As a result these methods are not used in OFDM systems where each symbol experiences a different channel gain. In SCBT after the equalization, the symbols experience an equivalent AWGN channels. Hence using TCM and MLCM (or BIMLCM) can improve the performance. A way is needed to use TCM and MLCM codes to capture their significantly superior performance when compared to interleaved convolutional codes.
The method, apparatus and system provided by the present invention provide a way of employing TCM, MLCM or BIMLCM in an SCBT system to code less than all of the data bits and map all of the coded and uncoded data bits into symbols before the symbols are placed into SCBT block. The present invention can realize significantly superior performance in comparison with interleaved convolutional codes, which are conventionally used in the SCBT systems.
One component of this performance improvement from the use of TCM, MLCM or BIMLCM is that it relaxes the speed requirements of the encoder and decoder, compared to those required by a convolutionally coded SCBT. This is due to the fact that in the present invention one or more of the data bits are left uncoded, see
This invention is suitable for any SCBT system when larger constellations are employed. This invention is particularly attractive for the high bandwidth efficiency and high rate systems such as multi-gigabit 60 GHz WPAN systems.
a)-d) illustrates speed reduction factors for 8 point constellation and BIMLCM according to the present invention;
It is to be understood by persons of ordinary skill in the art that the following descriptions are provided for purposes of illustration and not for limitation. An artisan understands that there are many variations that lie within the spirit of the invention and the scope of the appended claims. Unnecessary detail of known functions and structure may be omitted from the current descriptions so as not to obscure the present invention.
A first preferred embodiment employs TCM, MLCM or BIMLCM to code the data bits into symbols before the symbols are placed in an SCBT block. Generally, TCM, MLCM and BIMLCM do not have good performance over the frequency selective channels. However, since the frequency domain equalization of SCBT will flatten the channel, (i.e. after equalization, the channel can be modeled with an AWGN channel), the use of TCM, MLCM or BIMLCM can provide significant gain. Furthermore, since some of the bits are left uncoded, the speed requirements on the encoder and decoder are relaxed. This feature is especially important for the very high data rate systems.
As one example only, assume an SCBT system with 8PSK modulation and compare performance a conventional SCBT system with bit-interleaved convolutional coding (Also known as Bit-Interleaved Coded Modulation or BICM) to a system according to the present invention where code rates of ⅔ and ⅚ are used, i.e., uses BIMLCM and TCM with similar equivalent rates.
To provide these equivalent rates, convolutional codes with rates ½ and ¾ are used with one uncoded bit per symbol. Hence the resulting overall rates are (1+1)/(2+1)=⅔ and (3+2)/(4+2)=⅚. In the conventional and BIMLCM cases the coded bits are interleaved before they are mapped to 8 PSK symbols. The uncoded bits are mapped to the 8 PSK symbols such that their 0 and 1 values are represented with the two opposite constellation points.
Based on the code, different mappings can be used to map the coded and uncoded bits to the symbols. In all cases, the 0 and 1 for the uncoded bits are located on the constellation points that are far from each other. The mapping of the coded bits will be dependent on the specific code and whether TCM, MLCM or BIMLCM is used. For example in the case of TCM an Ungerboeck partitioning (UP) can be used. The need for partitioning sets of lattice points arises in several applications. The most well known example is the design of trellis codes. Here, the set of 2n lattice points, called the signal constellation, is divided into 2m partitions, with the objective of maximizing the minimal distance between the points in each partition. Maximization of minimal intra-partition distance is important for reduction of the probability of erroneous decoding. Ungerboeck proposed a simple heuristic scheme for successive partitioning of the initial set of points, where at each stage the number of partitions is doubled, and the minimal intra-partition distance grows by a factor of √{square root over (2)} for the lattice Z2. For the BIMLCM case the mapping can be similar to the mappings used for “pragmatic” TCM codes, where the coded bits are Gray-mapped on the constellation points.
In general, by properly designing the codes and the constellations, significant performance gain can also be achieved.
Other embodiments of this invention include but are not limited to:
The choice of a specific code and constellation determine the data rate and the performance (operating range) of the system. There is generally a trade-off: The higher rate the shorter the range and vice versa. In practice, usually the system chooses the code and constellation (from a predefined set) based on the quality if its received signal (e.g. received power). Thus the system can operate at a high rate when conditions are good (short distance), but is also capable of operating at reduced rate when conditions are not so good.
In a preferred embodiment, for bit-interleaved MLCM the present invention uses the same convolutional code and puncturing as is used for small constellations. Uncoded bits are mapped to the far constellation points. The resultant decoding speed reductions are illustrated in
In the BIMLCM case 800.b, after removal of GI 801.b and equalization 802.b, bit metrics are calculated 803.b. After de-interleaving these bit metrics 804.b, the Viterbi decoder decodes the coded bits 805.b. The decoded bits are then re-encoded 806.b and interleaved 807.b before they are used to detect the uncoded bits 808.b.
specifying a coding scheme and a constellation for the communication stream 1001;
in accordance with the specified code and constellation, determining an equivalent code rate for a given rate of the SCBT system 1002;
for the determined rate, specifying a corresponding number of coded bits and thus determining a remaining number m≧1 of uncoded bits per symbol s[l] 1003; and
for each consecutive symbol s[l], performing the steps of:
While the preferred embodiments of the present invention have been illustrated and described, it will be understood by those skilled in the art that the system, apparatus and methods as described herein are illustrative and various changes and modifications may be made and equivalents may be substituted for elements thereof without departing from the true scope of the present invention. In addition, many modifications may be made to adapt the teachings of the present invention to a particular situation without departing from its central scope. Therefore, it is intended that the present invention not be limited to the particular embodiments disclosed as the best mode contemplated for carrying out the present invention, but that the present invention include all embodiments falling within the scope of the claim appended hereto as well as all implementation techniques and not just the object oriented approach to implementation used as an example.
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/IB2007/054351 | 10/25/2007 | WO | 00 | 2/8/2010 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2008/053413 | 5/8/2008 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
5371548 | Williams | Dec 1994 | A |
5651032 | Okita | Jul 1997 | A |
20030073464 | Giannakis et al. | Apr 2003 | A1 |
20030076164 | Giannakis et al. | Apr 2003 | A1 |
20040178934 | Balakrishnan et al. | Sep 2004 | A1 |
20040264431 | Rhodes | Dec 2004 | A1 |
20050100118 | Zhang | May 2005 | A1 |
20070127587 | Ouyang et al. | Jun 2007 | A1 |
20080310519 | Seyedi-Esfahani et al. | Dec 2008 | A1 |
20100002792 | Seyedi-Esfahani | Jan 2010 | A1 |
20100146363 | Birru et al. | Jun 2010 | A1 |
Entry |
---|
Marc Frederik et al., Space-Time Block Coding for Single-Carrier Block transmission DS-CDMA Downlink, IEEE Journal on Selected Areas in Communications, vol. 21, No. 3, Apr. 2003. |
S. Zhou et al., Single-Carrier Space-Time Block-Coded Transmissions Over Frequency-Selective Fading Channels, IEE Transactions of Information theory, vol. 49, No. 1, Jan. 2003. |
Jwo-Yuh Wu et al., Periodic-Modulation Based Blind Channel Identification for Single-Carrier Block Transmission with frequency-Domain Equalization, 2005 IEEE 6th Workshop on Signal Processing Advances in Wireless Communications. |
Duckdong Hwang et al., An Interleaved TCM Scheme for Single Carrier Multpile Transmit Antenna Systems, IEE Communications Letters,vol. 10, No. 6, Jun. 2006. |
Number | Date | Country | |
---|---|---|---|
20100272203 A1 | Oct 2010 | US |
Number | Date | Country | |
---|---|---|---|
60863856 | Nov 2006 | US |