Wireless connections between computing devices have become increasingly common as computing devices have become more mobile. As a result, wireless connections are now used in a variety of ways. For example, wireless communication allows computing devices to connect to hard-wired networks though access points so that devices brought within range of the access point can access network resources, such as servers and printers. Wireless communication also allows computing devices to connect to other computing devices on an ad hoc basis so that the devices may exchange data without any fixed infrastructure.
To establish a wireless connection between two computing devices, a portion of a frequency spectrum is used to carry radio frequency signals between the devices according to a wireless communication protocol. Many wireless communication protocols divide an available frequency spectrum into multiple channels such that multiple computing devices may transmit data at the same time and minimize interference with each other.
Orthogonal Frequency Division Multiplexing (OFDM) is one communication protocol, used in both wireless and wired networks, in which a frequency spectrum is divided into multiple channels. In OFDM, channels are further divided into usually equal sub-channels, each with a relatively narrow bandwidth. By using sub-channels of narrow bandwidth, communications are less susceptible to detrimental multipath fading or other electromagnetic interference and the risk of narrow band interference between nearby devices communicating through wireless connections is reduced, which can lead to higher data rates or improved error rate performance of data transmitted over a channel.
Wireless and wired communication between computing devices is improved by using a set of selected sub-channels. The sub-channels may be selected from anywhere in a frequency spectrum usable by the computing devices for communication.
Sub-channels may be selected based on measurements of the characteristics of those sub-channels. To improve the efficiency with which the sub-channels are selected, a cognitive process may be used. A cognitive process according to the invention may be applied in a mobile computing device to prolong the operating time available from a battery or other limited power source.
A cognitive process may base the selection of sub-channels on current measurement of sub-channel characteristics and previously obtained information. Information used for cognitive processing may include information about sub-channels previously selected to establish a connection, whether by the same computing device or another computing device. Such information may also include information about sub-channels previously determined to be unsuitable for use in establishing a channel.
In one illustrative embodiment of the invention, a subset of suitable sub-channels is selected from a set of sub-channels, wherein the subset is selected from anywhere in the set and the sub-channels are not restricted to being contiguous. Sub-channel suitability may be determined by any suitable technique, including examining the sub-channel for signals generated by another computing device or for high levels of electromagnetic interference from other sources. Techniques are also employed for selection of sub-channels to be examined, which may also be done in any suitable manner, including maintaining a list of previously-used sub-channels to be examined first, sequentially scanning through a list of sub-channels, and randomly selecting sub-channels.
In a further illustrative embodiment, a method of operating a computing device for communication using a (FDM) Frequency Division Multiplexing protocol is provided. The method comprises: selecting a first plurality of selected sub-channels to carry a signal having a first bandwidth, the first plurality being selected from a second plurality of sub-channels, the second plurality collectively having a second bandwidth, the second bandwidth greater than the first bandwidth; and communicating the signal using the first plurality of selected sub-channels.
In another illustrative embodiment, a computer apparatus comprising at least one computer readable medium encoded with instructions for execution on a computer is provided. The instructions, when executed, perform a method comprising: determining a set of usable sub-channels in a first plurality of sub-channels; selecting a second plurality of selected sub-channels, the selected sub-channels being selected from the set of usable sub-channels, the second plurality being less than the first plurality: and communicating the signal over the second plurality of selected sub-channels.
In one illustrative embodiment, a method of communicating between a first computing device and a second computing device is provided. The method comprises: with the first computing device, selecting a plurality of selected sub-channels to carry a signal having a first bandwidth, the selected sub-channels being selected from a plurality of sub-channels, the plurality of sub-channels collectively having a second bandwidth, the second bandwidth greater than the first bandwidth: and transmitting at least one message over the plurality of selected sub-channels.
In the drawings:
Applicants have appreciated that both wireless and wired communication between computing devices may be improved by forming channels from sub-channels of a frequency spectrum without regard to whether the sub-channels are contiguous or non-contiguous.
Conventional implementations of Orthogonal Frequency Division Multiplexing (OFDM) use only contiguous sub-channels within a given range of frequencies to carry a transmitted signal. If that signal is subject to electronic interference or there are many devices using that same range of frequencies to communicate, many of the sub-channels intended to carry the signal may be unsuitable for communication. Because a computing device is restricted in which sub-channels can be used to carry a signal, the resulting signal may not support communication at a desired data rate and the computing devices may have to lower the data rate of transmissions over a channel when spectrum conditions are not ideal.
By selecting sub-channels from any portion of the spectrum available for communication between computing devices, contiguous or non-contiguous, to construct a signal for use by the computing device, transmission may be achieved at higher data rates regardless of spectrum conditions.
Sub-channels may be efficiently selected using a cognitive process. By learning which sub-channels are suitable or unsuitable for use, the time and processing cost of selection processes may be reduced. In some embodiments, the cognitive process is used within a mobile computing device operating from a battery or other limited power source. Reducing processing cost results in a decreased power drain, which prolongs operating time of the device until the batteries must be replaced or recharged. The user's experience may thus be improved by providing communication at faster data rates without an unacceptable power drain.
In view of the foregoing, one embodiment of the present invention is directed to a cognitive process for choosing suitable sub-channels of an FDM protocol. Such a process may be implemented on any of numerous computer system configurations, which are not limited to any particular type of configuration.
The computer system of
The embodiments of the invention described herein are not limited to being practiced with the exemplary system shown in
In addition, it should be appreciated that the invention is not limited to being performed in the exemplary wireless network shown in
Computing device 200 comprises a wireless interface, which may serve as a wireless network interface. In the embodiment illustrated, the wireless network interface may be implemented with radio hardware 202 to communicate wirelessly, such as with a wireless access point or with other devices. Device 200 also comprises a network adapter 204 to communicate over a computer network using other (possibly non-wireless) methods, a display adapter 206 to display information to a user of the device, and an input adapter 208 to receive commands from the user. In some embodiments of the invention, computing device 200 may also comprise a battery 220.
Device 200 further comprises computer-readable media 212 for storing data to be processed and/or instructions to be executed by a processor 210. Processor 210 enables processing of data and execution of instructions. The data and the instructions may be stored on the computer-readable media 212 and, for example, may enable communication between components of the computing device 200. The data and instructions may comprise an operating system 216, which may in turn comprise control software 214. Control software 214 may comprise computer-executable instructions that control transmitting and receiving data wirelessly using any suitable protocol including OFDM protocols. Computer-readable media 212 may further have stored thereon computer-executable instructions comprising applications 218 for execution on computing device 200. Applications 218 may, for example, be used by a user of the computing device to use components of the computing device to carry out various functions and complete desired operations.
It should be appreciated that the invention is not limited to being practiced with the type of computing device illustrated in
In some embodiments of the invention, multiple computing devices such as computing device 200 may transmit data over a limited number of sub-channels. Computing devices may, therefore, select sub-channels that are suitable for communication. This selection may be done in any manner, examples of which are discussed in further detail below. Once a computing device has selected a sub-channel or sub-channels for transmission, the device may “reserve” these sub-channels for its use in transmitting data, to prevent other computing devices from transmitting data over the sub-channel and thereby interfering with communication. In some embodiments, the sub-channels may be reserved for the computing device for a single, discrete data transfer, and thus the sub-channel selection and reservation process may be repeated every time a data transfer is to be made. In alternative embodiments, the sub-channels may be reserved by the computing device for multiple discrete data transfers comprising a communication session, and the sub-channel selection and reservation process repeated at the start of every session. In some embodiments, the selection process may also be executed during a data transfer or during a communication session, for example, if a higher data rate is desired and thus more sub-channels are needed or if one or more sub-channels become unsuitable for communication during a data transfer or session. It should be appreciated that the invention is not limited to performing the selection process at a set time or under set conditions, as the selection and reservation of sub-channels may be done in any suitable manner at any suitable time in the communication process.
Once the computing device is finished communicating data over the sub-channels, the selected sub-channels that had been previously reserved for communication by the device may be released by the device so that other devices may make use of them. This release may happen at the end of a single data transfer, or at the end of a communication session. In some embodiments, this release may also be executed during a data transfer or communication session if the computing device desires a lower data rate. A lower data rate may be desired, for example, if a receiving device indicates that the data is being transmitted at too high a data rate for the receiving device to process the data appropriately.
In act 302, an application on a device A requests a connection at a desired data rate. It is then determined that to transmit data at the desired rate, two sub-channels are necessary, and the spectrum is examined for two suitable sub-channels. In act 304, device A selects two suitable sub-channels 1 and 2 from the spectrum and reserves them for its use. It may also, in some embodiments, store an indication that these two sub-channels were selected for use.
In act 308, an application on device B requests a connection at a certain data rate, and it is again determined that two sub-channels are necessary to achieve this desired rate. While device A begins transmitting data in act 306, device B is examining the spectrum and identifies sub-channels 4 and 5 as suitable for communication. In act 312 device B selects and reserves these sub-channels for communication. In some embodiments of the invention, device B may have received a notification message from device A indicating that sub-channels 1 and 2 had been reserved by device A for communication, and in some embodiments device B may have detected device A's transmission on those sub-channels and identified them as unsuitable because they were being used. In act 310, device A completes its transmission of data and releases the sub-channels, making them suitable for communication by any devices in the network, and in act 314, device B begins transmitting data over sub-channels 4 and 5.
In act 316, an application on device A requests a connection be established at a certain data rate, and it is again determined that transmission of data at that rate requires two sub-channels. Device A begins examining the spectrum for suitable sub-channels, determines that sub-channels 1 and 3 are suitable, and in act 318 selects and reserves sub-channels 1 and 3. In some embodiments of the invention, device A may have examined sub-channels 1 and 2 prior to examining sub-channel 3 because it had previously selected these sub-channels as suitable for transmission. Device A may have determined during its examination that sub-channel 2 was no longer suitable for transmission because of interference—from another computing device transmitting data over the sub-channel or from any other electronic noise—and therefore examined and selected sub-channel 3. In alternative embodiments, sub-channels 1 and 3 may have been randomly examined for suitability and subsequently selected. It should be appreciated that embodiments of the invention are not limited to selecting sub-channels according to any specific technique or techniques, as sub-channel selection may be implemented in any suitable manner.
The process of
Sub-channels may be selected in any suitable way. For example, in the illustrative embodiment of
The loop of the illustrative process of
Until an end condition is met, the process of
It should be appreciated that information may be obtained at act 408 in any suitable manner. In the illustrated process, information is obtained by monitoring energy in the sub-channel over a predetermined interval as one form of “listening” on the sub-channel. In some embodiments, the computing device will tune its hardware to the sub-channel being examined and use a receiver in the hardware to collect data on the energy in that sub-channel for a predetermined period of time. Data may be collected in any suitable form, including peak energy levels, average energy levels, median energy levels, etc. In this embodiment, listening may comprise detecting energy levels on the sub-channel to provide as input to the acts of determination, or may comprise receiving (or attempting to receive) data from the sub-channel. In other embodiments, the computing device may sample the entire spectrum at least once, and, through performing examination steps such as a Fourier Transform on the sample, determine energy levels present in multiple sub-channels. It should be appreciated, however, that these techniques are merely exemplary, and any suitable technique for examining a sub-channel or sub-channels may be used in accordance with embodiments of the invention.
If a desired number of sub-channels is selected from the spectrum (the second end condition discussed above), then the process branches from act 406 to act 418, where an indication of the selected sub-channels is stored on the computing device. The indication may be formatted as a list or as any other suitable data structure. The list (for example) could be stored in temporary storage on the computing device for use in transmission, or could be stored in long-term storage for use in future transmissions.
In act 420, the computing device transmits a notification message comprising the list of sub-channels to one or more other computing devices. In some embodiments of the invention, this notification message may serve to reserve the selected sub-channels for use by the computing device until the sub-channels are later released by the computing device. The other computing devices may comprise another computing device acting as another end point of the connection that is to receive the data to be transmitted by the computing device, or could comprise all other computing devices in range of the computing device. In some embodiments of the invention, the transmission of act 420 will be done over a control frequency listened to by all devices using a specified protocol. Beacon signals may be transmitted using this control frequency, and in some embodiments the transmission of act 420 will be done as part of a beacon signal or other signal already in use. It should be appreciated, however, that embodiments of the invention may transmit this information in any suitable manner.
Once the list is stored and transmitted, the data is transmitted in act 422 over the connection using the selected sub-channels. These sub-channels, as discussed above, will not necessarily be contiguous, but will be any suitable sub-channels found by the process in any part of the spectrum, with a number of sub-channels being selected and transmitted on to achieve transmission at a desired data rate. It should be appreciated that the transmission over the sub-channels may be done in any suitable way and according to any suitable protocol, since the invention is not limited to being performed with any particular network implementation. In act 424, the process terminates. In embodiments of the invention, act 424 may comprise transmitting a second notification message to one or more other computing devices indicating that the computing device is no longer communicating over the selected sub-channels. In this way, the sub-channels that may have been reserved by the computing device may be released and thus made suitable for use by other computing devices.
It should be appreciated that the process illustrated in the flowchart of
Embodiments of the invention may also operate in a low power mode, wherein the eligibility of sub-channels for transmission is further restricted to a subset of the full spectrum. Restricting the number of sub-channels examined reduces the amount of power spent listening and determining, as well as the power spent configuring the computing device to transmit or receive at different frequencies (i.e., different sub-channels). The low power mode may be entered in response to user input or an operating state of the device such as operating on battery power, or in any other suitable way.
In the example of
Embodiments of the invention may also execute fewer acts than are shown in
It should be further appreciated that embodiments of the invention may execute more acts than are executed by the illustrative process of
In some embodiments of the invention, a list of sub-channels found to be unsuitable for transmission may be maintained for future use in selecting sub-channels for use in establishing a connection. In this way, sub-channels found to be unsuitable for communication may be avoided in the future. In an alternative embodiment of the invention, the list stored at act 418 may be updated at any point that a sub-channel is determined to be unsuitable. For example, if a sub-channel is in the list as being previously-selected, but is determined to be unsuitable, the sub-channel may be removed from the list or otherwise downgraded in the list. Any suitable technique for downgrading a sub-channel in the list may be used in accordance with embodiments of the invention, including moving the sub-channel lower in the list or otherwise indicating it as less suitable than other sub-channels.
It should also be appreciated that the sub-channels can be chosen for examination for suitability for communication in any suitable order. In some embodiments of the invention, order may be determined randomly, while in other embodiments, sub-channels may be ordered sequentially from one end of the spectrum to the other and sub-channels may be examined according to this order.
However, since some protocols use Frequency Division Multiplexing (FDM) across a very wide band of the spectrum, such as ultra wideband (UWB) communications or Worldwide Interoperability for Microwave Access (WiMAX), it may become costly in terms of time and processing to determine which sub-channels of the spectrum are free.
Therefore, in some embodiments of the invention, the order in which sub-channels are examined may be based on a cognitive process that makes use of data previously determined. The data may be obtained from the same computing device, other computing devices executing a similar process, or any other suitable source. In this embodiment, the cognitive aspect of the process refers to the act of “learning” from previously-determined information to aid in making determinations more easily, quickly, and efficiently.
An exemplary cognitive ordering process is illustrated in
In act 500, a list of previously-selected sub-channels (such as the one stored in act 418 of
In act 502 the ordering process begins examining sub-channels in the list. The process may examine the sub-channels in the list sequentially, or may examine them based on an index such as the one described above. Once a sub-channel is selected from the list in act 504, it is checked in act 508 against any list of sub-channels indicated as currently selected by another computing device. The checking of act 508 may be enabled by an exchange of notification messages between computing devices in a network, where the notification messages comprise sets of sub-channels selected for communication. These sets of sub-channels may be exchanged in any suitable manner, including processes discussed above in conjunction with act 420 of
If it is not indicated as selected by another computing device, then in act 510 the sub-channel is marked as examined and examined as discussed above in conjunction with
If, in the process of examining, all the sub-channels in the list have been marked as examined in act 510 and a desired number of sub-channels has not yet been selected, then the process may examine in act 506 sub-channels not in the list. The order in which these sub-channels is examined may be done in any suitable manner, including a random ordering or a sequential ordering from the sub-channel with the lowest frequency to the sub-channel with the highest frequency. Sub-channels that have not yet been marked as examined by act 510 may be examined as discussed above in conjunction with
It should be appreciated that
In some alternative embodiments, act 508 of
In act 604, device A detects interference on sub-channel 1, which, in the scenario illustrated, is caused by both devices trying to transmit on the sub-channel at the same time. In response, device A enters a waiting period wherein it does not transmit on that sub-channel for a random period of time. In act 606, device B also detects the interference and waits a random period of time. These random time values can be in any suitable range. In some embodiments of the invention, the wait times may be on the order of milliseconds, while other embodiments of the invention may implement wait times on the order of seconds. It should be appreciated, however, that the invention is not limited to implementing any specific range of time values for this random wait time.
Since these times are selected randomly, the waiting times will differ and the device with the shorter wait time will try to use the sub-channel again first. Because device B has the shorter waiting period, it is the first to check the sub-channel for interference in act 608, and in act 610 determines that the sub-channel is clear for transmission, at which point it begins transmitting its data again. In act 612, device A exits its waiting period and checks sub-channel 1 for interference, determining in act 614, that sub-channel 1 is being used by device B and is therefore unsuitable for transmission. Device A then proceeds to act 616, wherein it selects new sub-channels for communication. Such a selection can be done in any suitable manner, including the techniques discussed above.
It should be appreciated that the process illustrated in
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 or terminal 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 or terminal 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 including keyboards, and pointing devices, such as mice, touch pads, and digitizing tables. As another example, a computer may receive input information through speech recognition or in other audible formats.
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.
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.
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.
Having 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.
This Application is a Continuation of and claims benefit from U.S. patent application Ser. No. 14/645,335 that was filed Mar. 11, 2015, and that is a Continuation of U.S. patent application Ser. No. 13/427,494 (U.S. Pat. No. 9,065,687), filed in Mar. 22, 2012 (Issued Jun. 23, 2015), and that is a Continuation of patent application Ser. No. 11/637,449, (U.S. Pat. No. 8,144,793), that was filed on Dec. 12, 2006, (Issued Mar. 27, 2012) 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 |
5852630 | Langberg | Dec 1998 | A |
5867478 | Baum et al. | Feb 1999 | A |
6041048 | Erickson et al. | Mar 2000 | A |
6175550 | Van Nee | Jan 2001 | B1 |
6229471 | Herrmann | May 2001 | B1 |
6295272 | Feldman et al. | 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 |
6704572 | Whinnett | Mar 2004 | B1 |
6711141 | Rinne | Mar 2004 | B1 |
6721267 | Hiben et al. | 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. | Jul 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 |
7043023 | Watanabe et al. | May 2006 | B2 |
7043681 | Kroeger et al. | May 2006 | B2 |
7047032 | Yun | May 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 |
7450559 | Schotten | Nov 2008 | B2 |
7551641 | Pirzada | Jun 2009 | B2 |
7570953 | Maltsev | Aug 2009 | B2 |
7596127 | May | Sep 2009 | B1 |
7623599 | McCoy | Nov 2009 | B2 |
7627048 | Larsson | Dec 2009 | B2 |
7634016 | Hassan | Dec 2009 | B2 |
7643583 | Savoj et al. | Jan 2010 | B1 |
7643811 | Reunamaki | Jan 2010 | B2 |
7672221 | Fuji | Mar 2010 | B2 |
7672381 | Kleider | Mar 2010 | B1 |
7684473 | Walton et al. | 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 et al. | Jun 2011 | B2 |
8045935 | Lakkis | Oct 2011 | B2 |
8060033 | Himayat | Nov 2011 | B2 |
8072957 | Gross | Dec 2011 | B2 |
8144793 | Hassan | Mar 2012 | B2 |
8166534 | Yariv | Apr 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 et al. | Nov 2012 | B2 |
8374130 | Hassan | Feb 2013 | B2 |
8902820 | Cordeiro | Dec 2014 | B2 |
9065687 | Hassan | Jun 2015 | B2 |
20010007552 | Schiff | Jul 2001 | A1 |
20020009158 | Souissi et al. | Jan 2002 | A1 |
20020031189 | Hiben et al. | Mar 2002 | A1 |
20020080902 | Kim | Jun 2002 | A1 |
20020119781 | Li et al. | 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 |
20030236080 | Kadous | 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 | Hensen | Jan 2005 | A1 |
20050013284 | Proctor, Jr. | 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 et al. | 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 |
20050157670 | Tang et al. | Jul 2005 | A1 |
20050157805 | Walton | Jul 2005 | A1 |
20050160428 | Ayachitula et al. | Jul 2005 | A1 |
20050180313 | Kim | Aug 2005 | A1 |
20050180374 | Balachandran | Aug 2005 | A1 |
20050190800 | Maltsev | Sep 2005 | A1 |
20050197132 | Lee et al. | Sep 2005 | A1 |
20050201295 | Kim | Sep 2005 | A1 |
20050226341 | Sun | Oct 2005 | A1 |
20050228850 | Zhu et al. | Oct 2005 | A1 |
20050232208 | Hanson | Oct 2005 | A1 |
20050237989 | Ahn et al. | Oct 2005 | A1 |
20050245197 | Kadous et al. | Nov 2005 | A1 |
20050249127 | Huo | Nov 2005 | A1 |
20050270987 | Chen | Dec 2005 | A1 |
20060008014 | Tamaki | Jan 2006 | 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 et al. | 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 et al. | Dec 2006 | A1 |
20060274842 | Pan | 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 | Feher | 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 et al. | Apr 2007 | A1 |
20070105576 | Gupta | May 2007 | A1 |
20070115878 | Ashish | May 2007 | A1 |
20070116137 | McCoy | May 2007 | A1 |
20070133387 | Arslan et al. | 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 | Hssan et al. | Nov 2007 | A1 |
20080002733 | Sutskover | Jan 2008 | A1 |
20080014880 | Hyon et al. | Jan 2008 | A1 |
20080057869 | Strong | Mar 2008 | A1 |
20080070610 | Nishio | Mar 2008 | A1 |
20080089279 | Hu | Apr 2008 | A1 |
20080095135 | Cleveland | Apr 2008 | A1 |
20080137634 | Hassan et al. | 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 |
20090175363 | Hottinen | Jul 2009 | A1 |
20090190535 | Hassan et al. | 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 et al. | Jul 2010 | A1 |
20100208852 | Feher | Aug 2010 | A1 |
20110116360 | Wu | May 2011 | A1 |
20110173485 | Hassan | Jul 2011 | A1 |
20110235732 | Hassan | Sep 2011 | A1 |
20110310930 | Gerhardt | Dec 2011 | A1 |
20120128034 | Feher | 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 | Apr 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 560344 | Aug 2005 | EP |
1 571 773 | Sep 2005 | EP |
1 578162 | Sep 2005 | EP |
08-047036 | Feb 1996 | JP |
09-200863 | Jul 1997 | JP |
2001-230744 | Aug 2001 | JP |
2001-285236 | Oct 2001 | JP |
2004-108965 | Jun 2004 | JP |
2004-158965 | Jun 2004 | JP |
2004-172907 | Jun 2004 | JP |
2004-274103 | Sep 2004 | JP |
2004-350326 | Dec 2004 | JP |
2004-537875 | Dec 2004 | JP |
2005-086479 | Mar 2005 | JP |
2005-167502 | Jun 2005 | JP |
2005-244997 | Sep 2005 | JP |
2005-260921 | Sep 2005 | JP |
2006-094005 | Apr 2006 | 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 |
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 |
WO 02093839 | 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 |
2005I066914 | Jul 2005 | WO |
WO 2005125250 | Dec 2005 | WO |
2006004466 | Jan 2006 | WO |
2006006602 | Jan 2006 | WO |
2007I062754 | Jun 2007 | WO |
WO 2005076557 | Aug 2007 | WO |
2007108077 | Sep 2007 | WO |
Entry |
---|
“About SDR Technology,” 1 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.; downloaded on Dec. 12, 2006, pp. 1-3. |
“Software defined radio,” http://www.wipro.com/webpages/insights/softwareradio.htm, 1 pg, 2007. |
Atarashi, H., “Broadband packet wireless access appropriate for high-speed and high-capacity throughput,” Vehicular Technology Conference, 2001, pp. 566-570, vol. 1, Issue 2001. |
Baumgartner, et al., “Performance of Forward Error Correction for IEEE 802.16e,” 10th International OFDM Workshop, Hamburg, Germany, Aug. 2005. |
Blestas et al., “Efficient Collaborative (Viral) Communication in OFDM Based WLANs”, Proceedings of IEEE/ITS International Symposium on Advanced Radio Technologies (ISART 2003), Institute of Standards and Technology, Boulder Colorado, Mar. 4-7, 2003, pp. 27-32. |
Brodersen et al. “Corvus: a cognitive radio approach for usage of virtual unlicensed spectrum.” Online. http://www.tkn.tu-berlin.de/publications/papers/CR—White—paper—final.pdf, 2004. |
{umlaut over (C)}abrić, Danijela et al., A Cognitive 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, http://www-site.deis.unibo.it/Staff/giorgetti/pubblicazioni/Conferences/emc05—mcaggl.pdf, 2005, pp. 114-117, Rome, Italy. |
Examiner's First Report dated Aug. 18, 2010 from Australian Patent Application No. 2007333404. |
Goeckel, “Coded Modulation With Non-Standard Signal Sets for Wireless OFDM Systems,” IEEE, pp. 791-795, 1999. |
Goeckel, et al., “On the Design of Multidimentional Signal Sets for OFDM Systems,” IEEE Transactions on Communications, vol. 50 No. 3, pp. 442-452, Mar. 2002. |
International Search Report from corresponding International Application No. PCT/US2007/085556, filed Nov. 27, 2007, dated Mar. 26, 2008. |
International Search Report form International Application No. PCT/US2007/010020, dated Nov. 5, 2007. |
International Search Report from International Application No. PCT/US2007/085556, dated Mar. 26, 2008. |
International Search Report from International Application No. PCT/US2007/011642, dated Sep. 28, 2007. |
International Search Report from International Application PCT/US2007/010021, dated Oct. 17, 2007. |
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. |
Li, et al., “Clustered OFDM with Channel Estimation for High Rate Wireless Data,” IEEE, 1999, pp. 43-50. |
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/encycl.pdf, 1999. |
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. |
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. |
Tejera et al. “Subchannel Allocation in Multiuser Multiple Input Output Systems” IEEE Transactions on Information Theory, Jul. 4, 2006, pp. 1-34. |
Tewfik, et al., “High Bit Ultra-Wideband OFDM,” Global Telecommunications Conference, 2002, GLOBECOM apos;02. IEEE, Nov. 2002, pp. 2260-2264, vol. 3. |
Wahlqvist, et al., “A Conceptual Study of OFDM-based Multiple Access Schemes,” Telia, Jun. 5, 1996. http://www.es.lth.se/home/oes/pdfs/etsil.pdf. |
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. |
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. |
Written Opinion from International Application No. PCT/US2007/010020, dated Nov. 5, 2007. |
Written Opinion from International Application No. PCT/US2007/011642, dated Sep. 28, 2007. |
Written Opinion from International Application No. PCT/US2007/085556, dated Mar. 26, 2008. |
Written Opinion from International Application PCT/US2007/010021, dated Oct. 17, 2007. |
Youngblood, “A Software-Defined Radio for the Masses, Part 1,” http://www.ece.jhu.edu/˜cooper/SWRadio/Yblood1.pdf. Jul./Aug. 2002, pp. 1-9. |
Zhang, Qiwei et al., Adaptive OFDM System Design for Cognitive Radio, in: 11th International OFDM-Workshop, Aug. 30-31, 2006, Hamburg, Germany, pp. 91-95, IEEE Communications Society. |
JP Notification of Reason for Rejection for Application No. 2010-544299, dated Apr. 18, 2013. |
EP Communication for Application No. 08747424.3-1505, Reference FB22296, dated Apr. 10, 2013. |
EP Communication for Application No. 07777062.6-1854 / 2018718 PCT/US2007011642, Reference FB20744, dated Mar. 8, 2013. |
CN Notice on the Second Office Action for Application No. 200880125896.9, dated Dec. 19, 2012. |
CN Decision on Rejection for Application No. 200780045500.5, dated Feb. 5, 2013. |
CN Notice on the Second Office Action for Application No. 200780045500.5, dated Nov. 9, 2012. |
CN Notice on the Second Office Action for Application No. 200780016912.6, dated Jan. 7, 2013. |
Cabric, Danijela et al., “A Cognitive Radio Approach for Usage of Virtual Unlicensed Spectrum”, pp. 1-4, 1st Mobile Summit 2005, Jun. 2005. |
CN Notice on Reexamination for Application No. 200780045500.5, dated Dec. 26, 2014. |
Japanese Application 2009-541463, Notice of Rejection, dated Oct. 19, 2012. |
Rhee, W. et al.; “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. |
EPO Application 08747424.3; Extended European Search Report; dated Aug. 22, 2012. |
Office Action from Chinese Patent Application No. 200780045500.5 dated Jan. 31, 2012. |
PCT International Search Report and Written Opinion for Application No. PCT/US2008/087860, Reference 321714.02 WO, dated May 21, 2009. |
CN Notice on the First Office Action for Application No. 200880125896.9, dated Aug. 27, 2012. |
AU Examiner's first report on patent application No. 2007243348, dated May 24, 2010. |
CN Notice on the First Office Action for Application No. 200780015172.4, dated Dec. 30, 2010. |
JP Notice of Reason for Rejection for Application No. 2009-507775, dated Mar. 21, 2012. |
AU Examiner's first report on patent application No. 2007243349, dated Jul. 12, 2010. |
CA Office Action for Application No. 2,646,622, dated Jul. 21, 2014. |
CN Notice on the First Office Action for Application No. 200780015143.8, dated Jan. 24, 2011. |
CN Notice on the Second Office Action for Application No. 200780015143.8, dated Jul. 3, 2013. |
EP Communication for Application No. 07794367.8-1860 l 2011297 PCT/US200701 0021, Reference FB20668, dated May 12, 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. |
CN Notice on the First Office Action for Application No. 200880015382.8, Summary of the First Office Action included, dated Jun. 5, 2012. |
CN Notice on the Second Office Action for Application No. 200880015382.8, Summary of the Second Office Action included, dated Feb. 8, 2013. |
EP Provision of the minutes for Application No. 08747424.3-1505, Reference FB22296, dated Feb. 14, 2014. |
EP Decision to refuse European Patent Application No. 08747424.3-1505, Reference FB22296, dated Feb. 14, 2014. |
Chang, “Synthesis of Band-Limited Orthogonal Signals for Multichannel Data Transmission”, The Bell System Technical Journal, Aug. 4, 1966. |
TW Search Report for Application No. 096116940, dated Sep. 8, 2010. |
CN Notice on the First Office Action for Application No. 200780016912.6, dated Mar. 31, 2012. |
JP Notice of Reason for Rejection for Application No. 2009-509894, dated Mar. 21, 2012. |
KR Notice of Preliminary Rejection for Application No. 1 0-2008-7027267, dated Jul. 30, 2013. |
Alonistioti, “End-to-End Reconfigurability: Evolution on Reconfiguration Metamodel”, OMG SBC 2005, Aug. 17, 2005. |
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”, URSI GA 2005, Oct. 25, 2005. |
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”, Second Edition, Pentek, Apr. 11, 2006. |
CA Office Action for Application No. 2,672,103, dated Nov. 6, 2014. |
CA Office Action for Application No. 2,646,967, dated Jul. 11, 2014. |
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 3 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/US2007010020, 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. |
CN Notice on the Fourth Office Action for Application No. 200880015382.8, dated Mar. 14, 2014. |
Cabric, Danijela, “A Cognitive Radio Approach for Usage of Virtual Unlicensed Spectrum”, published Jun. 2005. |
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 Summons to attend oral proceedings for Application No. 08747424.3-1505/2143222, Reference FB22296, Jan. 17, 2014. |
JP Secondary Office Action for Application No. 2009-541463, dated Dec. 3, 2013. |
KR Notice of Preliminary Rejection for Application No. 10-2009-7014172, dated Nov. 25, 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 proceedings for Application No. 08747424.3-1505/2143222, Reference FB22296, Sep. 12, 2013. |
CN Decision on Rejection for Application No. 200880125896.9, Summary of the Final Rejection included, dated Jul. 29, 2013. |
JP Office Action for Application No. 2009-541463, dated Jul. 19, 2013. |
JP Notification of reason for rejection for Application No. 2010-544299, Drafting date Jul. 29, 2013. |
KR Notice of Preliminary Rejection and Reasons for Rejection for Application No. 10-2008-7025732, Reference No. 316361.13, dated Jun. 30, 2013. |
TW Search Report for Application No. 096114706. Date of Research: Mar. 14, 2013. |
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. |
Indian Patent Office, Author unknown, IN First Examination Report for Application No. 5117/CHENP/2008, 2 pages, dated Feb. 26, 2016, India. |
Indian Patent Office, Author unknown, IN First Examination Report for Application No. 5118/CHENP/2008, 2 pages, dated Oct. 16, 2015, India. |
MY Substantive Examination Adverse Report for Application No. PI 20092035, dated May 29, 2015. |
EP Communication for Application No. 08871573.5-1851, dated Nov. 12, 2015. |
CN Notice on the Third Office Action for Application No. 200880125896.9, dated Jan. 22, 2016. |
CN Notice on Reexamination for Application No. 200780045500.5, dated May 4, 2015. |
“Software Defined Radio”, Altera, http://www.aftera.com/end-markets/wireless/software/sdr/wir-sdr.html, 4 pages, as archived on web.archive.org, Jul. 2006. |
Mitola III, “Cognitive Radio: An Integrated Agent Architecture for Software Defined Radio”, Dissertation, Royal Institute of Technology (KTH), Teleinformatics, Electrum 204, SE-164 40 Kista, Sweden, May 8, 2000. |
Chinese State Intellectual Property 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. |
Chinese State Intellectual Property Office, Author unknown, CN Notice on Reexamination for Application No. 200880125896.9, pp. 1-6, dated Jul. 3, 2015, China. |
Russian Patent Office, Attorney Yury D.Kuznetsov, RU Decision on Grant of a Patent for Invention for Application No. 2008142422, pp. 1-6, dated Mar. 23, 2011, Russia. |
Chinese State Intellectual Property Office, Author unknown, CN Decision on Reexamination for Application No. 200880125896.9, p. 1, dated Sep. 29, 2015, China. |
Sari, “Orthogonal Frequency-Division Multiple Access and its Application to CATV Networks”, European Transactions on Telecommunications, Communication Theory, vol. 9, No. 6, 507-516, Nov.-Dec. 1998, France. |
Chinese State Intellectual Property Office, Author unknown, CN Decision on Reexamination for Application No. 200780015143.8, dated Mar. 28, 2013, 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. |
Indian Patent Office, Author unknown, IN Second Examination Report for Application No. 5117/CHENP/2008, 2 pages, dated Dec. 19, 2016, India. |
U.S. Appl. No. 11/637,449, filed Dec. 12, 2006, Hassan. |
U.S. Appl. No. 13/427,494, filed Mar. 22, 2012, Hassan. |
U.S. Appl. No. 14/645,335, filed Mar. 11, 2015, Hassan. |
U.S. Appl. No. 14/656,694, filed Mar. 12, 2015, Hassan. |
U.S. Appl. No. 14/657,044, filed Mar. 13, 2015, Hassan. |
U.S. Appl. No. 11/410,969, filed Apr. 25, 2006, Hassan. |
U.S. Appl. No. 11/410,409, filed Apr. 25, 2006, Hassan. |
U.S. Appl. No. 11/433,804, filed May 12, 2006, Hassan. |
U.S. Appl. No. 13/449,312, filed Apr. 18, 2012, Hassan. |
U.S. Appl. No. 13/452,637, filed Apr. 20, 2012, Hassan. |
U.S. Appl. No. 14/104,027, filed Dec. 12, 2013, Hassan. |
U.S. Appl. No. 14/562,470, filed Dec. 5, 2014, Hassan. |
U.S. Appl. No. 15/189,603, filed Jun. 22, 2016, Hassan. |
U.S. Appl. No. 15/189,692, filed Jun. 22, 2016, Hassan. |
U.S. Appl. No. 11/731,269, filed Mar. 30, 2007, Hassan. |
U.S. Appl. No. 13/052,667, filed Mar. 21, 2011, Hassan. |
U.S. Appl. No. 14/446,323, filed Jul. 29, 2014, Hassan. |
U.S. Appl. No. 60/928,114, filed May 8, 2007, Hassan. |
U.S. Appl. No. 11/899,248, filed Sep. 5, 2007, Hassan. |
U.S. Appl. No. 13/153,801, filed Jun. 6, 2011, Hassan. |
U.S. Appl. No. 14/256,709, filed Apr. 18, 2014, Hassan. |
U.S. Appl. No. 15/156,676, filed May 17, 2016, Hassan. |
U.S. Appl. No. 12/020,212, filed Jan. 25, 2008, Hassan. |
U.S. Appl. No. 13/763,671, filed Feb. 9, 2013, Hassan. |
U.S. Appl. No. 15/053,353, filed Feb. 25, 2016, Hassan. |
Norwegian Intellectual Property Office, Author Arlindo Bengui André, NO Search Report for Application No. 20084086, 2 Pages, dated Feb. 4, 2017, Norway. |
Indian Patent Office, Author unknown, IN First Examination Report for Application No. 4040/CHENP/2009, Jul. 3, 2017, 9 pages, India. |
“Office Action Issued in Norway Patent Application No. 20092613”, dated Nov. 2, 2017, 3 Pages. |
Number | Date | Country | |
---|---|---|---|
20170134196 A1 | May 2017 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14645335 | Mar 2015 | US |
Child | 15411806 | US | |
Parent | 13427494 | Mar 2012 | US |
Child | 14645335 | US | |
Parent | 11637449 | Dec 2006 | US |
Child | 13427494 | US |