Bit-interleaved coded modulation for CATV upstream channels

[0002] This application claims priority under 35 USC § 119(e)(1) of Provisional application Ser. No. 60/115,514, filed Jan. 11, 1999. Additionally, this application is related to the following copending and commonly assigned application Ser. No.09/481,317 entitled “GUARD CODES FOR S-CDMA SYSTEMS”, filed Jan. 11, 2000; and application Ser. No. 09/481,302 entitled “HIGH-POWER PREAMBLE FOR PACKET NETWORK”, filed Jan. 11, 2000.

[0003] The present invention relates to Bit-Interleaved Coded Modulation (BICM) for CATV upstream channels.

[0004] Upstream CATV channel suffer from a hostile environment that includes various impairments. Such impairments include additive Gaussian white noise (AWGN), impulse noise, bust noise, narrowband noise (ingress) and others. The present invention provides a coding scheme that is robust to these impairments, especially impulse noise and AWGN. The complexity of the encoder of this method is relatively low, which makes it ideal for multi-point to-point channels, such as the CATV upstream channel.

[0005] The present invention is a coding scheme that includes a convolutional encoder, bit-interleaver and symbol mapper. The parameters of these units are determined as a trade off between data throughput and system robustness, according to the channel conditions. The circuitry to build the encoder are low cost and widely used. Simulations have shown that the provided method is very efficient for CATV upstream channels in many typical scenarios, including AWGN, impulse noise, burst noise and combinations of these channel impairments.

[0006] For a more complete understanding of the present invention, and the advantages thereof, reference is now made to the following detailed description taken in conjunction with the accompanying drawings, in which:

[0007] FIG. 1 shows the general structure of BICM encoder of the present invention.

[0008] FIG. 2 shows an example of rate ¾ convolutional encoder, which consists of a rate ½ convolutional encoder and a puncturing unit.

[0009] The invention provides an efficient coding scheme for upstream CATV channels. The provided coding scheme is Bit-Interleaved Coded Modulation (BICM). BICM provides high robustness against Additive White Gaussian Noise (AWGN), impulse noise and burst noise which are typical impairments of the CATV upstream channel. In prior art (Zehavi E., 8-PSK Trellis Codes for a Rayleigh Channel, IEEE Transactions on Communications, vol. 40, no. 5, 1992, 873-884), (Caire G., Taricco G., Biglieri E., Bit-Interleaved Coded Modulation, IEEE Transactions on Information Theory, vol. 44, no. 3, 1998, pp. 927-946), BICM is proposed and analyzed for Rayleigh fading channel. In this invention, BICM is employed for CATV channels, and other similar noisy data channels.

[0010] The structure of BICM encoder of the present invention is shown in FIG. 1.

[0011] The encoder of the present invention consists of a convolutional encoder, a bit-interleaver and symbol mapper (preferably a Gray or quasi-gray coded mapper).

[0012] Convolutional encoders have been widely used in communication systems for many years. The parameters of the encoder (coding rate, constraint length, etc.) are determined by the desired data rate and the channel conditions. The input bits to the encoder are called “data bits”. The output bits from the encoder are called “channel bits”. For rate k/n encoders (k 1), the convolutional encoder may consist of a 1/n convolutional encoder (such as ½ or ⅓) and a puncturing unit. The puncturing unit is a unit that deletes some of the bits in the 1/n convolutional encoder in an a-priori known pattern (see example below). In this way, high rate codes can be easily derived from a single rate 1/n encoder. The number of output bits in one puncturing pattern is called puncturing cycle.

[0013] Example: rate ½ convolutional encoder with generating polynomials octal 171,133 (see FIG. 2), also known as NASA code or de-facto code is used with a puncturing unit. This code is very widely used and known for good performance with various puncturing schemes (see Yasuda Y., Kashiki K., Hirata Y., High Rate Punctured Convolutional Codes for Soft-Decision Viterbi Decoding, IEEE Transactions on Communications, vol. 32, no. 3, 1984, pp. 315-319). This allows high flexibility and good trade-off between data throughput and robustness. This encoder with rate ¾ puncturing unit is shown in FIG. 2. The puncturing cycle of this puncturing unit is 4.

[0014] The bit-interleaver is a unit that performs bit permutations; i.e. it changes the order of the bits in its input in an a- priori known pattern. A common interleaver is the block interleaver. In block interleaver the permutation is implemented by writing the bits into the table row-wise and reading them column-wise. The size of the interleaver is a trade-off between performance and latency/memory resources (A larger interleaver has better performance but requires more memory resources and imposes longer latency). Simulations have shown that when block interleaver is used: a) The number of columns (width) should be chosen such that it is not an integer multiple of the puncturing cycle, b) The number of rows (depth) should be chosen such that it is not an integer multiple of channel bits per symbol.

[0015] The output bit sequence of the bit-interleaver is parsed into k-tuples of bits. The symbol mapper translates each k-tuple to a symbol (chosen from 2{circumflex over ( )}k constellation symbols) in the complex domain (k is the number of channel bits per symbol). The k-tuple is called he label of the constellation point. The Hamming distance between labels symbol pairs with minimal Edclidean distance should be minimized. In other words, Gray coding should be used when feasible. Otherwise “quasi-Gray” coding (i.e. coding scheme that minimizes the Hamming distances between neighboring points) should be used.

[0016] An appendix is attached that is a draft specification that includes a representative implementation of the BICM encoder of the present invention. Appendix: IEEE802.14a High-Capacity Physical Layer Specifications, Draft 1, rev. 4 (this specification includes representative implementation of the BICM encoder of the present invention)

[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]



[Inline image omitted. See PDF.]