I. Field
The present disclosure relates generally to communication, and more specifically to transmission techniques for a wireless communication system.
II. Background
Wireless communication systems are widely deployed to provide various communication services such as voice, video, packet data, messaging, broadcast, etc.
These systems may be multiple-access systems capable of supporting multiple users by sharing the available system resources. Examples of such multiple-access systems include Code Division Multiple Access (CDMA) systems, Time Division Multiple Access (TDMA) systems, Frequency Division Multiple Access (FDMA) systems, Orthogonal FDMA (OFDMA) systems, and Single-Carrier FDMA (SC-FDMA) systems.
A multiple-access system may utilize one or more multiplexing schemes such as code division multiplexing (CDM), time division multiplexing (TDM), etc. The system may be deployed and may serve existing terminals. It may be desirable to improve the performance of the system while retaining backward compatibility for the existing terminals. For example, it may be desirable to employ spatial techniques such as multiple-input multiple-output (MIMO) and spatial division multiple access (SDMA) to improve throughput and/or reliability by exploiting additional spatial dimensionalities provided by use of multiple antennas.
A multi-antenna communication system supports multiple-input multiple-output (MIMO) transmission from multiple (T) transmit antennas to multiple (R) receive antennas. A MIMO channel formed by the T transmit antennas and R receive antennas is composed of S spatial channels, where S≦min {T, R}. The S spatial channels may be used to transmit data in parallel to achieve higher overall throughput and/or redundantly to achieve greater reliability.
An accurate estimate of a wireless channel between a transmitter and a receiver is normally needed at the receiver in order to recover data sent via the wireless channel. Channel estimation is typically performed by sending a pilot from the transmitter and measuring the pilot at the receiver. The pilot is made up of symbols that are known a priori by both the transmitter and receiver. The receiver can thus estimate the channel response based on the received symbols and the known symbols.
The multi-antenna system supports MIMO receivers (which are receivers equipped with multiple antennas). MIMO receivers typically require different channel estimates and thus have different requirements for the pilot, as described below. Since pilot transmission represents overhead in the multi-antenna system, it is desirable to minimize pilot transmission to the extent possible. However, the pilot transmission should be such that MIMO receivers can obtain channel estimates of sufficient quality.
There is therefore a need in the art for transmission techniques to efficiently transmit a pilot in a multi-antenna system that can support spatial techniques while retaining backward compatibility for existing terminals.
Techniques for transmitting a spatial pilot to support MIMO receivers in a multi-antenna and multi-layer transmission communication system are described herein.
According to one embodiment of the present invention, a method of transmitting a pilot in a wireless communication system is described. The method includes generating a first layer pilot for a single layer transmission. The first layer pilot is repeated across subbands in a first OFDM symbol and the first layer pilot is also repeated offset from the first OFDM symbol in an adjacent second OFDM symbol. The first and second OFDM symbols are then transmitted.
According to another embodiment of the present invention, an apparatus in a wireless communication system is described. The apparatus includes a pilot generator operative to generate at least one pilot based on a number of layers of transmission with each of the at least one pilot being repeated across subbands of a first OFDM symbol. The at least one pilot is further repeated and offset from others of the at least one pilot of the first OFDM symbol across subbands of an adjacent second OFDM symbol. The apparatus further includes a plurality of transmitter units operative to transmit each of the first and second OFDM symbols in a respective number of layer transmission via a plurality of transmit antennas.
According to a further embodiment of the present invention, a method of performing channel estimation in a wireless communication system is described. The method includes obtaining, via a plurality of receive antennas, received symbols each including a first layer pilot with adjacent ones of the received symbols including the first layer pilot offset in the subbands from each other. The method further includes processing the received symbols based on the first layer pilot to obtain estimates of a plurality of channels between the plurality of transmit antennas and the plurality of receive antennas.
According to a yet further embodiment of the present invention, an apparatus in a wireless communication system is described. The apparatus includes a plurality of receiver units operative to provide received symbols each including a first layer pilot with adjacent ones of the received symbols including the first layer pilot offset in the subbands from each other. The apparatus further includes a channel estimator operative to process the received symbols based on the first layer pilot to obtain estimates of a plurality of channels between the plurality of transmit antennas and the plurality of receive antennas.
The transmission techniques described herein may be used for various wireless communication systems such as CDMA, TDMA, FDMA, OFDMA, and SC-FDMA systems. The terms “systems” and “networks” are often used interchangeably. A CDMA system may implement a radio technology such cdma2000, Universal Terrestrial Radio Access (UTRA), Evolved UTRA (E-UTRA), etc. cdma2000 covers IS-2000, IS-95 and IS-856 standards. UTRA includes Wideband-CDMA (W-CDMA) and Low Chip Rate (LCR). A TDMA system may implement a radio technology such as Global System for Mobile Communications (GSM). An OFDMA system may implement a radio technology such as Long Term Evolution (LTE), IEEE 802.20, Flash-OFDM®, etc. UTRA, E-UTRA, GSM and LTE are described in documents from an organization named “3rd Generation Partnership Project” (3GPP). cdma2000 is described in documents from an organization named “3rd Generation Partnership Project 2” (3GPP2). These various radio technologies and standards are known in the art.
For clarity, various aspects of the techniques are described below for a High Rate Packet Data (HRPD) system that implements IS-856. HRPD is also referred to as Evolution-Data Optimized (EV-DO), Data Optimized (DO), High Data Rate (HDR), etc. The terms HRPD and EV-DO are used often interchangeably. Currently, HRPD Revisions (Revs.) 0, A, and B have been standardized, HRPD Revs. 0 and A are deployed, and HRPD Rev. C is under development. HRPD Revs. 0 and A cover single-carrier HRPD (1xHRPD). HRPD Rev. B covers multi-carrier HRPD and is backward compatible with HRPD Revs. 0 and A. The techniques described herein may be incorporate in any HRPD revision. For clarity, HRPD terminology is used in much of the description below.
Terminals 120 may be dispersed throughout the system, and each terminal may be stationary or mobile. A terminal may also be referred to as an access terminal, a mobile station, a user equipment, a subscriber unit, a station, etc. A terminal may be a cellular phone, a personal digital assistant (PDA), a wireless device, a handheld device, a wireless modem, a laptop computer, etc. A terminal may support any HRPD Revisions. In HRPD, a terminal may receive a transmission on the forward link from one access point at any given moment and may send a transmission on the reverse link to one or more access points. The forward link (or downlink) refers to the communication link from the access points to the terminals, and the reverse link (or uplink) refers to the communication link from the terminals to the access points.
HRPD Revs. 0, A and B use CDM for data sent in the traffic segments. A traffic segment may carry CDM data for one or more terminals being served by an access point. The traffic data for each terminal may be processed based on coding and modulation parameters determined by channel feedback received from that terminal to generate data symbols. The data symbols for the one or more terminals may be demultiplexed and covered with 16-chip Walsh functions or codes to generate the CDM data for the traffic segment. The CDM data is thus generated in the time domain using Walsh functions. A CDM traffic segment is a traffic segment carrying CDM data.
It may be desirable to use OFDM and/or single-carrier frequency division multiplexing (SC-FDM) for data sent in the traffic segments. OFDM and SC-FDM partition the available bandwidth into multiple orthogonal subcarriers, which are also referred to as tones, bins, etc. Each subcarrier may be modulated with data. In general, modulation symbols are sent in the frequency domain with OFDM and in the time domain with SC-FDM. OFDM and SC-FDM have certain desirable characteristics such as the ability to readily combat intersymbol interference (ISI) caused by frequency selective fading. OFDM can also efficiently support MIMO and SDMA, which may be applied independently on each subcarrier and may thus provide good performance in a frequency selective channel. For clarity, the use of OFDM to send data is described below.
It may be desirable to support OFDM while retaining backward compatibility with HRPD Revs. 0, A and B. In HRPD, the pilot and MAC segments may be demodulated by all active terminals at all times whereas the traffic segments may be demodulated by only the terminals being served. Hence, backward compatibility may be achieved by retaining the pilot and MAC segments and modifying the traffic segments. OFDM data may be sent in an HRPD waveform by replacing the CDM data in a given 400-chip traffic segment with one or more OFDM symbols having a total duration of 400 chips or less.
A MISO channel formed by the two antennas at the access point 110 and the single antenna at the MISO terminal 120a may be characterized by a 1×2 channel response row vector h1×2. A MIMO channel formed by the two antennas at the access point 110 and the two antennas at the MIMO terminal 120b may be characterized by a 2×2 channel response matrix H2×2. The access point 110 transmits a pilot from the two transmit antennas to allow the MISO and MIMO terminals to estimate their respective MISO and MIMO channels. A pilot generator 112 at the access point 110 may generate a composite pilot.
The access point 110 may transmit data in parallel from both transmit antennas to the MIMO receiver to improve throughput. The description above is for a 2×2 system in which the access point has two transmit antennas and the terminals have at most two receive antennas. In general, a multi-antenna system may include transmitters and receivers with any number of antennas, so that T and R may be any integer values.
Multi-antenna system may utilize multiple carriers for data and pilot transmission. Multiple carriers may be provided by OFDM, some other multi-carrier modulation techniques, or some other construct. OFDM effectively partitions the overall system bandwidth (W MHz) into multiple (K) orthogonal frequency subbands. These subbands are also called tones, subcarriers, bins, and frequency channels. With OFDM, each subband is associated with a respective subcarrier that may be modulated with data. A multi-antenna OFDM system may use only a subset of the K total subbands for data and pilot transmission, and the remaining subbands may serve as guard subbands to allow the system to meet spectral mask requirements. For simplicity, the following description assumes that all K subbands are usable for data and/or pilot transmission.
Since the various layer spatial pilot tones are transmitted on different sets of P pilot subbands in different symbol periods, this staggered pilot scheme allows the MIMO receivers to obtain pilot observations for more than their specific subbands without increasing the number of subbands used for pilot transmission in any one symbol period. For all pilot transmission schemes, the MIMO receivers may derive frequency response estimates for the channel based on their received symbols and using various channel estimation techniques.
Pilot generator 910 generates the T composite pilots for the MIMO terminals. The composite spatial pilot tones for the subbands are generated according to the spatial layer transmissions described hereinabove.
Data spatial processor 920 receives the data symbols from TX data processor 820 and performs spatial processing on these data symbols. For example, data spatial processor 920 may demultiplex the data symbols into T substreams for the T transmit antennas. Data spatial processor 920 may or may not perform additional spatial processing on these substreams, depending on the system design. Each multiplexer 930 receives a respective data symbol substream from data spatial processor 920 and the transmit symbols for its associated transmit antenna, multiplexes the data symbols with the transmit symbols, and provides an output symbol stream.
Each transmitter unit 832 receives and processes a respective output symbol stream. Within each transmitter unit 832, an IFFT unit 942 transforms each set of K output symbols for the K total subbands to the time domain using a K-point IFFT and provides a transformed symbol that contains K time-domain chips. A cyclic prefix generator 944 repeats a portion of each transformed symbol to form an OFDM symbol that contains K+C chips, where C is the number of chips repeated. The repeated portion is called a cyclic prefix and is used to combat delay spread in the wireless channel. A TX radio frequency (RF) unit 946 converts the OFDM symbol stream into one or more analog signals and further amplifies, filters, and frequency upconverts the analog signal(s) to generate a modulated signal that is transmitted from an associated antenna 834. Cyclic prefix generator 944 and/or TX RF unit 946 may also provide the cyclic delay for its transmit antenna.
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 disclosure 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 disclosure 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 disclosure 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 that 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 disclosure is provided to enable any person skilled in the art to make or use the disclosure. Various modifications to the disclosure will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other variations without departing from the spirit or scope of the disclosure. Thus, the disclosure is not intended to be limited to the examples described herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
The present Application for Patent claims priority to Provisional Application Ser. No. 60/775,443, entitled “Wireless Communication System and Method,” and Provisional Application Ser. No. 60/775,693, entitled “DO Communication System and Method,” both filed Feb. 21, 2006, assigned to the assignee hereof, and expressly incorporated herein by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 6078572 | Tanno et al. | Jun 2000 | A |
| 6130886 | Ketseoglou et al. | Oct 2000 | A |
| 6694469 | Jalali et al. | Feb 2004 | B1 |
| 6717924 | Ho et al. | Apr 2004 | B2 |
| 6788687 | Bao et al. | Sep 2004 | B2 |
| 6822952 | Abrol et al. | Nov 2004 | B2 |
| 6882632 | Koo et al. | Apr 2005 | B1 |
| 6912214 | Madour et al. | Jun 2005 | B2 |
| 6963534 | Shorey et al. | Nov 2005 | B1 |
| 6970437 | Lott et al. | Nov 2005 | B2 |
| 6980569 | Beyda et al. | Dec 2005 | B1 |
| 6987780 | Wei et al. | Jan 2006 | B2 |
| 7002900 | Walton et al. | Feb 2006 | B2 |
| 7042869 | Bender | May 2006 | B1 |
| 7043249 | Sayeedi | May 2006 | B2 |
| 7050405 | Attar et al. | May 2006 | B2 |
| 7062283 | Dooley | Jun 2006 | B2 |
| 7065060 | Yun et al. | Jun 2006 | B2 |
| 7088701 | Attar et al. | Aug 2006 | B1 |
| 7095709 | Walton et al. | Aug 2006 | B2 |
| 7099629 | Bender | Aug 2006 | B1 |
| 7127654 | Jalali et al. | Oct 2006 | B2 |
| 7139274 | Attar et al. | Nov 2006 | B2 |
| 7145940 | Gore et al. | Dec 2006 | B2 |
| 7170876 | Wei et al. | Jan 2007 | B2 |
| 7463867 | Luo et al. | Dec 2008 | B2 |
| 7680211 | Von der Embse | Mar 2010 | B1 |
| 7719991 | Bhushan et al. | May 2010 | B2 |
| 7764981 | Kalofonos et al. | Jul 2010 | B2 |
| 8077595 | Bhushan et al. | Dec 2011 | B2 |
| 20010009555 | Diepstraten et al. | Jul 2001 | A1 |
| 20020002704 | Davis et al. | Jan 2002 | A1 |
| 20020145990 | Sayeedi | Oct 2002 | A1 |
| 20020193112 | Aoki et al. | Dec 2002 | A1 |
| 20030040315 | Khaleghi et al. | Feb 2003 | A1 |
| 20030072254 | Ma et al. | Apr 2003 | A1 |
| 20030153327 | Tajiri et al. | Aug 2003 | A1 |
| 20030220103 | Kim et al. | Nov 2003 | A1 |
| 20040022203 | Michelson et al. | Feb 2004 | A1 |
| 20040063431 | Julka et al. | Apr 2004 | A1 |
| 20040095851 | Ellner et al. | May 2004 | A1 |
| 20040141481 | Lee et al. | Jul 2004 | A1 |
| 20040147223 | Cho | Jul 2004 | A1 |
| 20040228267 | Agrawal et al. | Nov 2004 | A1 |
| 20050063298 | Ling et al. | Mar 2005 | A1 |
| 20050073969 | Hart et al. | Apr 2005 | A1 |
| 20050111397 | Attar et al. | May 2005 | A1 |
| 20050111437 | Maturi | May 2005 | A1 |
| 20050111599 | Walton et al. | May 2005 | A1 |
| 20050135284 | Nanda et al. | Jun 2005 | A1 |
| 20050135291 | Ketchum et al. | Jun 2005 | A1 |
| 20050135318 | Walton et al. | Jun 2005 | A1 |
| 20050135403 | Ketchum et al. | Jun 2005 | A1 |
| 20050135416 | Ketchum et al. | Jun 2005 | A1 |
| 20050141475 | Vijayan et al. | Jun 2005 | A1 |
| 20050163262 | Gupta | Jul 2005 | A1 |
| 20050195763 | Kadous et al. | Sep 2005 | A1 |
| 20050249177 | Huo et al. | Nov 2005 | A1 |
| 20050270969 | Han et al. | Dec 2005 | A1 |
| 20050281290 | Khandekar et al. | Dec 2005 | A1 |
| 20060013182 | Balasubramanian et al. | Jan 2006 | A1 |
| 20060018397 | Sampath et al. | Jan 2006 | A1 |
| 20060018411 | Gore et al. | Jan 2006 | A1 |
| 20060023772 | Mudulodu et al. | Feb 2006 | A1 |
| 20060078075 | Stamoulis et al. | Apr 2006 | A1 |
| 20060088003 | Harris | Apr 2006 | A1 |
| 20060133273 | Julian et al. | Jun 2006 | A1 |
| 20060133521 | Sampath et al. | Jun 2006 | A1 |
| 20060135080 | Khandekar et al. | Jun 2006 | A1 |
| 20060136790 | Julian et al. | Jun 2006 | A1 |
| 20060171295 | Ihm et al. | Aug 2006 | A1 |
| 20060193338 | Zheng et al. | Aug 2006 | A1 |
| 20060198344 | Teague et al. | Sep 2006 | A1 |
| 20060203794 | Sampath et al. | Sep 2006 | A1 |
| 20060203845 | Monogioudis | Sep 2006 | A1 |
| 20060205413 | Teague | Sep 2006 | A1 |
| 20060209732 | Gorokhov et al. | Sep 2006 | A1 |
| 20060209927 | Khandekar et al. | Sep 2006 | A1 |
| 20060217124 | Bi et al. | Sep 2006 | A1 |
| 20060227887 | Li et al. | Oct 2006 | A1 |
| 20060233124 | Palanki | Oct 2006 | A1 |
| 20060233131 | Gore et al. | Oct 2006 | A1 |
| 20060240784 | Naguib et al. | Oct 2006 | A1 |
| 20060274712 | Malladi et al. | Dec 2006 | A1 |
| 20060276212 | Sampath et al. | Dec 2006 | A1 |
| 20060286974 | Gore et al. | Dec 2006 | A1 |
| 20070010957 | Sampath et al. | Jan 2007 | A1 |
| 20070011589 | Palanki | Jan 2007 | A1 |
| 20070019535 | Sambhwani et al. | Jan 2007 | A1 |
| 20070025325 | Kumar | Feb 2007 | A1 |
| 20070025345 | Bachl et al. | Feb 2007 | A1 |
| 20070030839 | Vimpari et al. | Feb 2007 | A1 |
| 20070070942 | Harris et al. | Mar 2007 | A1 |
| 20070071127 | Gore et al. | Mar 2007 | A1 |
| 20070087749 | Ionescu et al. | Apr 2007 | A1 |
| 20070195723 | Attar et al. | Aug 2007 | A1 |
| 20070195740 | Bhushan et al. | Aug 2007 | A1 |
| 20070195747 | Attar et al. | Aug 2007 | A1 |
| 20070195899 | Bhushan et al. | Aug 2007 | A1 |
| 20070195908 | Attar et al. | Aug 2007 | A1 |
| 20070293172 | Shi et al. | Dec 2007 | A1 |
| 20080151743 | Tong et al. | Jun 2008 | A1 |
| 20090067405 | Zhang et al. | Mar 2009 | A1 |
| 20090310702 | Lewis | Dec 2009 | A1 |
| 20120014392 | Bhushan et al. | Jan 2012 | A1 |
| 20120269052 | Chen et al. | Oct 2012 | A1 |
| Number | Date | Country |
|---|---|---|
| 0959634 | Nov 1999 | EP |
| 0995275 | Apr 2000 | EP |
| 1367760 | Dec 2003 | EP |
| 1422851 | May 2004 | EP |
| 1489775 | Dec 2004 | EP |
| 1513304 | Mar 2005 | EP |
| 1542488 | Jun 2005 | EP |
| 1565015 | Aug 2005 | EP |
| 1596525 | Nov 2005 | EP |
| 1608120 | Dec 2005 | EP |
| 1619847 | Jan 2006 | EP |
| 2394871 | May 2004 | GB |
| 2000270024 | Sep 2000 | JP |
| 2002320260 | Oct 2002 | JP |
| 2002374562 | Dec 2002 | JP |
| 2002544733 | Dec 2002 | JP |
| 2003533078 | Nov 2003 | JP |
| 2004158901 | Jun 2004 | JP |
| 2005510904 | Apr 2005 | JP |
| 2005536967 | Dec 2005 | JP |
| 2006270968 | Oct 2006 | JP |
| 2009503912 | Jan 2009 | JP |
| 20040029416 | Apr 2004 | KR |
| 2005120806 | Dec 2005 | KR |
| 2238611 | Oct 2004 | RU |
| 2004117217 | Mar 2005 | RU |
| WO0069203 | Nov 2000 | WO |
| 0176110 | Oct 2001 | WO |
| WO0180477 | Oct 2001 | WO |
| WO0219605 | Mar 2002 | WO |
| WO03017688 | Feb 2003 | WO |
| WO03034644 | Apr 2003 | WO |
| WO03041298 | May 2003 | WO |
| WO03096581 | Nov 2003 | WO |
| WO03096598 | Nov 2003 | WO |
| WO2004004269 | Jan 2004 | WO |
| WO2004038984 | May 2004 | WO |
| WO2004038988 | May 2004 | WO |
| WO2004056142 | Jul 2004 | WO |
| WO2004057894 | Jul 2004 | WO |
| WO2004084450 | Sep 2004 | WO |
| WO2004095851 | Nov 2004 | WO |
| WO2004098098 | Nov 2004 | WO |
| WO2004114548 | Dec 2004 | WO |
| WO2004114549 | Dec 2004 | WO |
| WO2005015775 | Feb 2005 | WO |
| WO2005032001 | Apr 2005 | WO |
| WO2005048640 | May 2005 | WO |
| WO2005067247 | Jul 2005 | WO |
| WO2005071867 | Aug 2005 | WO |
| 2005088882 | Sep 2005 | WO |
| WO2005125139 | Dec 2005 | WO |
| WO2006086497 | Aug 2006 | WO |
| Entry |
|---|
| Fan, et al.; “On the Reverse Link Performance of Cdma2000 1Xev-Do Revision A System”, IEEE Xplore Online, Feb. 2005, pp. 2244-2250,XP002438335,New York, USA. |
| Hermann Rohling et al., : “Performance Comparison of Different Multiple Access Schemes for the Downlink of an OFDM Communication System”, Vehicular Technology Conference, 1997, 47th IEEE, vol. 3, May 3-7, 1997, pp. 1365-1369. |
| International Search Report and Written Opinion—PCT/US2007/062453, International Search Authority—European Patent Office—Aug. 14, 2007. |
| Ojanpera, T. et al.: “Frames—Hybrid Multiple Access Technology,” IEEE International Symposium on Spread Spectrum Techniques and Applications, No. 1, Sep. 22, 1996, pp. 320-324. |
| Taiwan Search Report—TW096106485—TIPO—Mar. 8, 2011. |
| Taiwan Search Report—TW096106486—TIPO—Jan. 10, 2011. |
| Taiwan Search Report—TW096106487—TIPO—Dec. 15, 2010. |
| Taiwanese Search report—096106482—TIPO—Jan. 24, 2011. |
| Taiwan Search Report—TW097142233—TIPO—Dec. 20, 2011. |
| Number | Date | Country | |
|---|---|---|---|
| 20070195688 A1 | Aug 2007 | US |
| Number | Date | Country | |
|---|---|---|---|
| 60775443 | Feb 2006 | US | |
| 60775693 | Feb 2006 | US |