Numerous current and most emerging wireless technologies are based on Orthogonal Frequency-Division Multiplexing (OFDM) where the transmitter uses an Inverse Fast Fourier Transform (IFFT) and the receiver uses Fast Fourier Transform (FFT)—both in baseband. When implemented in a Software Defined Radio (SDR), non-OFDM based schemes require a separate software module running in parallel to OFDM based schemes when simultaneous radio transmission is desired. This can cause a performance problem and increased complexity in signaling between the operating system (OS) and the hardware (HW).
The present invention relates to methods and apparatuses for OFDM communication of non-OFDM radio signals. To increase the effectiveness of wireless communication, and therefore the utility of mobile devices that communicate wirelessly, wireless devices may include processors and methods to allow non-OFDM signals to be processed in software configured to process OFDM signals. In this regard, the non-OFDM radio signals are force-modulated into OFDM signals and processed along with the actual OFDM.
In one embodiment, a method of operating a computing device to accommodate non-OFDM signals is disclosed. The method includes receiving a non-OFDM signal; processing the non-OFDM signal into a created OFDM signal; and processing the created OFDM signal.
In another embodiment, a method of operating a computing device to accommodate non-OFDM signals is disclosed. The method includes receiving a non-OFDM signal; processing the non-OFDM signal into an OFDM signal to produce a created OFDM signal; receiving an actual OFDM signal; and processing the actual OFDM signal with the created OFDM signal.
In still another embodiment, an apparatus for operating a computing device to accommodate non-OFDM signals is provided. The apparatus includes a first receive circuit configurable to receive a non-OFDM signal and a first processor configurable to process the non-OFDM signal to produce a created OFDM signal. A second receive circuit is configurable to receive an OFDM signal and a second processor is configurable to process the actual OFDM signal together with the created OFDM signal and to execute an FFT on the signals.
The foregoing is a non-limiting summary of the invention, which is defined by the attached claims.
The accompanying drawings are not intended to be drawn to scale. In the drawings, each identical or nearly identical component that is illustrated in various figures is represented by a like numeral. For purposes of clarity, not every component may be labeled in every drawing. In the drawings:
This disclosure addresses the need in prior art systems for separate software modules running in parallel to handle both non-OFDM based schemes and OFDM based schemes when simultaneous radio transmission is desired. In one aspect, this problem is addressed by force-modulating non-OFDM signals into OFDM signals. The non-OFDM signal is received and is processed to produce a created OFDM signal. An actual OFDM signal is also received and is processed together with the created OFDM signal. In this manner, non-OFDM signals to be processed in software configured to process OFDM signals. It should be appreciated that the present invention is not limited to single access OFDM and that multiple access OFDMA may be employed.
By way of example, if a user is using a Bluetooth headset, together with browsing the Internet (e.g., on MSN) using a wireless connection, the headset is communicating wirelessly with the computer and the computer is communicating wirelessly to the Internet connection. Using Software Defined Radio (SDR), both Bluetooth modulation and the connection to the Internet can be employed. However, the Bluetooth communication employs non-OFDM transmission whereas the wireless connection to the Internet employs OFDM transmission. Accommodating for this mixed-signal is more complex with more signaling between the different radios as compared to a single-type signal between radios. The inventors have appreciated that if the non-OFDM signal (e.g., Bluetooth signal) is transformed into an OFDM or OFDM-like signal, then just one module and/or one executable file to handle the signals need be employed. Using suitable FFT and IFFT algorithms for the signals, different radios are not required.
Data is typically transmitted at high speed and is sent through a serial to parallel converter. The data is transferred from serial to a 52 parallel stream. By way of example, if data is transmitted at 52 megabit per second, each stream would be 1 megabit per second. The 52 streams are then processed via an IFFT algorithm. The signal may then be transformed from parallel to serial again and transmitted over the channel. At the receiver, the inverse operation is performed, namely the data is sent through an FFT algorithm.
Continuing with this example, at this point, the bandwidth that is available is effectively chopped into sub-channels. For example, a 20 MHz channel transmitting into 52 sub-channels, results in each channel being about 300 KHz.
According to an aspect of this invention, the SDR controller (the control channel) decides how to transmit an OFDM signal as follows. The Operating System (OS) knows that it must transmit two different wireless protocols, e.g., both WiFi and Bluetooth. That is, there is a request for transmitting in one wireless mode (e.g., WiFi) and there is another request for transmitting in another wireless mode (e.g., Bluetooth). In this case, the OS recognizes that the OFDM operation has come over 52 sub-channels and each sub-channel is equivalent to approximately 300 KHz. This information is captured by the controller of the SDR and is fed to a module that indicates transmitting the non-OFDM signal (e.g., the Bluetooth signal). The system then makes sure that the Bluetooth connection is channelized to 300 KHz. In this regard, the Bluetooth is about 1 MHz of bandwidth so data is transmitted over the Bluetooth channel and each channel is a continuous 1 MHz. With regard to the OFDM signal (e.g., the WiFi signal), the signal is transmitted over 52 sub-channels and each sub-channel is approximately 380+ KHz wide (i.e., 20 MHz divided by 52 sub-channels). In this case, the Bluetooth stream is transmitting at a certain data rate of about 1 MHz, which will require approximately 3 sub-channels. That is, the stream is split it into three sub-channels. Thus, with the OFDM signal (e.g., WiFi) being transmitted over 52 sub-channels (serial to 52 parallel streams) and the non-OFDM signal (e.g., Bluetooth) being transmitted over 3 sub-channels, a total of 55 sub-channels exist.
An IFFT of the 55 sub-channels is then performed. On the receiver side, the WiFi receiver is performing 52 sub-channel FFTs and the Bluetooth receiver is performing 3 sub-channel FFTs. In this manner, the same executable module of the SDR is employed. The same hardware is available for use and the complexity of transmitting simultaneous radio is much less in this case than transmission of Bluetooth and WiFi separately.
Thus, a signal that is otherwise non-OFDM (e.g., Bluetooth) is made to appear as though it is OFDM, which can then be processed along with the OFDM signals.
If implemented in software, the signals are software combined and is processed in the same module.
It should be appreciated that the present invention is not limited to transmitting Bluetooth and WiFi; rather the invention contemplates OFDM transmission and reception of non-OFDM signals and OFDM signals. Similarly, the sub-channels available are not limited to the example provided. Rather, the maximum number of sub-channels is limited by the processor speed.
A further example is discussed below.
In one embodiment, Wi-Fi 802.11n and Bluetooth 2.1 are embedded in a laptop using SDR. That is, there is a single RF front end that is used for both communication protocols while the baseband and MAC protocol are implemented in software.
The Wi-Fi PHY implements an OFDM modulation scheme as described in co-pending U.S. patent application Ser. No. 11/637,449, titled “Cognitive Multi-User OFDMA”, filed Dec. 12, 2006 and Ser. No. 11/635,869, titled “System Capability Discovery for Software Defined Radio”, filed Dec. 8, 2006, each of which is assigned to the assignee of the present application and each of which is hereby incorporated herein by reference in its entirety. The Bluetooth device implements a form of GFSK modulation. But the Bluetooth can still be communicated in an OFDM based framework.
In OFDM the available channel bandwidth W is subdivided into a number of equal-bandwidths called sub-channels, where the bandwidth of each sub-channel is sufficiently narrow so that the frequency response characteristics of the sub-channels are nearly ideal. Such a subdivision of the overall bandwidth into smaller sub-channels is illustrated in
xk(t)=sin 2πfkt, k=0,1, . . . ,K−1 [1]
where fk is the mid-frequency in the kth sub-channel.
By selecting the symbol rate 1/T on each of the sub-channels to be equal to the separation Δf of adjacent subcarriers, the subcarriers are orthogonal over the symbol interval T, independent of the relative phase relationship between sub carriers; i.e.,
where fk−ff=n/T, n=1, 2, . . . , independent of the values of the phases ϕk and ϕj.
With an OFDM system having K sub-channels, the symbol rate on each sub carrier is reduced by a factor of N relative to the symbol rate on a single carrier system that employs the entire bandwidth W and transmits data at the same rate as OFDM. Hence, the symbol interval in the OFDM system is T=KTs, where Ts is the symbol interval in the single-carrier system.
It should be appreciated that the present invention is not limited to dividing the channel into a sub-channels of a certain width. Instead, the channel may be divided into sub-channels of narrower width than that described here. In this manner, the non-OFDM signal may determine how finely to divide the channels into appropriately sized sub-channels
The modulator and demodulator in an OFDM system are efficiently implemented by use of the FFT algorithm to compute the DFT/IDFT. The basic block diagram of the OFDM is illustrated in
Hence,
A multi-carrier modulator, as illustrated at block 22, may be viewed as generating K independent QAM sub-channels, where the symbol rate for each sub-channel is 1/T and the signal in each sub-channel has a distinct QAM constellation. Hence, the number of signal points for the i−th sub-channel is Mi=2b
The receive side is the reciprocal of transmission. The receive RF signal is intercepted by an antenna shown at 28, down converted in frequency before it is digitized by an analogue to digital converter (A/D) at block 30, multiplex from a serial stream to a parallel stream. At block 32 the prefix added in transmission is removed. An FFT is preformed, at block 34, on the parallel sequence. This followed by a detector at block 36, to decide on the bits, which is then input to a parallel to serial multiplexer, at block 38.
The complex-valued signal points corresponding the information signals on the K sub-channels may be denoted by Xk, k=0, 1, . . . , K−1. These information symbols {Xk} represent the values of the discrete Fourier transform (DFT) of a multi-carrier OFDM signal x(t), where the modulation on each subcarrier is QAM. Since x(t) must be a real-valued signal, its N-point DFT {Xk} must satisfy the symmetry property XN−k=X*k. Therefore, we create N=2K symbols from K information symbols by defining:
XN−K=X*K, k=1,2, . . . ,K−1
X′0=Re(X0)
XN=Im(X0) [4]
Note that the information symbol X0 is split into two parts, both of which are real. If the new sequence of symbols is denoted as (X′k, k=0, 1, . . . , N−1), the N-point inverse DFT (IDFT) yields the real-valued sequence:
where 1/√{square root over (N)} is simply a scale factor.
This sequence {xn, 0≤n≤N−1} corresponds to samples of the multicarrier OFDM signal x(t), consisting of K subcarriers.
Continuing with this example, at this point, the OFDM has as an input {Xn, 0≤n≤N−1} and an output {xn, 0≤n≤N−1}.
Regarding the Bluetooth modulation, the GFSK signal, which is the typical modulation protocol employed with Bluetooth, can be represented by
s(t,α)=A cos(2πfct+ϕ(t,α)), [6]
where
Eb is the energy per data bit;
fc is the carrier frequency;
α is the random input stream having data bits αi;
ϕ(t,α) is the output phase deviation, given by
In GFSK, a single bit is transmitted over multiple symbols. This may be accomplished by using a pulse shaping filter with impulse response g(t) given by
where Q(t) standard Q-function
By introducing controlled intersymbol interference, the spectral occupancy of the signal is substantially reduced.
Rewriting the above equation [7], then
where L is the length of g(t), and
For Bluetooth with BbT=0.5, L=2, which means that a single data bit is spread over two consecutive symbol intervals.
Bluetooth uses 1 MHz channelization. If an SDR is used that includes 802.11a/g/n, the sub-channels are ˜384 KHz. Therefore, three sub-channels would be sufficient to cover each Bluetooth transmission/reception. In this manner, the OFDM based cognitive radio is employed for OFDM based schemes and non-OFDM based schemes. Any loss in the non-matched filter is likely to be small.
The Bluetooth signal is multiplexed in software into three separate streams, each with ⅓rd the data rate. These streams are then input to the same OFDM modulator used to transmit the 802.11n signal.
If the bandwidth W is not divided evenly and extra bandwidth remains that cannot take up an entire sub-channel, then, in one embodiment, the remaining bandwidth can be assumed to be a power loss. In another embodiment, the bandwidth can be divided so that the sub-channels exceed the bandwidth. In this case, the extra sub-channel can be considered noise. In yet another embodiment, as described in block 70, the sub-channel can be divided into further sub-channels such that a new Δf is provided. In this manner, on the one hand, power loss is limited and on the other hand noise is limited. In the example shown, the sub-channels are divided in half, however, it should be appreciated that the sub-channels can be divided into thirds, fourths, fifths, sixths or any other divisor, as the present invention is not limited in this respect. The process then continues at block 72 with the new parameters. Without being limited to theory, as a general rule, if either a power loss or noise (that is, the remaining bandwidth) is limited to less than about 5% to 10%, then dividing the sub-channels into further sub-channels may not be necessary.
Referring again to block 66, the signals may be processed using, for example, an FFT. In one embodiment, the FFT is programmed to process each of the sub-channels for the OFDM signals. This same FFT is used to process the non-OFDM signals, however because the FFT is programmed to process the larger number of total sub-channels for the OFDM signals, when it is time to process the non-OFDM signals, some of the sub-channels are zeroed out. For example, suppose the FFT is programmed to process 52 sub-channels for the OFDM signal, then this same FFT will attempt to process 52 sub-channels for the non-OFDM signals but there may only be 3 sub-channels having signal data. Accordingly, in one embodiment, the remaining 49 sub-channels are set to zero.
In another embodiment, the FFT can be programmed to process three sub-channels, rather than the 52 sub-channels. In this example, the non-OFDM signals are efficiently processed and no zeroing occurs, but then each set of three remaining sub-channels for the OFDM signals will be processed separately, thereby requiring many more routines of the FFT.
The aspects of the present invention described herein can be implemented on any of numerous computer system configurations and are not limited to any particular type of configuration.
The computer system of
Front end radio hardware 202 may be any suitable radio hardware performing any combination of functions. These functions may include modulation (i.e., mixing a data signal into a high frequency transmission signal), filtering (i.e., parsing data out of a received signal), analog-to-digital or digital-to-analog conversion, signal generation (i.e., transmitting the data), etc. Front end 202 may be implemented to perform a minimum of the required functions that need to be performed at the hardware level, with the remaining functions being implemented by SDR drivers 216. The present function is not limited to use with systems that decide the responsibilities of the hardware and software in any particular way. Front end 202 may comprise an antenna, a programmable radio-frequency waveform generator/decoder that spans a wide radio spectrum, an array of fast analog to digital converters, and/or serializers/de-serializers to convert analog data into computer-processable bytes and vice versa. A set of tunable analog filters may also be employed to comply with mandated spectrum masks. These hardware components are merely illustrative, as invention not limited to use on systems having any particular hardware.
SDR drivers 216, in addition to performing radio functions, may transmit control instructions to the tunable circuitry of front end 202 to customize the hardware of the front end 202 according to a particular wireless protocol.
It should be appreciated that one embodiment of the invention is directed to use with a computing device having programmable circuitry (e.g., the front end hardware 202 and the SDR drivers 216) that is programmable by control instructions to generate and/or receive signals according to a wireless protocol, including, for example, the process described herein with regard to handling both OFDM and non-OFDM signals. Again, this programmable circuitry can take any suitable form and include any collection of directly programmable circuitry (e.g., a programmable processor) and circuitry that interacts with directly programmable circuitry to enable communication according to a wireless protocol.
It should be appreciated that the embodiments of the present invention described herein are not limited to being practiced with the type of computing device illustrated in
Having thus described several aspects of at least one embodiment of this invention, it is to be appreciated that various alterations, modifications, and improvements will readily occur to those skilled in the art.
Such alterations, modifications, and improvements are intended to be part of this disclosure, and are intended to be within the spirit and scope of the invention. Accordingly, the foregoing description and drawings are by way of example only.
The above-described embodiments of the present invention can be implemented in any of numerous ways. For example, the embodiments may be implemented using hardware, software or a combination thereof. When implemented in software, the software code can be executed on any suitable processor or collection of processors, whether provided in a single computer or distributed among multiple computers.
Further, it should be appreciated that a computer may be embodied in any of a number of forms, such as a rack-mounted computer, a desktop computer, a laptop computer, or a tablet computer. Additionally, a computer may be embedded in a device not generally regarded as a computer but with suitable processing capabilities, including a Personal Digital Assistant (PDA), a smart phone or any other suitable portable or fixed electronic device.
Also, a computer may have one or more input and output devices. These devices can be used, among other things, to present a user interface. Examples of output devices that can be used to provide a user interface include printers or display screens for visual presentation of output and speakers or other sound generating devices for audible presentation of output. Examples of input devices that can be used for a user interface include keyboards, and pointing devices, such as mice, touch pads, and digitizing tablets. As another example, a computer may receive input information through speech recognition or in other audible format.
Such computers may be interconnected by one or more networks in any suitable form, including as a local area network or a wide area network, such as an enterprise network or the Internet. Such networks may be based on any suitable technology and may operate according to any suitable protocol and may include wireless networks, wired networks or fiber optic networks.
Also, the various methods or processes outlined herein may be coded as software that is executable on one or more processors that employ any one of a variety of operating systems or platforms. Additionally, such software may be written using any of a number of suitable programming languages and/or conventional programming or scripting tools, and also may be compiled as executable machine language code or intermediate code that is executed on a framework or virtual machine.
In this respect, the invention may be embodied as a computer readable medium (or multiple computer readable media) (e.g., a computer memory, one or more floppy discs, compact discs, optical discs, magnetic tapes, flash memories, circuit configurations in Field Programmable Gate Arrays or other semiconductor devices, etc.) encoded with one or more programs that, when executed on one or more computers or other processors, perform methods that implement the various embodiments of the invention discussed above. The computer readable medium or media can be transportable, such that the program or programs stored thereon can be loaded onto one or more different computers or other processors to implement various aspects of the present invention as discussed above.
The terms “program” or “software” are used herein in a generic sense to refer to any type of computer code or set of computer-executable instructions that can be employed to program a computer or other processor to implement various aspects of the present invention as discussed above. Additionally, it should be appreciated that according to one aspect of this embodiment, one or more computer programs that when executed perform methods of the present invention need not reside on a single computer or processor, but may be distributed in a modular fashion amongst a number of different computers or processors to implement various aspects of the present invention.
Computer-executable instructions may be in many forms, such as program modules, executed by one or more computers or other devices. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Typically the functionality of the program modules may be combined or distributed as desired in various embodiments.
Also, data structures may be stored in computer-readable media in any suitable form. For simplicity of illustration, data structures may be shown to have fields that are related through location in the data structure. Such relationships may likewise be achieved by assigning storage for the fields with locations in a computer-readable medium that conveys relationship between the fields. However, any suitable mechanism may be used to establish a relationship between information in fields of a data structure, including through the use of pointers, tags or other mechanisms that establish relationship between data elements.
Various aspects of the present invention may be used alone, in combination, or in a variety of arrangements not specifically discussed in the embodiments described in the foregoing and is therefore not limited in its application to the details and arrangement of components set forth in the foregoing description or illustrated in the drawings. For example, aspects described in one embodiment may be combined in any manner with aspects described in other embodiments.
Also, the invention may be embodied as a method, of which an example has been provided. The acts performed as part of the method may be ordered in any suitable way. Accordingly, embodiments may be constructed in which acts are performed in an order different than illustrated, which may include performing some acts simultaneously, even though shown as sequential acts in illustrative embodiments.
Use of ordinal terms such as “first,” “second,” “third,” etc., in the claims to modify a claim element does not by itself connote any priority, precedence, or order of one claim element over another or the temporal order in which acts of a method are performed, but are used merely as labels to distinguish one claim element having a certain name from another element having a same name (but for use of the ordinal term) to distinguish the claim elements.
Also, the phraseology and terminology used herein is for the purpose of description and should not be regarded as limiting. The use of “including,” “comprising,” or “having,” “containing,” “involving,” and variations thereof herein, is meant to encompass the items listed thereafter and equivalents thereof as well as additional items.
This Application is a Continuation of and claims benefit from or priority of U.S. patent application Ser. No. 15/156,676 that was filed May 17, 2016, and that is a Continuation of U.S. patent application Ser. No. 14/256,709 (U.S. Pat. No. 9,363,120) that was filed Apr. 18, 2014 (issued Jun. 7, 2016), and that is a Continuation of U.S. patent application Ser. No. 13/153,801 (U.S. Pat. No. 8,718,211), filed Jun. 6, 2011 (issued May 6, 2014), and that is a Continuation U.S. patent application Ser. No. 11/899,248 (U.S. Pat. No. 7,970,085), filed Sep. 5, 2007 (issued Jun. 28, 2011), and that claims priority from U.S. Provisional Patent Application No. 60/928,114, filed May 8, 2007, each of which is incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
3343093 | Gerwen | Sep 1967 | A |
4210780 | Hopkins et al. | Jul 1980 | A |
5504775 | Chouly et al. | Apr 1996 | A |
5675572 | Hidejima | Oct 1997 | A |
5729535 | Rostoker | Mar 1998 | A |
5781543 | Ault | Jul 1998 | A |
5790516 | Gudmundson et al. | Aug 1998 | A |
5867478 | Baum et al. | Feb 1999 | A |
6041048 | Erickson | Mar 2000 | A |
6175550 | Van Nee | Jan 2001 | B1 |
6229471 | Herrmann | May 2001 | B1 |
6295272 | Feldman | Sep 2001 | B1 |
6304611 | Miyashita et al. | Oct 2001 | B1 |
6445773 | Liang | Sep 2002 | B1 |
6456653 | Sayeed | Sep 2002 | B1 |
6553534 | Yonge et al. | Apr 2003 | B2 |
6609039 | Schoen | Aug 2003 | B1 |
6654431 | Barton et al. | Nov 2003 | B1 |
6704072 | Whinnett | Mar 2004 | B2 |
6704572 | Whinnett et al. | Mar 2004 | B1 |
6711141 | Rinne | Mar 2004 | B1 |
6721267 | Hiben | Apr 2004 | B2 |
6726297 | Uesugi | Apr 2004 | B1 |
6728551 | Chang | Apr 2004 | B2 |
6760300 | Eberle | Jul 2004 | B1 |
6763072 | Matsui et al. | Jul 2004 | B1 |
6810006 | Michon et al. | Oct 2004 | B2 |
6870808 | Liu et al. | Mar 2005 | B1 |
6882851 | Sugar et al. | Apr 2005 | B2 |
6904283 | Li et al. | Jun 2005 | B2 |
6934246 | Park | Aug 2005 | B2 |
6934340 | Dollard | Aug 2005 | B1 |
6952454 | Jalali et al. | Oct 2005 | B1 |
6961388 | Ling et al. | Nov 2005 | B2 |
6976202 | Rezvani et al. | Dec 2005 | B1 |
6987729 | Gopalakrishnan et al. | Jan 2006 | B1 |
6990059 | Anikhindi | Jan 2006 | B1 |
7012883 | Jalali et al. | Mar 2006 | B2 |
7020071 | Mujtaba | Mar 2006 | B2 |
7020073 | Kadous et al. | Mar 2006 | B2 |
7020110 | Walton | Mar 2006 | B2 |
7035201 | Fu | Apr 2006 | B2 |
7043681 | Kroeger et al. | May 2006 | B2 |
7047032 | Yun | May 2006 | B2 |
7043023 | Watanabe et al. | Jun 2006 | B2 |
7072413 | Walton et al. | Jul 2006 | B2 |
7075967 | Struhsaker et al. | Jul 2006 | B2 |
7076246 | Chitrapu | Jul 2006 | B2 |
7126984 | Wang | Oct 2006 | B2 |
7133471 | Feher | Nov 2006 | B2 |
7139320 | Singh | Nov 2006 | B1 |
7151755 | Xu | Dec 2006 | B2 |
7151925 | Ting et al. | Dec 2006 | B2 |
7164649 | Walton et al. | Jan 2007 | B2 |
7206350 | Korobkov et al. | Apr 2007 | B2 |
7206840 | Choi et al. | Apr 2007 | B2 |
7286603 | Varshney | Oct 2007 | B2 |
7317750 | Shattil | Jan 2008 | B2 |
7324437 | Czylwik | Jan 2008 | B1 |
7333531 | Alamouti | Feb 2008 | B2 |
7356343 | Feher | Apr 2008 | B2 |
7356679 | Le | Apr 2008 | B1 |
7391815 | Lakkis | Jun 2008 | B2 |
7414964 | Hashem | Aug 2008 | B2 |
7415085 | Fujii | Aug 2008 | B2 |
7448034 | Anderson | Nov 2008 | B2 |
7450059 | Schotten | Nov 2008 | B1 |
7450559 | Schotten et al. | Nov 2008 | B2 |
7551641 | Pirzada et al. | Jun 2009 | B2 |
7623599 | McCoy | Nov 2009 | B2 |
7627048 | Larsson | Dec 2009 | B2 |
7634016 | Hassan | Dec 2009 | B2 |
7643583 | Savoj | Jan 2010 | B1 |
7643811 | Reunamaki | Jan 2010 | B2 |
7672221 | Fuji | Mar 2010 | B2 |
7672381 | Kleider | Mar 2010 | B1 |
7684473 | Walton | Mar 2010 | B2 |
7800541 | Moshfeghi | Sep 2010 | B2 |
7813701 | Strong | Oct 2010 | B2 |
7855948 | Anikhindi | Dec 2010 | B2 |
7860047 | Urushihara | Dec 2010 | B2 |
7877110 | Feher | Jan 2011 | B2 |
7920823 | Hassan | Apr 2011 | B2 |
7929623 | Hassan et al. | Apr 2011 | B2 |
7933344 | Hassan et al. | Apr 2011 | B2 |
7970085 | Hassan | Jun 2011 | B2 |
8045935 | Lakkis | Oct 2011 | B2 |
8072957 | Gross | Dec 2011 | B2 |
8166534 | Yariv et al. | Apr 2012 | B2 |
8144793 | Hassan | May 2012 | B2 |
8189621 | Hassan | May 2012 | B2 |
8228850 | McBeath | Jul 2012 | B2 |
8249001 | Oota | Aug 2012 | B2 |
8289837 | Kim | Oct 2012 | B2 |
8311140 | Feher | Nov 2012 | B2 |
8320506 | Jo | Nov 2012 | B2 |
8374130 | Hassan | Feb 2013 | B2 |
20010007552 | Schiff | Jul 2001 | A1 |
20020009158 | Souissi | Jan 2002 | A1 |
20020031189 | Hiben | Mar 2002 | A1 |
20020080902 | Kim | Jun 2002 | A1 |
20020119781 | Li | Aug 2002 | A1 |
20020136190 | Hata | Sep 2002 | A1 |
20020141446 | Koga | Oct 2002 | A1 |
20020157058 | Ariel | Oct 2002 | A1 |
20020188723 | Choi et al. | Dec 2002 | A1 |
20030015423 | LaGreca | Jan 2003 | A1 |
20030026200 | Fu et al. | Feb 2003 | A1 |
20030058786 | Sato et al. | Mar 2003 | A1 |
20030067961 | Hudson | Apr 2003 | A1 |
20030095506 | Jalali | May 2003 | A1 |
20030112880 | Walton | Jun 2003 | A1 |
20030123383 | Korobkov et al. | Jul 2003 | A1 |
20030154233 | Patterson | Aug 2003 | A1 |
20030223354 | Olszewski | Dec 2003 | A1 |
20040005010 | He et al. | Jan 2004 | A1 |
20040008618 | Shirakata et al. | Jan 2004 | A1 |
20040027997 | Terry et al. | Feb 2004 | A1 |
20040029575 | Mehta | Feb 2004 | A1 |
20040066773 | Sun | Apr 2004 | A1 |
20040073929 | Morello | Apr 2004 | A1 |
20040081121 | Xu | Apr 2004 | A1 |
20040110510 | Jeon | Jun 2004 | A1 |
20040151108 | Claret et al. | Aug 2004 | A1 |
20040151109 | Batra et al. | Aug 2004 | A1 |
20040252775 | Park | Dec 2004 | A1 |
20040252781 | Park | Dec 2004 | A1 |
20050002325 | Giannakis et al. | Jan 2005 | A1 |
20050013238 | Hassan | Jan 2005 | A1 |
20050013284 | Proctor | Jan 2005 | A1 |
20050025039 | Hwang et al. | Feb 2005 | A1 |
20050027789 | Luo et al. | Feb 2005 | A1 |
20050047259 | Ahn | Mar 2005 | A1 |
20050063345 | Wu et al. | Mar 2005 | A1 |
20050078759 | Zhang | Apr 2005 | A1 |
20050085249 | Goldstein | Apr 2005 | A1 |
20050099937 | Oh et al. | May 2005 | A1 |
20050111462 | Walton | May 2005 | A1 |
20050117661 | Kim | Jun 2005 | A1 |
20050129136 | Fujii | Jun 2005 | A1 |
20050130684 | Kim et al. | Jun 2005 | A1 |
20050141649 | Tanabe | Jun 2005 | A1 |
20050147076 | Sadowsky | Jul 2005 | A1 |
20050152466 | Maltsev et al. | Jul 2005 | A1 |
20050157805 | Walton | Jul 2005 | A1 |
20050160428 | Ayachitula | Jul 2005 | A1 |
20050180313 | Kim | Aug 2005 | A1 |
20050157670 | Tang et al. | Sep 2005 | A1 |
20050190800 | Maltsev | Sep 2005 | A1 |
20050197132 | Lee et al. | Sep 2005 | A1 |
20050226341 | Sun | Oct 2005 | A1 |
20050228850 | Zhu | Oct 2005 | A1 |
20050232208 | Hansen | Oct 2005 | A1 |
20050237989 | Ahn et al. | Oct 2005 | A1 |
20050245197 | Kadous | Nov 2005 | A1 |
20050249127 | Huo | Nov 2005 | A1 |
20050254457 | Jung | Nov 2005 | A1 |
20050281317 | Oh | Dec 2005 | A1 |
20060009209 | Rieser et al. | Jan 2006 | A1 |
20060013285 | Kobayashi | Jan 2006 | A1 |
20060034382 | Ozluturk et al. | Feb 2006 | A1 |
20060045001 | Jalali | Mar 2006 | A1 |
20060046716 | Hofstaedter et al. | Mar 2006 | A1 |
20060056283 | Anikhindi | Mar 2006 | A1 |
20060063543 | Matoba | Mar 2006 | A1 |
20060067288 | Shim | Mar 2006 | A1 |
20060078059 | Ok et al. | Apr 2006 | A1 |
20060083157 | Cheng | Apr 2006 | A1 |
20060083205 | Buddhikot | Apr 2006 | A1 |
20060083210 | Li et al. | Apr 2006 | A1 |
20060085497 | Sehitoglu | Apr 2006 | A1 |
20060087972 | Jalali | Apr 2006 | A1 |
20060094372 | Ahn | May 2006 | A1 |
20060126493 | Hashem | Jun 2006 | A1 |
20060128318 | Agarossi et al. | Jun 2006 | A1 |
20060135075 | Tee et al. | Jun 2006 | A1 |
20060154691 | Tang et al. | Jul 2006 | A1 |
20060159120 | Kim | Jul 2006 | A1 |
20060171445 | Batra et al. | Aug 2006 | A1 |
20060176973 | Alamouti | Aug 2006 | A1 |
20060176976 | Pedersen | Aug 2006 | A1 |
20060188003 | Larsson | Aug 2006 | A1 |
20060188031 | Liu | Aug 2006 | A1 |
20060193295 | White et al. | Aug 2006 | A1 |
20060211387 | Pisek et al. | Sep 2006 | A1 |
20060211395 | Waltho | Sep 2006 | A1 |
20060234752 | Mese | Oct 2006 | A1 |
20060250944 | Hong et al. | Nov 2006 | A1 |
20060269005 | Laroia et al. | Nov 2006 | A1 |
20060274820 | Walton | Dec 2006 | A1 |
20060287001 | Budampati et al. | Dec 2006 | A1 |
20070002728 | Fujii | Jan 2007 | A1 |
20070009056 | Yeon et al. | Jan 2007 | A1 |
20070016413 | Seo et al. | Jan 2007 | A1 |
20070032220 | Fehrer | Feb 2007 | A1 |
20070055501 | Aytur et al. | Mar 2007 | A1 |
20070058583 | Cho | Mar 2007 | A1 |
20070078924 | Hassan et al. | Apr 2007 | A1 |
20070086420 | Schotten | Apr 2007 | A1 |
20070087772 | Yi | Apr 2007 | A1 |
20070091720 | Woo | Apr 2007 | A1 |
20070105576 | Gupta | May 2007 | A1 |
20070115878 | Ashish | May 2007 | A1 |
20070116137 | McCoy | May 2007 | A1 |
20070133387 | Arslan | Jun 2007 | A1 |
20070140102 | Oh | Jun 2007 | A1 |
20070189162 | Song | Aug 2007 | A1 |
20070189205 | Terry | Aug 2007 | A1 |
20070201503 | Nishio | Aug 2007 | A1 |
20070248173 | Hassan | Oct 2007 | A1 |
20070263653 | Hassan | Nov 2007 | A1 |
20080002733 | Sutskover | Jan 2008 | A1 |
20080014880 | Hyon | Jan 2008 | A1 |
20080057869 | Strong | Mar 2008 | A1 |
20080070610 | Nishio | Mar 2008 | A1 |
20080089279 | Hu | Apr 2008 | A1 |
20080095135 | Cleveland | Apr 2008 | A1 |
20080112518 | Wilhelmsson | May 2008 | A1 |
20080137634 | Hassan | Jun 2008 | A1 |
20080165671 | Larsson | Jul 2008 | A1 |
20080232340 | Wan et al. | Sep 2008 | A1 |
20080232490 | Gross | Sep 2008 | A1 |
20080253400 | Carroll | Oct 2008 | A1 |
20080279291 | Hassan | Nov 2008 | A1 |
20090086706 | Huang | Apr 2009 | A1 |
20090109914 | McBeath | Apr 2009 | A1 |
20090190535 | Hassan | Jul 2009 | A1 |
20090262849 | Jo | Oct 2009 | A1 |
20090285174 | Haga | Nov 2009 | A1 |
20100040167 | Aoki | Feb 2010 | A1 |
20100165956 | Razzell | Jul 2010 | A1 |
20100173586 | McHenry | Jul 2010 | A1 |
20100208852 | Feher | Aug 2010 | A1 |
20110116360 | Wu et al. | May 2011 | A1 |
20110173485 | Hassan | Jul 2011 | A1 |
20110235732 | Hassan | Sep 2011 | A1 |
20110310930 | Gerhardt | Dec 2011 | A1 |
20120128034 | Fehrer | May 2012 | A1 |
20120182875 | Hassan | Jul 2012 | A1 |
20120201317 | Hassan | Aug 2012 | A1 |
20120207233 | Hassan | Aug 2012 | A1 |
20140376657 | Agee | Dec 2014 | A1 |
20150180921 | Hassan | Jun 2015 | A1 |
20160309359 | Hassan | Oct 2016 | A1 |
Number | Date | Country |
---|---|---|
1462523 | Dec 2003 | CN |
1468486 | Jan 2004 | CN |
1675940 | Sep 2005 | CN |
1723676 | Jan 2006 | CN |
1874334 | Dec 2006 | CN |
1 156 598 | Nov 2001 | EP |
1 199834 | Apr 2002 | EP |
1 408 710 | Apr 2004 | EP |
1480400 | Nov 2004 | EP |
1 560 344 | Aug 2005 | EP |
1 571 773 | Sep 2005 | EP |
1578 162 | Sep 2005 | EP |
08-047036 | Feb 1996 | JP |
2001-230744 | Aug 2001 | JP |
2001-285236 | Jun 2004 | JP |
2004-158965 | Jun 2004 | JP |
2004-172907 | Jun 2004 | JP |
2004-274103 | Sep 2004 | JP |
2004-350326 | Dec 2004 | JP |
2005-086479 | Mar 2005 | JP |
2005-167502 | Jun 2005 | JP |
2005-244997 | Sep 2005 | JP |
2005-260921 | Sep 2005 | JP |
2006-157890 | Jun 2006 | JP |
2006-287344 | Oct 2006 | JP |
1020050052 | Jun 2005 | KR |
505658 | Feb 2003 | NZ |
2180159 | Feb 2002 | RU |
2219665 | Dec 2003 | RU |
2237977 | Oct 2004 | RU |
2298878 | May 2007 | RU |
583854 | Apr 2004 | TW |
1256789 | Jun 2006 | TW |
1257779 | Jul 2006 | TW |
9623371 | Aug 1996 | WO |
9814026 | Apr 1998 | WO |
0074415 | Dec 2000 | WO |
0232161 | Apr 2002 | WO |
0233911 | Apr 2002 | WO |
0233925 | Apr 2002 | WO |
0249306 | Jun 2002 | WO |
02062002 | Aug 2002 | WO |
02-093839 | Nov 2002 | WO |
03088602 | Oct 2003 | WO |
2004025870 | Mar 2004 | WO |
2004042987 | May 2004 | WO |
2004075499 | Sep 2004 | WO |
2005004500 | Jan 2005 | WO |
2005060192 | Jun 2005 | WO |
2005066914 | Jul 2005 | WO |
2005125250 | Dec 2005 | WO |
2006004466 | Jan 2006 | WO |
2006006602 | Jan 2006 | WO |
2007062754 | Jun 2007 | WO |
2005076557 | Aug 2007 | WO |
2007108077 | Sep 2007 | WO |
Entry |
---|
“Office Action Issued in Indian Patent Application No. 6090/CHENP/2009”, dated Aug. 23, 2017, 6 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 11/899,248”, dated Oct. 27, 2010, 8 Pages. |
“Notice of Allowance Issued in U.S. Appl. No. 11/899,248”, dated Feb. 22, 2011, 7 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 13/153,801”, dated Aug. 23, 2012, 6 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 13/153,801”, dated Jun. 6, 2013, 4 Pages. |
“Notice of Allowance Issued in U.S. Appl. No. 13/153,801”, dated Jan. 18, 2013, 5 Pages. |
“Notice of Allowance Issued in U.S. Appl. No. 13/153,801”, dated Apr. 23, 2013, 6 Pages. |
“Notice of Allowance Issued in U.S. Appl. No. 13/153,801”, dated Sep. 30, 2013, 6 Pages. |
“Notice of Allowance Issued in U.S. Appl. No. 13/153,801”, dated Dec. 18, 2013, 6 Pages. |
“Notice of Allowance Issued in U.S. Appl. No. 13/153,801”, dated Mar. 6, 2014, 2 Pages. |
“Final Office Action Issued in U.S. Appl. No. 14/256,709”, dated Jun. 23, 2015, 10 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 14/256,709”, dated Sep. 3, 2015, 12 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 14/256,709”, dated Jan. 9, 2015, 9 Pages. |
“Notice of Allowance Issued in U.S. Appl. No. 14/256,709”, dated Feb. 10, 2016, 12 Pages. |
“Non-Final Office Action Issued in U.S. Appl. No. 15/156,676”, dated Nov. 18, 2016, 10 Pages. |
“Notice of Allowance Issued in U.S. Appl. No. 15/156,676”, dated May 1, 2017, 7 Pages. |
“Notice of Allowance Issued in U.S. Appl. No. 15/156,676”, dated Jun. 28, 2017, 2 Pages. |
Chang, “Synthesis of Band-Limited Orthogonal Signals for Multichannel Data Transmission”, The Bell System Technical Journal, Aug. 4, 1966. |
CA Office Action for Application No. 2,672,103, dated Nov. 6, 2014. |
MX Office Action for Application No. MX/a/2009/006317, dated Mar. 9, 2011, Communicated to US Counsel dated Apr. 4, 2011. |
MY Substantive Examination Adverse Report for Application No. PI 20092035, dated May 29, 2015. |
Sari, “Orthogonal Frequency-Division Multiple Access and its Application to CATV Networks”, European Transactions on Telecommunications, Nov. 1998. |
CN Decision on Reexamination for Application No. 200880125896.9, dated Sep. 29, 2015. |
Written Opinion from International application No. PCT/US2007/011642, Search dated Sep. 28, 2007. |
Written Opinion from International Application PCT/US2007/010021, search dated Oct. 17, 2007. |
Youngblood, “A Sortware-Defined Radio for the Masses, Part 1,” Jul./Aug. 2002, pp. 1-9. |
Goeckel, “Coded Modulation With Non-Standard Signal Sets for Wireless Based OFDM”, IEEE, pp. 791-795, 1999. |
Bletsas et al., “Efficient Collaborative (Viral) Communication in OFDM Based WLANs”, Media laboratory, MIT, {aggelos,lip}@media.miy.edu, 2003. |
Goekel et al., “On the Design or Multidimentional Signal Sets for OFDM Systems”, IEEE, vol. 50 No. 3, pp. 442-452, Mar. 2002. |
Sereni et al., “A Software Radio OFDM Transceiver for WLAN Applications”, Electronic and Information Engineering Department (DIEI)—University of Perugia—Italy, pp. 1-14, Apr. 2001. |
EPO Application 08747424.3; Extended European Search Report; dated Aug. 22, 2012. |
Rhee, W., “Increase in Capacity of Multiuser OFDM System Using Dynamic Subchannel Allocation”, VTC 2000—Spring; 2000 IEEE 51st Vehicular Technology Conference Proceedings; Tokyo Japan, May 15-18, 2000, [IEEE Vehicular Technology Conference, New York, NY: IEEE, US, vol. CONF. 51, May 15, 2000 (May 15, 2000), pp. 1085-1089, XP000968037; DOI: 10.1109/VETECS.2000.851292; ISBN: 978-0-7803-5719-8. |
CN Notice on the Second Office Action for Application No. 200780016912.6, dated Jan. 7, 2013. |
CN Notice on the Second Office Action for Application No. 200780045500.5, dated Nov. 9, 2012. |
CN Notice on the First Office Action for Application No. 200780016912.6, dated Mar. 31, 2012. |
CN Notice on the First Office Action for Application No. 200880015382.8, dated Jun. 5, 2012. |
JP Notice of Reason lor Rejection for Application No. 2009-507775, dated Mar. 21, 2012. |
JP Notice of Reason for Rejection for Application No. 2009-509894, dated Mar. 21, 2012. |
CN Notice on the Second Office Action for Application No. 200880015382.8, dated Feb. 8, 2013. |
CN Decision on Rejection for Application No. 200780045500.5, dated Feb. 5, 2013. |
CN Notice on the Second Office Action for Application No. 200880125896.9, dated Dec. 19, 2012. |
EP Communication for Application No. 07777062.6-1854/2018718 PCT/US2007011642, Reference FB20744, dated Mar. 8, 2013. |
EP Communication for Application No. 08747424.3-1505, Reference FB22296, dated Apr. 10, 2013. |
JP Notification of Reason for Rejection for Application No. 2010-544299, dated Apr. 18, 2013. |
TW Search Report for Application No. 096114706, dated Mar. 14, 2013. |
KR Notice of Preliminary Rejection and Reasons for Rejection for Application No. 10-2008-7025732, Reference No. 316361.13, dated Jun. 30, 2013. |
CN Decision on Rejection for Application No. 200880125896.9, Summary of the Final Rejection included, dated Jul. 29, 2013. |
JP Notification of Reason for Rejection for Application No. 2010-544299, Drafting dated Jul. 29, 2013. |
JP Office Action for Application No. 2009-541463, dated Jul. 19, 2013. |
CN Notice on the Third Office Action for Application No. 200880015382.8, Summary of the Third Office Action included, dated Aug. 22, 2013. |
EP Summons to attend oral proceeding for Application No. 08747424.3-1505/2143222, Reference FB22296, Sep. 9, 2013. |
Brodersen,et al., “Corvus: a cognative radio approach for usage of virtual unlicensed spectrum.” Online: http://www.tkn.tu-berlin.de/publications/papers/CR_White_paper_final_.pdf, 2004. |
Cabric, et al., “A Cognative Radio Approach for Usage of Virtual Unlicensed Spectrum,” In Proc. of 14th IST Mobile Wireless Communications Summit 2005, Dresden, Germany, Jun. 2005, 4 pages unnumbered. |
Chiani, et al., “Ultra Wide Bandwidth Communications towards Cognitive Radio,” EMC Europe Workshop, Rome, Italy. 2005. pp. 114-117. |
International Search Report from International Application No. PCT/US2007/010020, Search dated Nov. 5, 2007. |
International Search Report from International Application No. PCT/US2007/085556, Search dated Mar. 26, 2008. |
International Search Report from International Application No. PCT/US2007/011642, Search dated Sep. 28, 2007. |
International Search Report from International Application No. PCT/US2007/010021, Search dated Oct. 17, 2007. |
“About SDR Technology,” http://www.sdrforum.org/pages/aboutSdrTech/aboutSdrTech.asp, 1 pg. 2007. |
“Orthogonal Frequency Division Multiple Access,” Wikipedia Online Encyclopedia; retrieved from http://en.wikipedia.org/wiki/ofdma, published Nov. 25, 2006, downloaded on Dec. 12, 2006, pp. 1-3. |
“Software Defined radio,” http://www.wipro.com/webpages/insights/softwareradio.htm, 1 page, 2007. |
“Software Defined Radio”, http:///www.altera.com/end-markets/wireless/software/sdr/wir-sdr.html, 4 pages, 2007. |
Atarashi, H., “Broadband packet wireless access appropriate for high-speed and high-capacity throughput,” Vehicular Technology Conference, 2001, pp. 556-570, vol. 1, Issue 2001. |
Baumgarter, et al., “Performance of Forward Error Correction for IEEE 802.16,” 10th International OFDM Workshop, Hamburg, Germany, Aug. 2005. |
Johnsson, “HiperLAN/2—The Broadband Radio Transmission Technology Operating in the 5 GHz Frequency Band,” HiperLan/2 Global Forum, 1999, Version 1.0. |
Krenik, et al., “Cognitive Radio Techniques for Wide Area Networks,” Annual ACM IEEE Design Automation Conference, Proceedings of the 42nd Annual Conference on Design Automation, 2005, pp. 409-412, San Diego, USA, ISBN: 1-59593-058-2. |
Lawrey, et al., “Adaptive Frequency Hopping for Multiuser OFDM,” Second International Conference on Information, Communications & Signal Processing, ICICS '99, Singapore, Dec. 7-10, 1999. |
CN Notice on Reexamination for Application No. 200780045500.5, dated May 4, 2015. |
EP Communication for Application No. 08 871 573.5-1851, Reference FB23204, dated Nov. 12, 2015. |
IN First Examination Report for Application No. 5118/CHENP/2008, dated Oct. 16, 2015. |
CN Notice on Reexamination for Application No. 200780045500.5, dated Dec. 26, 2014. |
CA Office Action for Application No. 2,646,967, dated Jul. 11, 2014. |
CN Notice on the Fourth Office Action for Application No. 200880015382.8, dated Mar. 14, 2014. |
KR Notice of Preliminary Rejection for Application No. 10-2009-7014172, dated Nov. 25, 2013. |
Zhang, “Adaptive OFDM System Design for Cognitive Radio,” In: 11th International OFDM—Workshop, Aug. 30-31, 2006, Hamburg, Germany, pp. 91-95, IEEE Communications Society. |
EP Communication for Application No. 07854775.9-1860 /2127144 PCT/US2007085556, Reference EP65237TE900kap, dated May 12, 2014. |
Kivanc, “Subcarrier Allocation and Power Control for OFDMA”, Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers, Oct. 29-Nov. 1, 2000. |
EP Communication for Application No. 08871573.5-1851 /2232804 PCT/US2008087860, Reference FB23204, dated Jun. 18, 2014. |
Akyildiz, “NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey”, Computer Networks, Elsevier Science Publishers, May 17, 2006. |
Fujii, “Multicarrier Assignment with Random pulse for Multicarrier High Speed Decentralized Wireless LAN”, The 8th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, 1997, Waves of the Year 2000, (PIMRC '97), Sep. 1-4, 1997. |
EP Communication for Application No. 07794366.0-1860 / 2011296 PCT/US200701 0020, Reference FB20700, dated Apr. 8, 2014. |
Kivanc, “Computationally Efficient Bandwidth Allocation and Power Control for OFDMA”, IEEE Transactions on Wireless Communications, vol. 2, No. 6, Nov. 2003. |
Yin, “An Efficient Multiuser Loading Algorithm for OFDM-based Broadband Wireless Systems”, Proceedings of the Global Telecommunications Conference, Nov. 27-Dec. 1, 2000. |
Alonistioti, “End-to-End Reconfigurability”, An Integrated Project in European Union's 6th Framework Program, Aug. 17, 2005. |
AU Examiner's First Report on Patent Application No. 2007243348, Reference 30652319/DBW, dated May 24, 2010. |
AU Examiner's First Report on Patent Application No. 2007333404, Reference 30781604/DBW, dated Aug. 18, 2010. |
Bard, “Joint Tactical Radio System”, Space Coast Communication Systems, Inc., Sep. 9, 2003. |
Bourse, “End-to-end Reconfigurability (E2R). Enabling Interoperability, Management and Control of Complex Heterogeneous Systems”, Oct. 25, 2005. |
CN Notice on the First Office Action for Application No. 200780015172.4, dated Dec. 30, 2010. |
CN Notice on the First Office Action for Application No. 200780045500.5, dated Jan. 31, 2012. |
CN Notice on the First Office Action for Application No. 200880125896.9, dated Aug. 27, 2012. |
JP Notice of Rejection for Application No. 2009-541463, dated Oct. 19, 2012. |
PCT International Search Report and Written Opinion for Application No. PCT/US2008/087860, Reference 321714.02 WO, dated May 21, 2009. |
Schiphorst, “A Bluetooth-enabled HiperLAN/2 receiver”, Proceedings of the IEEE 58th Vehicular Technology Conference, Oct. 6-9, 2003. |
Sgandurra, “Achieving SCA Compliance for COTS Software Defined Radio”, Pentek Inc. Apr. 11, 2006. |
Tejera, “Subchannel Allocation in Multiuser Multiple Input Multiple Output Systems”, IEEE Transactions on Information Theory, Jul. 4, 2006. |
RU Office Action for Application No. 2008142379, dated Feb. 11, 2011, Communicated to US Counsel dated Feb. 16, 2011. |
KR Notice of Preliminary Rejection for Application No. 10-2008-7027267, dated Jul. 30, 2013. |
MX Office Action for Application No. MX/a/2008/014240, dated Mar. 10, 2011, Communicated to US Counsel dated May 19, 2011. |
RU Office Action for Application No. 2008144587, dated Apr. 4, 2011, Communicated to US Counsel dated Apr. 7, 2011. |
RU Office Action for Application No. 2008144587, dated Dec. 7, 2010, Communicated to US Counsel dated Dec. 10, 2010. |
TW Search Report for Application No. 097150662, dated Dec. 20, 2013. |
KR Notice of Preliminary Rejection for Application No. 10-2014-7000529, dated Feb. 10, 2014. |
EP Provision of the Minutes for Application No. 08 747 424.3-1505, Reference FB22296, dated Feb. 14, 2014. |
EP Decision to Refuse for Application No. 08747424.3-1505, Reference FB22296, dated Feb. 14, 2014. |
JP Secondary Office Action for Application No. 2009-541463, dated Dec. 3, 2013. |
EP Summons to Attend Oral Proceedings for Application No. 08747424.3-1505 12143222, Reference FB22296, Jan. 17, 2014. |
TW Search Report for Application No. 096116940, dated Sep. 8, 2010. |
AU Examiner's First Report for Application No. 2007243349, Reference 306552961DBW, dated Jul. 12, 2010. |
CN Notice on the Second Office Action for Application No. 200780015143.8, dated Jul. 3, 2013. |
CN Decision on Reexamination for Application No. 200780015143.8, dated Mar. 28, 2013. |
CN Notice on the First Office Action for Application No. 200780015143.8, dated Jan. 24, 2011. |
EP Communication and Search Report for Application No. 07794367.8-1860 / 2011297 PCT/US200701 0021, Reference FB20668, dated May 12, 2014. |
RU Office Action for Application No. 2008142422, dated Jan. 19, 2011, Communicated to US Counsel dated Jan. 24, 2011. |
CA Office Action for Application No. 2,646,622, dated Jul. 21, 2014. |
JP Notice of Rejection for Application No. 2009-507776, dated Mar. 25, 2010. |
PCT International Search Report and Written Opinion for Application No. PCT/US2008/062321, dated Sep. 18, 2008. |
Li, et al., “Clustered OFDM with Channel Estimation for High Rate Wireless Data,” IEEE, Nov. 15-17, 1999, pp. 43-50. |
Mitola, III, et al., “Cognitive Radio an Integrated Agent Architecture for Software Defined Radio,” Royal Institute of Technology (KTH), Teleinformatics Electrum 204, SE-164 40 Kista Sweden, pp. title page through 304, May 8, 2000. |
Mitola, et al., Abstract from “Cognitive Radio: Making Software Radios More Personal,” Personal Communications, IEEE, Aug. 1999, vol. 6, Issue 4, pp. 13-18, Stockholm, Sweden, ISSN: 1070-9916. |
Okada, et al., “Pre-DFT Combining space Diversity Assisted COFDM,” IEEE Transactions on Vehicular Technology, vol. 50, No. 2, pp. 487-496, Mar. 2001. |
Pottie, “Wireless Multiple Access Adaptive Communications Techniques,” Online, http://www.ee.ucla.edu/-pottie/papers/encyc1.pdf, 1999. |
Written Opinion from International Application No. PCT/US2007/085556, Search dated Mar. 26, 2008. |
Written Opinion from International Application No. PCT/US2007/010020, Search dated Nov. 5, 2007. |
Wong, et al., “Multiuser OFDM with Adaptive Subcarrier, Bit, and Power Allocation,” IEEE Journal on Selected Areas in Communications, vol. 17, No. 10, Oct. 1999, pp. 1747-1758. |
Wang, et al., “Complex-Field Coding for OFDM Over Fading Wireless Channels,” IEEE Transactions on Information Theory, Mar. 2003, pp. 707-720, vol. 49, No. 3. |
Wahlqvist, et al., “A Conceptual Study of OFDM-based Multiple Access Schemes,” Telia Jun. 5, 1996. http://www.es.1th.se/home/oes/pdfs/etsi1.pdf. |
Tewfik, et al., “High Bit Rate Ultra-Wideband OFDM,” Global Telecommunications Conference, 2002. GLOBECOM apos;02. IEEE, Nov. 2002, pp. 2260-2264, vol. 3. |
Xiaoming She, et al., “Adaptive Turbo Coded Modulation for OFDM Transmissions,” Communication Technology Proceedings, 2003. ICCT 2003, Apr. 9-11, 2003, pp. 1491-1495, vol. 2, Beijing China. |
Indian Patent Office, Author unknown, IN Notice of Allowance for Application No. 5117/CHENP/2008, 2 pages, dated Mar. 24, 2017, India. |
Indian Patent Office, Author unknown, IN Hearing Notice in Reference of Application No. 5118/CHENP/2008, 1 page, dated May 17, 2017, India. |
Norwegian Intellectual Property Office, Author Arlindo Bengui Andre, NO Search Report for Application No. 20084086, 2 Pages, dated Feb. 4, 2017, Norway. |
Indian Patent Office, Author unknown, IN Second Examination Report for Application No. 5117/CHENP/2008, 2 pages, dated Dec. 19, 2016, India. |
Chinese State Intellectual Property Office, Author unknown, CN Notice on Grant of Patent Right for Invention for Application No. 200880015382.8, pp. 1-2, dated Sep. 28, 2014, China. |
Chinese Patent Office, Author unknown, CN Notice on Grant of Patent Right for Invention for Application No. 200880125896.9, pp. 1-2, dated Jul. 26, 2016, China. |
Number | Date | Country | |
---|---|---|---|
20170373897 A1 | Dec 2017 | US |
Number | Date | Country | |
---|---|---|---|
60928114 | May 2007 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15156676 | May 2016 | US |
Child | 15683694 | US | |
Parent | 14256709 | Apr 2014 | US |
Child | 15156676 | US | |
Parent | 13153801 | Jun 2011 | US |
Child | 14256709 | US | |
Parent | 11899248 | Sep 2007 | US |
Child | 13153801 | US |