The present invention is related generally to upstream data communications over networks primarily designed for downstream transmission of television and data signals. More specifically, the present invention pertains to a device and method for improving performance of digital return path links for a cable television (CATV) hybrid fiber co-axial cable (coax) system.
Cable television systems (CATV) were initially deployed so that remotely located communities were allowed to place a receiver on a hilltop and then use coaxial cable and amplifiers to distribute received signals down to the town which otherwise had poor signal reception. These early systems brought the signal down from the antennas to a “head end” and then distributed the signals out from this point. Since the purpose was to distribute television channels throughout a community, the systems were designed to be one-way and did not have the capability to take information back from subscribers to the head end.
Over time, it was realized that the basic system infrastructure could be made to operate two-way with the addition of some new components. Two-way CATV was used for many years to carry back some locally generated video programming to the head end where it could be up-converted to a carrier frequency compatible with the normal television channels.
Definitions for CATV systems today call the normal broadcast direction from the head end to the subscribers the “forward path” and the direction from the subscribers back to the head end the “return path.” A good review of much of today's existing return path technology is contained in the book entitled Return Systems for Hybrid Fiber Coax Cable TV Networks by Donald Raskin and Dean Stoneback, hereby incorporated by reference as background information.
One innovation, which has become pervasive throughout the CATV industry over the past decade, is the introduction of fiber optics technology. Optical links have been used to break up the original tree and branch architecture of most CATV systems and to replace that with an architecture labeled Hybrid Fiber/Coax (HFC). In this approach, optical fibers connect the head end of the system to neighborhood nodes, and then coaxial cable is used to connect the neighborhood nodes to homes, businesses and the like in a small geographical area.
The analog return signals present on the coaxial cable 102 are typically a collection of independent signals. Some of these independent signals may have high peak values and some of the signals may be low level signals. To detect the low level analog return signals and to accommodate the high level analog return signals at the same time, an A/D converter with a large number of bits (e.g., a 10-bit A/D converter) is typically used in the node 110. In the United States, because the analog return signals are in the frequency range of 5 to 42 MHz, the sampling rate of the A/D converter is typically about 100 MHz. A 10-bit A/D converter operating at a sample rate of 100 MHz will output data at a rate of 1 Gbps. Therefore, optical transmitters and the optical receivers in an CATV optical link must be capable of transmitting and receiving optical signals at 1 Gbps or at a higher rate. Naturally, the costs of such high-speed optical equipment are high. Limits on the bandwidth of the optical equipment also restrict the number of analog return signals that can be bundled together for transmission on the same optical fiber.
Accordingly, there exists a need for a system and method for transmitting digital data on the CATV return path at a rate that is lower than a full rate without significant loss of performance.
An embodiment of the present invention is a cable television return path at which analog return signals are converted to digital format and encoded, and then transmitted across an optical link to a hub. At the hub, the encoded digital signal is decoded and converted to produce an analog signal that is a close approximation of the analog return signal. The encoding scheme of the present embodiment is efficient in reducing the number of bits that are transported across the optical link. Yet, the accuracy of the analog return signal is not substantially compromised. Furthermore, the encoding scheme of the present embodiment is simple, suitable for high-speed operations and cost-effective.
In one embodiment, the cable television return path includes a node that receives an analog return signal from a subtree of the cable television system and generates a digital transport signal representative of the analog return path signal. The digital transport signal, however, is not a digitized form of the analog return signal. Rather, the digital transport signal is encoded such that fewer bits are used to represent the analog return signal without substantially impacting the accuracy and dynamic range of the signal. At the hub, the digital transport signal is decoded and converted to produce an analog signal that is a close approximation of the analog return signal. Because the digital transport signal has fewer bits per sample, a reduced number of bits will be transmitted across the optical link, thus allowing the optical link to operate at a lower transmission rate. At the same transmission rate, a larger number of return signals can be communicated across the optical link. This means that a larger number of analog return links can be bundled together and transported across the optical link.
In one particular embodiment, the node of the cable television return path includes an N-bit A/D converter, an optical transmitter, and an encoder coupled between the A/D converter and the optical transmitter. The encoder is configured to receive N-bit digital samples from the A/D converter and to generate digital samples with fewer than N bits per sample. Each sample includes a sign bit. In this embodiment, the encoder determines a size of each of the N-bit digital samples, and generates selection bits for each sample indicative of the sample's determined size. In one example, there are four different sizes: small positive and negative, medium, and large, covering eight possible ranges of an N-bit sample (the medium size covers both positive and negative values, and the large size covers two ranges for both positive and negative values). Based on the size, the encoder outputs a transport sample that includes the selection bits and a subset of the N-bits of the digital sample, such as the least-significant bits for a small sample. For other samples sizes, such as a large sample, the transport sample may include a subset of the N-bits that does not include, for example, the two least significant bits The output of the encoder is then passed to the optical transmitter to be converted to an optical signal for transmission to the hub.
In this embodiment, the hub of the cable television return path includes an optical receiver, a D/A converter, and a decoder coupled between the optical receiver and the D/A converter. At the hub, transport samples are recovered from the optical signals and provided to the decoder, which uses the selection bits of each transport sample to generate a representation of the one or more selection bits. The representation of the selection bits is combined with the non-selection bits of the transport sample (or a subset of the non-selection bits), and padded with zeros, if necessary, to generate an N-bit sample. The N-bit sample output from the decoder is then provided to the D/A converter to be converted into an analog signal.
Aspects of the present invention will be more readily apparent from the following description and appended claims when taken in conjunction with the accompanying drawings, in which:
One implementation of the signal encoder 213 is shown in
With reference still to
If the selection bit is ‘1’, a “large” sample is present and the most significant N−2 bits (i.e., AN−1 to A2) are transmitted with the selection bit concatenated for a total of N−1 bits. As an example, consider a “large” 10-bit A/D sample, Ax, and a corresponding 9-bit transport sample, Tx, shown in
In operation, the signal decoder 223 examines the transport sample, Tx. If the selection bit is a ‘1’, a “large” sample has been received. The signal decoder 213 then removes the selection bit T8. The D/A sample, Dx, is constructed by mapping the bits T0 through TN−3 to the most significant bits of Dx and padding the least two significant bits of Dx with ‘1’ and ‘0’. As an example, a “large” D/A sample, Dx, constructed from a transport sample Tx is shown in
If the selection bit is a “0”, a small sample has been received. The signal decoder 223 removes the selection bit TN−2 (TN−2 is T8 in our example using 10-bit samples). The D/A sample Dx is constructed by mapping the bits T0 through TN−3 to the least significant D0 through DN−3 bits and extending the sign bit TN−3 (T7 in our example) to fill the DN−1 through DN−2 bits of the sample Dx. A small D/A sample, Dx, constructed from a transport sample Tx is shown in
A preferred embodiment of the present invention, a CATV return path 200 that transports 10-bit A/D samples of a CATV return path signal in 9-bit transport samples, has been described above. In another embodiment, the CATV return path transports return path signals using A/D samples and transport samples that have a different member of bits.
Furthermore, in an embodiment described above, the selection bit gives an offset of two bits between the large and small samples. In other embodiments of the invention, the selection bit may provide an offset of any number of bits between a large and a small sample. For instance, in one embodiment, a selection bit of ‘1’ indicates that N−k most significant bits of the A/D samples are transported, and a selection bit of ‘0’ indicates that the N−(k+1) least significant bits of the A/D samples and their sign bits are mapped to the transport samples. In that embodiment, each transport sample will include N−k+1 bits, for a saving of k−1 bits per sample.
In yet another embodiment, multiple selection bits are used. For this embodiment, the range of possible values for a N-bit digital sample, i.e., the maximum positive value to the maximum negative value, is divided into eight equal size sub-ranges, including four positive and four negative. The smallest positive and negative ranges of values are designated as “small” and, more specifically, as either “small positive” or “small negative.” The next largest range of values, both positive and negative, is designated as “medium.” The next two largest ranges of values, positive and negative, are designated as “large.” Based on the size of the sample (small positive, small negative, medium, or large), a 2-bit code is generated. The 2-bit code is concatenated with a number of bits from the original sample to create a transport sample determined by the value of the 2-bit code, as will be described next.
Referring to
For example, the following table shows how to determine an offset-binary representation of two numbers, +22 and −7, using an eight-bit representation:
a) largest value for 8-bit integer=28=256
b) offset-binary zero value=256÷2=128(decimal)=1000 0000 (binary)
c) 1000 0000(offset binary 0)+0001 0110(binary 22)=1001 0110(offset binary +22)
d) 1000 0000(offset binary 0)−0000 0111(binary 7)=0111 1001(offset binary −7)
Thus, for a 10-bit sample, the greatest integer than can be represented in offset-binary is +511 (11 1111 1111(offset binary +511)), and the greatest negative number is −511 (01 1111 1111(offset binary −511)), for a range of 1023. Because this is not divisible into 8 equal parts, a set of seven ranges of 128 each, and one range of 127, are used instead. The size types and ranges are as follows:
From these sizes and their corresponding binary-offset values, a correlation can be made that the first three bits dictate what size a sample will be. In other words, the encoder can examine bits AN−1 through AN−3 of the sample to determine which of the eight sizes an N-bit sample falls within. Bits AN−1 through AN−3 are equal to “100” for a small positive sample, “101” for a medium positive sample, and “110” or “111” for a large positive sample. Similarly, bits AN−1 through AN−3 are equal to “011” for a small negative sample, “010” for a medium negative sample, and “000” or “001” for a large negative sample. These bits are also referred to herein as the prefix bits of the digital sample.
Because two bits are used for the selection code in this embodiment, only four types of sizes can be coded. Thus, positive and negative sign values are only coded for small samples (i.e., small positive and small negative), whereas medium and large sample values are not coded with a sign value.
In this embodiment, if the N-bit sample is small negative or small positive, bits AN−4 through A0 are concatenated with the 2-bit selection code and transmitted as a N−1 bit transport sample TX. If the N-bit sample is medium, bits AN−3 through A1 are concatenated with the 2-bit selection code and transmitted, for a total of N−1 bits. Bit A0 is not transmitted in this case, and is thus lost. Finally, if the N-bit sample is large, bits AN−2 through A2 are concatenated with the 2-bit selection code and transmitted, again as N−1 bit transport sample TX. In this case, bits A1 and A0 are not transmitted and are therefore lost.
Thus, referring back to
As shown in
The first-three bits of the D/A sample are then concatenated with bits TN−4 . . . T0 of the transport sample (also referred to as the non-selection bits), or a subset of TN−4 . . . T0, depending on the 2-bit selection code, as explained in further detail below. (In another embodiment, the representation may be selectively truncated instead). Then, depending on the selection code, the result is padded with the requisite number of padding bits (e.g., “0” bits) as the least-significant bits. For some selection codes, however, no padding is necessary. Finally, the result is output as N-bit D/A sample DN−1 . . . D0 for conversion into analog signals by the D/A converter 124.
The D/A sample DX will be an exact copy of the original A/D sample AX for small positive and small negative samples. For medium and large samples, the sample DX will be a close approximation of the original sample AX. In the case of a medium sample, the least-significant bit of DX will be lost, and replaced with a “0” bit. For a large sample, the two least-significant bits of DX will be lost and replaced with “0” bits. The added “0” bits are also referred to as padding bits. In an alternate embodiment, the padding bit for medium samples is a “1” bit, and the padding bits for large samples are “01”. In yet other alternate embodiments, the padding bits for large samples are “10” or “11”.
In an alternative embodiment that utilizes multiple selection bits, each combination of selection bits is used to select different offsets. For instance, in one embodiment, selection bits of ‘11’ indicate that the N−3 most significant bits (e.g., A8 . . . A3, when N=10) of the A/D samples are transported in the transport samples, selection bits of ‘10’ indicate that the N−3 most significant bits other than the MSB (e.g., A8, A7 . . . A2) are transported in the transport samples, and so on.
In yet another embodiment of the invention, a block of samples (e.g., three consecutive samples) are encoded by the same set of selection bits. The offset for the largest sample in the block is determined first. All samples in the block are then encoded using one set of selection bits. For instance, consider the example where a block consists of three consecutive 10-bit samples, and where a 2-bit offset between “large” samples and “small” samples” is used. In this example, AN−2 and AN−3 of the largest sample in the block are examined to determine whether the amplitude of the largest sample in the block is larger than the maximum value of the A/D converter divided by four. If so, the N−3 most significant bits of all three samples, including each sample's sign bit, and one selection bit, are mapped to the transport bits of the transport samples. If not, the N−3 least significant bits of all three samples, including each sample's sign bit, are mapped to the transport bits of the transport samples. In this way, even fewer bits are required to be transported across the optical link, and the optical receivers/transmitters can operate at a lower clock rate.
In the examples described above, 1- or 2-bit selection codes are utilized in the transport sample. In other embodiments, however, the selection code can be an X-bit code, thus separating the range of A/D values in different ways than has been described above. In general, the number of distinct possible sizes for an N-bit sample value using an X-bit code is 2X. Depending upon the way in which the ranges of A/D values are segmented, and the number of code bits used, different levels of compression may be achieved along with different degrees of error in the regenerated signal.
Also in the example described above, 10-bit A/D and D/A samples are used. In other embodiments, any size A/D and D/A samples may be used, and the A/D and D/A samples can be different sizes. The technique described above may be applied in a similar way to smaller or larger A/D samples, but will still result in a transport sample that is one bit shorter than the A/D sample. In other embodiments, the transport sample can be even smaller than N−1 bits, for example N−2 bits, at a cost of greater loss of information from the A/D sample.
While the present invention has been described with reference to a few specific embodiments, the description is illustrative of the invention and is not to be construed as limiting the invention. Various modifications may occur to those skilled in the art without departing from the true spirit and scope of the invention. For instance, embodiments of the present invention described above were implemented by hardware logic (e.g., Field Programmable Gate Array(s)). However, a person of ordinary skill in the art would realize that portions of the present invention can be implemented as a program executable by a digital signal processor.
The present application claims priority, under 35 U.S.C. 119(e), to U.S. Provisional Patent Application Ser. No. 60/356,955, filed Feb. 12, 2002, which is incorporated herein by reference. The present application also claims priority, under 35 U.S.C. 120, to U.S. patent application Ser. No. 10/102,625, filed Mar. 19, 2002, which is also incorporated herein by reference. Both applications to which priority is claimed have the same title as above.
Number | Name | Date | Kind |
---|---|---|---|
4513426 | Jayant | Apr 1985 | A |
4809271 | Kondo et al. | Feb 1989 | A |
4862392 | Steiner | Aug 1989 | A |
4918446 | Yagi | Apr 1990 | A |
5014309 | West, Jr. | May 1991 | A |
5036315 | Gurley | Jul 1991 | A |
5070402 | Ishii et al. | Dec 1991 | A |
5091874 | Watanabe et al. | Feb 1992 | A |
5113189 | Messer et al. | May 1992 | A |
5142690 | McMullan, Jr. et al. | Aug 1992 | A |
5150387 | Yoshikawa et al. | Sep 1992 | A |
5155590 | Beyers, II et al. | Oct 1992 | A |
5208854 | West, Jr. | May 1993 | A |
5225902 | McMullan, Jr. | Jul 1993 | A |
5235619 | Beyers, II et al. | Aug 1993 | A |
5243651 | Parikh et al. | Sep 1993 | A |
5245420 | Harney et al. | Sep 1993 | A |
5247364 | Banker et al. | Sep 1993 | A |
5251324 | McMullan, Jr. | Oct 1993 | A |
5255086 | McMullan, Jr. et al. | Oct 1993 | A |
5301028 | Banker et al. | Apr 1994 | A |
5303295 | West et al. | Apr 1994 | A |
5313467 | Varghese et al. | May 1994 | A |
5317391 | Banker et al. | May 1994 | A |
5319454 | Schutte | Jun 1994 | A |
5323462 | Farmer | Jun 1994 | A |
5357276 | Banker et al. | Oct 1994 | A |
5430568 | Little et al. | Jul 1995 | A |
5442472 | Skrobko | Aug 1995 | A |
5481542 | Logston et al. | Jan 1996 | A |
5497187 | Banker et al. | Mar 1996 | A |
5499241 | Thompson et al. | Mar 1996 | A |
5505901 | Harney et al. | Apr 1996 | A |
5539822 | Lett | Jul 1996 | A |
5581555 | Dubberly et al. | Dec 1996 | A |
5594726 | Thompson et al. | Jan 1997 | A |
5657333 | Ikekawa | Aug 1997 | A |
5680394 | Bingham et al. | Oct 1997 | A |
5684799 | Bigham et al. | Nov 1997 | A |
5719867 | Borazjani | Feb 1998 | A |
5719872 | Dubberly et al. | Feb 1998 | A |
5794117 | Benard | Aug 1998 | A |
5826167 | Jelinek et al. | Oct 1998 | A |
5844706 | Kohn et al. | Dec 1998 | A |
5854703 | West, Jr. | Dec 1998 | A |
5854830 | Kenmochi | Dec 1998 | A |
5864560 | Li et al. | Jan 1999 | A |
5907363 | Botsford, III et al. | May 1999 | A |
5926478 | Ghaibeh et al. | Jul 1999 | A |
5930231 | Miller et al. | Jul 1999 | A |
5963352 | Atlas et al. | Oct 1999 | A |
6041056 | Bingham et al. | Mar 2000 | A |
6041066 | Meki et al. | Mar 2000 | A |
6161011 | Loveless | Dec 2000 | A |
6175861 | Williams, Jr. et al. | Jan 2001 | B1 |
6178446 | Gerszberg et al. | Jan 2001 | B1 |
6272150 | Hrastar et al. | Aug 2001 | B1 |
6356369 | Farhan | Mar 2002 | B1 |
6356374 | Farhan | Mar 2002 | B1 |
6373611 | Farhan et al. | Apr 2002 | B1 |
6389075 | Wang et al. | May 2002 | B2 |
6417949 | Farhan et al. | Jul 2002 | B1 |
6433906 | Farhan | Aug 2002 | B1 |
6437895 | Farhan et al. | Aug 2002 | B1 |
6449071 | Farhan et al. | Sep 2002 | B1 |
6457178 | Slim | Sep 2002 | B1 |
6462851 | West, Jr. | Oct 2002 | B1 |
6493005 | Wu | Dec 2002 | B1 |
6505271 | Lien et al. | Jan 2003 | B1 |
6519067 | Farhan et al. | Feb 2003 | B2 |
6523177 | Brown | Feb 2003 | B1 |
6535715 | Dapper et al. | Mar 2003 | B2 |
6622281 | Yun et al. | Sep 2003 | B1 |
6625166 | Tsukamoto et al. | Sep 2003 | B2 |
6715124 | Betts | Mar 2004 | B1 |
6751269 | Shalvi et al. | Jun 2004 | B1 |
6754221 | Whitcher et al. | Jun 2004 | B1 |
6798790 | Enssle et al. | Sep 2004 | B1 |
6831901 | Millar | Dec 2004 | B2 |
7000018 | Begis | Feb 2006 | B1 |
7131024 | Venkata et al. | Oct 2006 | B1 |
7222358 | Levinson et al. | May 2007 | B2 |
7257328 | Levinson et al. | Aug 2007 | B2 |
7519078 | Oyadomari et al. | Apr 2009 | B2 |
20020073434 | Pience | Jun 2002 | A1 |
20020085589 | Dravida et al. | Jul 2002 | A1 |
20020129379 | Levinson et al. | Sep 2002 | A1 |
20020131426 | Amit et al. | Sep 2002 | A1 |
20020171899 | Gurusami et al. | Nov 2002 | A1 |
20030035445 | Choi | Feb 2003 | A1 |
20050039103 | Azenko et al. | Feb 2005 | A1 |
20060013194 | Baumann et al. | Jan 2006 | A1 |
Number | Date | Country |
---|---|---|
WO 0025459 | May 2000 | WO |
WO 0143441 | Jun 2001 | WO |
WO 0152455 | Jul 2001 | WO |
Number | Date | Country | |
---|---|---|---|
20030154496 A1 | Aug 2003 | US |
Number | Date | Country | |
---|---|---|---|
60356955 | Feb 2002 | US |