1. Field
The present disclosed aspects relates generally to wireless communications, and more specifically to channel interleaving in a wireless communications system.
2. Background
Orthogonal frequency division multiplexing (OFDM) is a technique for broadcasting high rate digital signals. In OFDM systems, a single high rate data stream is divided into several parallel low rate substreams, with each substream being used to modulate a respective subcarrier frequency. It should be noted that although the present disclosure is described in terms of quadrature amplitude modulation, it is equally applicable to phase shift keyed modulation systems.
The modulation technique used in OFDM systems is referred to as quadrature amplitude modulation (QAM), in which both the phase and the amplitude of the carrier frequency are modulated. In QAM modulation, complex QAM symbols are generated from plural data bits, with each symbol including a real number term and an imaginary number term and with each symbol representing the plural data bits from which it was generated. A plurality of QAM bits are transmitted together in a pattern that can be graphically represented by a complex plane. Typically, the pattern is referred to as a “constellation”. By using QAM modulation, an OFDM system can improve its efficiency.
It happens that when a signal is broadcast, it can propagate to a receiver by more than one path. For example, a signal from a single transmitter can propagate along a straight line to a receiver, and it can also be reflected off of physical objects to propagate along a different path to the receiver. Moreover, it happens that when a system uses a so-called “cellular” broadcasting technique to increase spectral efficiency, a signal intended for a received might be broadcast by more than one transmitter. Hence, the same signal will be transmitted to the receiver along more than one path. Such parallel propagation of signals, whether man-made (i.e., caused by broadcasting the same signal from more than one transmitter) or natural (i.e., caused by echoes) is referred to as “multipath”. It can be readily appreciated that while cellular digital broadcasting is spectrally efficient, provisions must be made to effectively address multipath considerations.
Fortunately, OFDM systems that use QAM modulation are more effective in the presence of multipath conditions (which, as stated above, must arise when cellular broadcasting techniques are used) than are QAM modulation techniques in which only a single carrier frequency is used. More particularly, in single carrier QAM systems, a complex equalizer must be used to equalize channels that have echoes as strong as the primary path, and such equalization is difficult to execute. In contrast, in OFDM systems the need for complex equalizers can be eliminated altogether simply by inserting a guard interval of appropriate length at the beginning of each symbol. Accordingly, OFDM systems that use QAM modulation are preferred when multipath conditions are expected.
In a typical trellis coding scheme, the data stream is encoded with a convolutional encoder and then successive bits are combined in a bit group that will become a QAM symbol. Several bits are in a group, with the number of bits per group being defined by an integer “m” (hence, each group is referred to as having an “m-ary” dimension). Typically, the value of “m” is four, five, six, or seven, although it can be more or less.
After grouping the bits into multi-bit symbols, the symbols are interleaved. By “interleaving” is meant that the symbol stream is rearranged in sequence, to thereby randomize potential errors caused by channel degradation. To illustrate, suppose five words are to be transmitted. If, during transmission of a non-interleaved signal, a temporary channel disturbance occurs. Under these circumstances, an entire word can be lost before the channel disturbance abates, and it can be difficult if not impossible to know what information had been conveyed by the lost word.
In contrast, if the letters of the five words are sequentially rearranged (i.e., “interleaved”) prior to transmission and a channel disturbance occurs, several letters might be lost, perhaps one letter per word. Upon decoding the rearranged letters, however, all five words would appear, albeit with several of the words missing letters. It will be readily appreciated that under these circumstances, it would be relatively easy for a digital decoder to recover the data substantially in its entirety. After interleaving the m-ary symbols, the symbols are mapped to complex symbols using QAM principles noted above, multiplexed into their respective sub-carrier channels, and transmitted.
One aspect of the disclosure is directed to a method for interleaving in a wireless communication system utilizing orthogonal frequency division multiplexing (OFDM) with various FFT sizes. The method comprises interleaving subcarriers of one or more interlaces in a bit reversal fashion, and interleaving the one or more interlaces.
Another aspect of the disclosure is directed to an apparatus for interleaving in a wireless communication system utilizing orthogonal frequency division multiplexing (OFDM) with various FFT sizes. The apparatus comprises a processor configured to interleave subcarriers of one or more interlaces in a bit reversal fashion, and a processor configured to interleave the one or more interlaces in the bit reversal fashion.
Yet another aspect of the disclosure is directed to a processor executing instructions in a wireless communication system utilizing orthogonal frequency division multiplexing (OFDM) with various FFT sizes. The instructions comprise interleaving subcarriers of one or more interlaces in a bit reversal fashion, and interleaving the one or more interlaces in the bit reversal fashion.
Yet another aspect of the disclosure is directed to a computer-readable medium storing instructions for interleaving in a wireless communication system utilizing orthogonal frequency division multiplexing (OFDM) with various FFT sizes. The instructions comprise interleaving subcarriers of one or more interlaces in a bit reversal fashion, and interleaving the one or more interlaces in the bit reversal fashion.
Yet another aspect of the present disclosure is directed to an apparatus for interleaving in a wireless communication system utilizing orthogonal frequency division multiplexing (OFDM) with various FFT sizes. The apparatus comprises means for interleaving subcarriers of one or more interlaces in a bit reversal fashion, and means for interleaving the one or more interlaces in the bit reversal fashion.
The features, nature and advantages of the present disclosure will become more apparent from the detailed description set forth below when taken in conjunction with the drawings in which like reference characters identify correspondingly throughout and wherein:
a shows a channel interleaver in accordance with an aspect.
b shows a channel interleaver in accordance with another aspect.
a shows code bits of a turbo packet placed into an interleaving buffer in accordance with an aspect.
b shows an interleaver buffer arranged into an N/m rows by m columns matrix in accordance with an aspect.
In the following detailed description, numerous specific details are set forth to provide a full understanding of the subject technology. It will be obvious, however, to one ordinarily skilled in the art that the subject technology may be practiced without some of these specific details. In other instances, well-known structures and techniques have not been shown in details so as not to obscure the subject technology.
The word “exemplary” is used herein to mean “serving as an example or illustration.” Any aspect or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects or designs.
Reference will now be made in detail to aspects of the subject technology, examples of which are illustrated in the accompanying drawings, wherein like reference numerals refer to like elements throughout.
In an aspect, a channel interleaver comprises a bit interleaver and a symbol interleaver.
a shows a channel interleaver in accordance with an aspect.
a shows Turbo coded bits 102 input into bit interleaving block 104. Bit interleaving block 104 outputs interleaved bits, which are input into constellation symbol mapping block 106. Constellation symbol mapping block 106 outputs constellation symbol mapped bits, which are input into constellation symbol interleaving block 108. Constellation symbol interleaving block 108 outputs constellation symbol interleaved bits into channelization block 110. Channelization block 110 interlaces the constellation symbol interleaved bits using an interlace table 112 and outputs OFDM symbols 114.
b shows Turbo coded bits 152 input into bit interleaving block 154. Bit interleaving block 154 outputs interleaved bits, which are input into constellation symbol mapping block 156. Constellation symbol mapping block 156 outputs constellation symbol mapped bits, which are input into channelization block 158. Channelization block 158 channelizes the constellation symbol interleaved bits using an interleaved interlace table and dynamic slot-interlace mapping 160 and outputs OFDM symbols 162.
Bit Interleaving for Modulation Diversity
The interleaver of
a shows code bits of a turbo packet 202 placed into an interleaving buffer 204 in accordance with an aspect.
For simplicity, a fixed m=4 may be used, if the highest modulation level is 16 and if code bit length is always divisible by 4. In this case, to improve the separation for QPSK, the middle two columns are swapped before being read out. This procedure is depicted in
In another aspect, as a first step, the code bits of a turbo packet 202 are distributed into groups. Note that the aspects of both
Interleaved Interlace for Frequency Diversity
In accordance with an aspect, the channel interleaver uses interleaved interlace for constellation symbol interleaving to achieve frequency diversity. This eliminates the need for explicit constellation symbol interleaving. The interleaving is performed at two levels:
Within or Intra Interlace Interleaving: In an aspect, 500 subcarriers of an interlace are interleaved in a bit-reversal fashion.
Between or Inter Interlace Interleaving: In an aspect, eight interlaces are interleaved in a bit-reversal fashion.
It would be apparent to those skilled in the art that the number of subcarriers can be other than 500. It would also be apparent to those skilled in the art that the number of interlaces can be other than eight.
Note that since 500 is not power of 2, a reduced-set bit reversal operation shall be used in accordance with an aspect. The following code shows the operation:
where n=500, m is the smallest integer such that 2m>n which is 8, and bitRev is the regular bit reversal operation.
The symbols of the constellation symbol sequence of a data channel is mapped into the corresponding subcarriers in a sequential linear fashion according to the assigned slot index, determined by a Channelizer, using the interlace table as is depicted in
In an aspect, one out of the eight interlaces is used for pilot, i.e., Interlace 2 and Interlace 6 is used alternatively for pilot. As a result, the Channelizer can use seven interlaces for scheduling. For convenience, the Channelizer uses Slot as a scheduling unit. A slot is defined as one interlace of an OFDM symbol. An Interlace Table is used to map a slot to a particular interlace. Since eight interlaces are used, there are then eight slots. Seven slots will be set aside for use for Channelization and one slot for Pilot. Without loss of generality, Slot 0 is used for the Pilot and Slots 1 to 7 are used for Channelization, as is shown in
The number surrounded with a square is the interlace adjacent to the pilot and consequently with good channel estimate. Since the Scheduler always assigns a chunk of contiguous slots and OFDM symbols to a data channel, it is clear that due to the inter-interlace interleaving, the contiguous slots that are assigned to a data channel will be mapped to discontinuous interlaces. More frequency diversity gain can then be achieved.
However, this static assignment (i.e., the slot to physical interlace mapping table1 does not change over time) does suffer one problem. That is, if a data channel assignment block (assuming rectangular) occupies multiple OFDM symbols, the interlaces assigned to the data channel does not change over the time, resulting in loss of frequency diversity. The remedy is simply cyclically shifting the Scheduler interlace table (i.e., excluding the Pilot interlace) from OFDM symbol to OFDM symbol. 1The Scheduler slot table does not include the Pilot slot.
However, it is noticed that slots are assigned four continuous interlaces with good channel estimates followed by long runs of interlaces with poor channel estimates in contrast to the preferred patterns of short runs of good channel estimate interlaces and short runs of interlaces with poor channel estimates. In the figure, the interlace that is adjacent to the pilot interlace is marked with a square. A solution to the long runs of good and poor channel estimates problem is to use a shifting sequence other than the all one's sequence. There are many sequences can be used to fulfill this task. The simplest sequence is the all two's sequence, i.e., the Scheduler interlace table is shifted twice instead of once per OFDM symbol. The result is shown in
To simplify the operation at both transmitters and receivers, a simple formula can be used to determine the mapping from slot to interlace at a given OFDM symbol time
i=′{(N−((R×t) % N)+s−1) % N}
where
Example: In an aspect, I=8, R=2. The corresponding Slot-Interlace mapping formula becomes
i=′{(7−((2×t) %7)+s−1) %7}
where ′ corresponds to the following table:
This table can be generated by the following code:
where m=3 and bitRev is the regular bit reversal operation.
For OFDM symbol t=11, Pilot uses Interlace 6. The mapping between Slot and Interlace becomes:
The resulting mapping agrees with the mapping in
Foregoing aspects of the present disclosure assume an OFDM system with 4K subcarriers (i.e., 4K FFT size). However, aspects of the present disclosure are capable of operation using FFT sizes of, for example, 1K, 2K and 8K to complement the existing 4K FFT size. As a possible advantage of using multiple OFDM systems, 4K or 8K could be used in VHF; 4K or 2K could be used in L-band; 2K or 1K could be used in S-band. Different FFT sizes could be used in different RF frequency bands, in order to support different cell sizes & Doppler frequency requirements. It is noted, however, that the aforementioned FFT sizes are merely illustrative examples of various OFDM systems, and the present disclosure is not limited to only 1K, 2K, 4K and 8K FFT sizes.
It is also important to note that the notion of slot, as 500 modulation symbols, is preserved across all FFT sizes. Further, an interlace corresponds to ⅛th of the active sub-carriers, across all FFT sizes. Accounting for guard sub-carriers, an interlace is 125, 250, & 1000 sub-carriers, respectively, for the 1K, 2K, & 8K FFT sizes. It follows that a slot then occupies 4, 2, & ½ of an interlace for the 1K, 2K, & 8K FFT sizes, respectively. For the 1K & 2K FFT sizes, the interlaces corresponding to a slot may be, for example, in consecutive OFDM symbols. The slot to interlace map discussed for the 4K FFT size also applies to the other FFT sizes, by running the map once per OFDM symbol period for the data slots.
To illustrate mapping slot buffer modulation symbols to interlace sub-carriers, regardless of FFT size of the OFDM system, aspects of the present disclosure may perform the following procedures using 1K, 2K, 4K and 8K FFT sizes, respectively. It is noted, however, that the present disclosure is not limited to the specific techniques described herein, and one of ordinary skill in the art would appreciate that equivalent methods could be implemented for mapping slot buffer modulation symbols to interlace sub-carriers without departing from the scope of the claimed invention.
Referring now to
Create an empty Sub-carrier Index Vector (SCIV) (910);
Let i be an index variable in the range (iε{0, 1, . . . , 511}), and initialize i to 0 (920);
Represent i by its 9-bit value ib (930);
Bit reverse ib and denote the resulting value as ibr. If ibr<500, then append ibr to the SCIV (940); and
SCIV needs to be computed only once and can be used for all data slots. The aforementioned procedure for generating the SCIV constitutes a punctured 9-bit reversal.
Next, the modulation symbols in a data slot are then mapped to an interlace sub-carrier as per the following procedures for 1K, 2K, 4K and 8K FFT sizes, respectively: For the 1K FFT size, let [I0(s), I1(s), I2(s), I3(s)] denote the interlaces in four consecutive OFDM symbols mapped to slot s. The ith complex modulation symbol (where iε{0, 1, . . . , 499}) shall be mapped to the jth sub-carrier of interlace Ik(s), where
where BR2(*) is the bit reversal operation for two bits, i.e., BR2(0)=0, BR2(1)=2, BR2(2)=1, BR2(3)=3. The two bit reversal operation makes the mapping equivalent to the one generated by the following algorithm: 1) Divide each slot into four equal groups, with the first group consisting of the first 125 modulation symbols, the second group with the next 125 modulation symbols, and so on; 2) Map the modulation symbols in group k (where k=0, 1, 2, 3) to sub-carriers in interlace Ik(s) using a sub-carrier interlace vector (SCIV) of length 125, generated using a punctured 8 bit reversal instead of a punctured 9 bit reversal.
For the 2K FFT size, let [I0(s), I1(s)] denote the interlaces in two consecutive OFDM symbols that are mapped to slot s. Then the ith complex modulation symbol (where iε{0, 1, . . . , 499}) shall be mapped to the jth sub-carrier of interlace Ik(s), where k=SCIV[i] mod 2,
This mapping is equivalent to the following algorithm: 1) Divide each slot into two equal groups, with the first group consisting of the first 250 modulation symbols, the second group with the next 250 modulation symbols. 2) Map the modulation symbols in group k where k=0, 1) to sub-carriers in interlace Ik(s) using a sub-carrier interlace vector (SCIV) of length 250, generated using a punctured 8 bit reversal instead of a punctured 9 bit reversal.
For the 4K FFT size, the ith complex modulation symbol (where iε{0, 1, . . . , 499}) shall be mapped to the interlace sub-carrier with index SCIV[i].
For the 8K FFT size, the ith complex modulation symbol (where iε{0, 1, . . . , 499}) shall be mapped to the jth sub-carrier of the interlace, where
In accordance with aspects of the present disclosure, an interleaver has the following features:
The bit interleaver is designed to taking advantage of m-Ary modulation diversity by interleaving the code bits into different modulation symbols;
The “symbol interleaving” designed to achieve frequency diversity by INTRA-interlace interleaving and INTER-interlace interleaving; and
Additional frequency diversity gain and channel estimation gain are achieved by changing the slot-interlace mapping table from OFDM symbol to OFDM symbol. A simple rotation sequence is proposed to achieve this goal.
Those of skill in the art would understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.
Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the aspects disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.
The various illustrative logical blocks, modules, and circuits described in connection with the aspects disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
The steps of a method or algorithm described in connection with the aspects disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in a user terminal. In the alternative, the processor and the storage medium may reside as discrete components in a user terminal.
The previous description of the disclosed aspects is provided to enable any person skilled in the art to make or use the present disclosure. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects without departing from the scope of the claimed invention. Thus, the present disclosure is not intended to be limited to the aspects shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
The present application for patent is a continuation of application Ser. No. 11/929,927 entitled “SYSTEM AND METHOD FOR FREQUENCY DIVERSITY” filed Oct. 30, 2007, assigned to the assignee hereof, which claims priority to Provisional Application No. 60/951,949 entitled “SYSTEM AND METHOD FOR FREQUENCY DIVERSITY” filed Jul. 25, 2007, and assigned to the assignee hereof, which is a continuation-in-part of application Ser. No. 11/192,789 entitled “SYSTEM AND METHOD FOR FREQUENCY DIVERSITY” filed Jul. 29, 2005, assigned to the assignee hereof, which claims priority to Provisional Application No. 60/592,999 entitled “METHOD OF CHANNEL INTERLEAVING IN A OFDM WIRELESS COMMUNICATIONS SYSTEM” filed Jul. 29, 2004, and assigned to the assignee hereof, all of which are hereby expressly incorporated by reference herein. The present Application for Patent is related to the following U.S. Patent Applications: “SYSTEM AND METHOD FOR MODULATION DIVERSITY” having application Ser. No. 11/192,788 filed Jul. 29, 2005, assigned to the assignee hereof, and expressly incorporated by reference herein; and “SYSTEM AND METHOD FOR TIME DIVERSITY” having application Ser. No. 11/193,053 filed Jul. 29, 2005, assigned to the assignee hereof, and expressly incorporated by reference herein.
Number | Name | Date | Kind |
---|---|---|---|
5177766 | Holland et al. | Jan 1993 | A |
5315592 | Conant et al. | May 1994 | A |
5943330 | Hottinen | Aug 1999 | A |
6145111 | Crozier et al. | Nov 2000 | A |
6154484 | Lee et al. | Nov 2000 | A |
6172993 | Kim et al. | Jan 2001 | B1 |
6208663 | Schramm et al. | Mar 2001 | B1 |
6243379 | Veerina et al. | Jun 2001 | B1 |
6298463 | Bingeman et al. | Oct 2001 | B1 |
6304581 | Chen et al. | Oct 2001 | B1 |
6311306 | White et al. | Oct 2001 | B1 |
6392572 | Shiu et al. | May 2002 | B1 |
6421333 | Jalali | Jul 2002 | B1 |
6505052 | Jou | Jan 2003 | B1 |
6580497 | Asaka et al. | Jun 2003 | B1 |
6597726 | Ozluturk | Jul 2003 | B2 |
6611551 | Jones, IV et al. | Aug 2003 | B1 |
6667962 | Lee et al. | Dec 2003 | B1 |
6697990 | El-Gamal et al. | Feb 2004 | B2 |
6738370 | Ostman | May 2004 | B2 |
6747948 | Sarraf et al. | Jun 2004 | B1 |
6754170 | Ward | Jun 2004 | B1 |
6807428 | Casaccia | Oct 2004 | B2 |
6956842 | Okumura et al. | Oct 2005 | B1 |
6961388 | Ling et al. | Nov 2005 | B2 |
6973118 | Ikeda et al. | Dec 2005 | B1 |
7002900 | Walton et al. | Feb 2006 | B2 |
7031251 | Chen et al. | Apr 2006 | B2 |
7039000 | You et al. | May 2006 | B2 |
7093185 | Kim et al. | Aug 2006 | B2 |
7120696 | Au et al. | Oct 2006 | B1 |
7145940 | Gore et al. | Dec 2006 | B2 |
7154936 | Bjerke et al. | Dec 2006 | B2 |
7170849 | Arivoli et al. | Jan 2007 | B1 |
7248652 | Sayeed | Jul 2007 | B2 |
7251282 | Maltsev et al. | Jul 2007 | B2 |
7251768 | Giannakis et al. | Jul 2007 | B2 |
7289459 | Hayashi et al. | Oct 2007 | B2 |
7292552 | Willenegger et al. | Nov 2007 | B2 |
7298787 | Priotti | Nov 2007 | B2 |
7324590 | Abrishamkar et al. | Jan 2008 | B2 |
7339999 | Gore et al. | Mar 2008 | B2 |
7411898 | Erlich et al. | Aug 2008 | B2 |
7457350 | Baker et al. | Nov 2008 | B2 |
7583584 | Wang et al. | Sep 2009 | B2 |
7693124 | Subrahmanyam et al. | Apr 2010 | B2 |
7782806 | Vrcelj et al. | Aug 2010 | B2 |
7813383 | Wang et al. | Oct 2010 | B2 |
8189539 | Wang et al. | May 2012 | B2 |
8391410 | Wang | Mar 2013 | B2 |
20010034868 | El-Gamal et al. | Oct 2001 | A1 |
20020122383 | Wu et al. | Sep 2002 | A1 |
20020131481 | Ozluturk | Sep 2002 | A1 |
20020150181 | Sayeed | Oct 2002 | A1 |
20020167924 | Agrawal et al. | Nov 2002 | A1 |
20030007466 | Chen | Jan 2003 | A1 |
20030142730 | Lin | Jul 2003 | A1 |
20030174686 | Willenegger et al. | Sep 2003 | A1 |
20040028004 | Hayashi et al. | Feb 2004 | A1 |
20040081131 | Walton et al. | Apr 2004 | A1 |
20040199846 | Matsumoto et al. | Oct 2004 | A1 |
20040203885 | Quaid | Oct 2004 | A1 |
20040218570 | Black et al. | Nov 2004 | A1 |
20040240538 | Abrishamkar et al. | Dec 2004 | A1 |
20050016201 | Ivanov et al. | Jan 2005 | A1 |
20050063298 | Ling et al. | Mar 2005 | A1 |
20050111524 | Baker et al. | May 2005 | A1 |
20050122928 | Vijayan et al. | Jun 2005 | A1 |
20050135308 | Vijayan et al. | Jun 2005 | A1 |
20050135517 | Coffey et al. | Jun 2005 | A1 |
20050195763 | Kadous et al. | Sep 2005 | A1 |
20050243939 | Jung et al. | Nov 2005 | A1 |
20050286611 | Priotti | Dec 2005 | A1 |
20060034163 | Gore et al. | Feb 2006 | A1 |
20060109781 | Wang et al. | May 2006 | A1 |
20060117167 | Evrard et al. | Jun 2006 | A1 |
20060123310 | Wang et al. | Jun 2006 | A1 |
20060133388 | Wang et al. | Jun 2006 | A1 |
20060209927 | Khandekar et al. | Sep 2006 | A1 |
20060215538 | Murthy et al. | Sep 2006 | A1 |
20060280228 | Daniele et al. | Dec 2006 | A1 |
20070025738 | Moore | Feb 2007 | A1 |
20070036065 | Wang | Feb 2007 | A1 |
20070081484 | Wang | Apr 2007 | A1 |
20070082696 | Wang | Apr 2007 | A1 |
20070232251 | Murthy et al. | Oct 2007 | A1 |
20080317142 | Wang et al. | Dec 2008 | A1 |
20090161776 | Wang et al. | Jun 2009 | A1 |
Number | Date | Country |
---|---|---|
1345493 | Apr 2002 | CN |
1348310 | May 2002 | CN |
0938208 | Aug 1999 | EP |
1222828 | Jul 2002 | EP |
1304812 | Apr 2003 | EP |
09261209 | Oct 1997 | JP |
10210000 | Aug 1998 | JP |
2000013356 | Jan 2000 | JP |
2000031838 | Jan 2000 | JP |
2000068975 | Mar 2000 | JP |
2001217861 | Aug 2001 | JP |
2001268048 | Sep 2001 | JP |
2001320345 | Nov 2001 | JP |
2001339657 | Dec 2001 | JP |
2002057640 | Feb 2002 | JP |
2002111621 | Apr 2002 | JP |
2002111631 | Apr 2002 | JP |
2002217894 | Aug 2002 | JP |
2003124904 | Apr 2003 | JP |
2003518816 | Jun 2003 | JP |
2003188848 | Jul 2003 | JP |
2003521842 | Jul 2003 | JP |
2003524330 | Aug 2003 | JP |
2003524929 | Aug 2003 | JP |
2003309535 | Oct 2003 | JP |
2004032711 | Jan 2004 | JP |
2004048676 | Feb 2004 | JP |
2004133801 | Apr 2004 | JP |
2005536097 | Nov 2005 | JP |
20010088148 | Sep 2001 | KR |
200461482 | Jul 2004 | KR |
211474 | Feb 1989 | NZ |
503592 | Feb 2002 | NZ |
2134017 | Jul 1999 | RU |
2137310 | Sep 1999 | RU |
2178953 | Jan 2002 | RU |
2003109329 | Jan 2005 | RU |
1327296 | Jul 1987 | SU |
I228893 | Mar 2005 | TW |
I244349 | Nov 2005 | TW |
0034799 | Jun 2000 | WO |
0035102 | Jun 2000 | WO |
0036208 | Jun 2000 | WO |
0049780 | Aug 2000 | WO |
0065726 | Nov 2000 | WO |
0074248 | Dec 2000 | WO |
0105059 | Jan 2001 | WO |
0147157 | Jun 2001 | WO |
02099994 | Dec 2002 | WO |
03058823 | Jul 2003 | WO |
03079576 | Sep 2003 | WO |
03081938 | Oct 2003 | WO |
2004015948 | Feb 2004 | WO |
2004082200 | Sep 2004 | WO |
2005076558 | Aug 2005 | WO |
2005076641 | Aug 2005 | WO |
2005114940 | Dec 2005 | WO |
2006015269 | Feb 2006 | WO |
2006016212 | Feb 2006 | WO |
2006086878 | Aug 2006 | WO |
2009015330 | Jan 2009 | WO |
Entry |
---|
Daza V., et al., “A Distributed and Computationally Secure Key Distribution Scheme”, Information Security, Lecture Notes in Computer Science, vol. 2433, 2002, pp. 342-356. |
International Search Report and Written Opinion—PCT/US2014/015860—ISA/EPO—Jun. 12, 2014. |
Takahashi, Y., “Image Information Media towards the 21st Century,” Journal of the Institute of Image Information and Television Engineers, Japan, The Institute of Image Information and Television Engineers, Jan. 2000, vol. 54, No. 1, pp. 14-20. |
Arshad K et al: “Performance of Wireless OFDM System Channel Estimation with Different Pilot Patterns” Spread Spectrum Techniques and Applications, 2004 IEEE Eighth International Symposium on Sydney, Australia Aug. 30,-Sep. 2, 2004, Piscataway, NJ, USA, IEEE, Aug. 30, 2004, pp. 179-183, XP010754933. |
Chari M.R., et al., “FLO Physical Layer: An Overview” IEEE transactions on Broadcasting, Mar. 1, 2007, pp. 145-160, vol. 53 (1), XP011172013, IEEE Service Center, Piscataway, NJ, US, Issn: 0018-9316, Abstract; Figures 8,11,13, Sections IV.C.4), IV.C.8), IV.C.9 Standards. |
Comsa C et al: “System level design of baseband OFDM for wireless LAN” Signals, Circuits and Systems, 2003. SCS 2003. International Symposium on Jul. 10-11, 2003, Piscataway, NJ, USA, IEEE, vol. 1, Jul. 10, 2003, pp. 313-316, XP010654936. |
Eroz et al.: “On the Design of Prunable Interleavers for Turbo codes,” IEEE Vehicular Technology Conference, pp. 1669-1673, XP010342111 (1999). |
European Search Report—EP12176160—Search Authority—The Hague—Jul. 30, 2012. |
“Forward Link Only Air Interface Specification for Terrestrial Mobile Multimedia Multicast: TIA-1099” EIMIA Standards, Telecomm. Industry Assoc., Aug. 1, 2006, XP017005609, Arlington, VA, Secs. 5.2.1.2.9.2.7, 5.2.1.2.9.2.8, 5.2.1.2.10. |
Hill “A First Course on Coding Theory”, 1986 Oxford University Press, Chapter 2, pp. 11-13. |
International Preliminary Examination Report PCT/US07/077031, WIPO Geneva Switzerland, Mar. 3, 2009. |
International Preliminary Report on Patentability—PCT/US07/079785—European Patent Office—Berlin—Apr. 9, 2009. |
International Preliminary Report on Patentability—PCT/US07/079785—The International Bureau of WIPO—Geneva, Switzerland—Mar. 31, 2009. |
International Preliminary Report on Patentability—PCT/US07/079787—European Patent Office—Berlin—Apr. 9, 2009. |
International Preliminary Report on Patentability—PCT/US2005/027106, International Search Authority—IPEA/US—Jul. 3, 2008. |
International Preliminary Report on Patentability—PCT/US2005/027104, International Bureau of WIPO—Geneva, Switzerland—Jan. 30, 2007. |
International Search Report—PCT/US05/027104, International Search Authority—European Patent Office—Mar. 7, 2006. |
International Search Report—PCT/US05/027105, International Search Authority—European Patent Office—Nov. 29, 2005. |
International Search Report—PCT/US05/027106, International Search Authority—European Patent Office—Nov. 14, 2005. |
International Search Report—PCT/US07/077031, International Search Authority—European Patent Office—May 19, 2008. |
International Search Report—PCT/US07/079785, International Search Authority—European Patent Office—Mar. 6, 2008. |
International Search Report—PCT/US07/079787, International Search Authority—European Patent Office—Feb. 27, 2008. |
International Search Report, PCT/US2008/071168, International Searching Authority, European Patent Office, Jun. 17, 2009. |
Muramatsu et al.:“Perfect reconstruction deinterlacer banks for field scalable video compression,” International Conference on Image Processing, pp. 2279-2282, XP010786240 (2004). |
Nevdyaev L.M., “Telecommunication Technologies,” 2002, pp. 347, Moscow, Communication and Business. |
Parthasarathy et al.: “Reliable transmission of high-quality video over ATM networks,” IEEE Transactions on Image Processing, vol. 8, No. 3, XP011026288 (Mar. 1999). |
Patterson & Hennessey, “Computer Organization and Design” 1994, Morgan Kaufmann Publishers, Figure 5.11 and description thereof and discussion, pp. 280-285. |
Taiwan Search Report—TW096131937—TIPO—May 2, 2011. |
Taiwan Search Report—TW096136065—TIPO—Jan. 31, 2011. |
Taiwan Search Report—TW096136065—TIPO—May 24, 2012. |
Taiwan Search Report—TW097128538—TIPO—Mar. 27, 2012. |
Taiwan Search Report—TW096135972—TIPO—Sep. 7, 2011. |
TIA: “Forward Link Only Air Interface Specification” Rev. 1.1, Physical Layer, FLO Forum Technical Contribution to TR47, Dec. 22, 2005, pp. 5-8 to 5-24. |
TIA:“Forward Link Only Air Interface Specification Rev. 1.1”, FLO Forum Technical Contribution to TR47, pp. 1-1 to 6-2, Dec. 22, 2005. |
Written Opinion—PCT/US07/079785, International Search Authority—European Patent Office—Mar. 6, 2008. |
Written Opinion—PCT/US07/079787, International Search Authority—European Patent Office—Feb. 27, 2008. |
Written Opinion—PCT/US2007/077031, International Search Authority, European Patent Office, May 19, 2008. |
Written Opinion—PCT/US2005/027106, International Search Authority—European Patent Office—Nov. 14, 2005. |
Written Opinion, PCT/US2008/071168, International Searching Authority, European Patent Office, Jun. 17, 2009. |
Written Opinion—PCT/US2005/027104, International Searching Authority—European Patent Office—Mar. 7, 2006. |
Written Opinion—PCT/US2005/027105, International Searching Authority—European Patent Office—Nov. 29, 2005. |
Zhongren Cao et al.: “Efficient Structure-Based Carrier Frequency Offset Estimation for Interleaved OFDMA Uplink,” IEEE, pp. 3361-3365, XP-010643069, 2003. |
Li Y., “Pilot-symbol-aided channel estimation for OFDM in wireless systems”, IEEE Transactions on Vehicular Technology, vol. 49, No. 4, Jul. 2000, ISSN : 0018-9545, INSPEC Accession No. 6751663, DOI: 10.1109/25.875230 ,pp. 1207-1215. |
Translation of First Office Action from counterpart Japanese Application No. 2013-118480, dated Jul. 8, 2014, 2 pages. |
European Office Action dated Nov. 26, 2014, for European Patent Application Serial No. 07841502.3, 6 pages. |
Notification of Reexamination in Chinese Application No. 200780036041.4 dated Jan. 16, 2015, 19 pages. |
Notification of the First Office Action from Chinese Patent Office date Oct. 17, 2014 for the corresponding Chinese patent application No. 201210524314.2. |
ETSI TS 125 212 v6.2.0; “Universal Mobile Telecommunications System (UMTS); Multiplexing and channel coding (FDD)”, 3GPP TS 25.212 version 6.2.0 Release 6 (Jun. 2004), pp. 1-76. |
European Office Action dated Jul. 14, 2015, for European Patent Application No. 12176160.5, 6 pages. |
European Office Action dated Jul. 28, 2015, for European Patent Application No. 05777259.2, 6 pages. |
Number | Date | Country | |
---|---|---|---|
20130156124 A1 | Jun 2013 | US |
Number | Date | Country | |
---|---|---|---|
60951949 | Jul 2007 | US | |
60592999 | Jul 2004 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11929927 | Oct 2007 | US |
Child | 13767834 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11192789 | Jul 2005 | US |
Child | 11929927 | US |