When radio networks encounter other devices, such as radars (e.g., primary emitters) or other radio networks (e.g., secondary emitters) that emit energy (and therefore use shared radio resources) in their vicinity, it is desirable to characterize the radio resource usage patterns of these other devices. Such a characterization of the usage patterns results in the identification of opportunities for the radio networks to transmit and/or receive signal. Wireless networks are generally allowed to operate only if they detect no radar. If a radio network detects an operational radar signal, the radio network must vacate that frequency bandwidth.
Hough Transforms have been employed for the detection of such other devices. As an example, Hough Transforms are used to detect radar pulses for use with any type of radio signals that create periodic patterns. The width repetition indicates what kind of radar is in use. The Hough Transform has been studied in image processing literature for detection of patterns such as lines, circles and ellipses in binary images. The effectiveness of Hough Transforms in detecting patterns in data with many overlaying patterns and random noise is proven. In the presence of outliers, the Hough Transform is more robust to noise than the commonly used least-squares estimation.
A solution provided by the invention eases the memory requirements of the known method and device. The solution is to use a particular Hough Transform, known as Randomized Hough Transform (RHT), to detect the parameters of helixes wrapped around cylinders. The RHT as applied to straight-line detection, results in randomly picking pairs of points and computing and accumulating a parameter (for instance, slope). When enough confidence in the peak is achieved, the process stops, thus reducing both memory and processing time.
In one aspect, a method for identifying opportunities in a radio network includes several steps. On step is listening for a first period of time. Another step is detecting a first busy slot. Several additional steps include listening for a second period of time; detecting a second busy slot; listening for a third period of time; and detecting a third busy slot. Another step is recognizing a sequence of the first, second, and third busy slots as a function of time. Other steps include performing a Randomized Hough Transform on the sequence; generating a histogram based on the Randomized Hough Transform; identifying peaks in the histogram; determining whether the peaks correspond to a known radar; and identifying an opportunity to transmit.
In one embodiment, the method includes listening for at least a fourth period of time and detecting at least a fourth busy slot.
In another embodiment, the determining step determines whether the peaks correspond to a known radar in limited bandwidth.
In another aspect, a device for identifying opportunities in a radio network includes: a source; a processor for performing a computation which includes a means for performing an Randomized Hough Transform, a means for generating a histogram based on the Randomized Hough Transform, a means for identifying peaks in the histogram, and a means for identifying opportunities to transmit; a memory; and at least one listening device.
In one embodiment, the device includes a Medium Access Control, a Physical layer, and at least one transmitter.
In another embodiment, the listening device is an IEEE 802.11 slot mechanism.
The invention provides many advantages that are evident from the following description, drawings, and claims.
Once the radio network device detects three busy slots in steps 201-206, it must recognize a sequence of the first, second, and third busy slots as a function of time in step 207. For example, the number of idle slots that separate the second busy slot from the first, as compared to the number of idle slots between the busy slots three and two should either be the same or their difference should be bounded by (i.e. less than) a small number. If it cannot recognize a sequence of the detected busy slots as a function of time, it begins a repetition of steps 201-206. If the radio network device recognizes a sequence of the first, second, and third busy slots as a function of time, software, an algorithm, and/or a processor performs a Randomized Hough Transform in steps 208.1-208.2 as described below.
The invention employs a 1-D to 3-D transformation (like a raster scan) and then applies the Hough Transform to detect straight lines, which correspond to pulse trains. Furthermore, a computation of the noise floor is incorporated. According to the method, in step 208.1, first, a transforming step transforms the 1-D signal to a 3-D helical signal. Next, in step 208.2, a conversion step applies a RHT to the 3-D helical signal.
The method can include generating a helix that may be represented by the following parametric equations:
X(t)=sin(ωt)
Y(t)=cos(ωt) (1)
Z(t)=t
This helix is cylindrical (as opposed to the more general elliptical) and has unit radius.
Based on the parameter ω a new helix can be generated that wraps around the cylinder more slowly as ω decreases. In
If the two points P0 and P1 are inside one twirl of the helix, then ω works out to be 1. The length of the line segment given by one twirl of helix is
In step 209 of
In step 210, the radio network identifies peaks in the histogram generated in step 209. Peak 30 of
For the case depicted in
Once the peaks are identified in step 210, the radio network determines whether the peaks correspond to a known radar in step 211. This may occur, for example, by comparing the identified peaks to peak data stored in a memory. If the peaks do not correspond to a known radar, the radio network repeats steps 207-211. If the peaks do correspond to a known radar, then the radio network knows the period and use related to the radar and can identify opportunities to transmit and/or receive signal in step 212. The radio network transmits and/or receives in step 213 based on the opportunity identification of step 212.
The method may be associated with alternative ways of detection periodic interferences, which are for example based on the autocorrelation of measurement results in time.
As an example, if device 607 operates within an 802.11 WLAN, source 604 would contain Medium Access Control (MAC) layer 602 and a physical layer (PHY) 603. Processor 601 would direct listening device 605 to listen for a first period of time. When processor 601 detects a first busy slot, it directs listening device 605 to listen for a second period of time. When processor 602 detects a second busy slot, it directs listening device 605 to listen for a third period of time. Upon detecting a third busy slot, processor 601 recognizes a sequence of the first, second, and third busy slots as a function of time by comparing the busy slots to sequences stored in a memory 608. The connection between processor 601 and memory 608 may represent, for example, a bus, a communication network, one or more internal connections of a circuit, circuit card or other apparatus, as well as portions and combinations of these and other communication media.
Processor 601 then performs a Randomized Hough Transform on the sequence as previously explained using software, an algorithm, or any other means of computation. Processor 601 then generates a histogram based on the Randomized Hough Transform and identifies peaks in the histogram. Processor 601 then determines whether the peaks correspond to known radar by comparing the peaks to peak data stored in memory 608. Then processor 601 identifies an opportunity to transmit based on the known behavior of the now known radar Source 604 would then employ MAC 602 and PHY 603 to determine when to transmit using transmitter 606.
Processor 601 may be any means, such as an algorithm, general purpose, or special purpose computing system, or may be a hardware configuration, such as a laptop computer, desktop computer, a server, handheld computer, dedicated logic circuit, or integrated circuit. Processor 601 may also be Programmable Array Logic (PAL), Application Specific Integrated Circuit (ASIC), etc., which may be hardware programmed to include software instructions that provide a known output in response to known inputs. The elements illustrated herein may also be implemented as discrete hardware elements that are operable to perform the operations shown using coded logical operations or by executing hardware executable code.
The preceding expressions and examples are exemplary and are not intended to limit the scope of the claims that follow.
This application claims the benefit of U.S. Provisional Application Ser. No. 60/541,207, filed Feb. 2, 2004, the teachings of which are incorporated herein by reference.
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/IB05/50385 | 1/28/2005 | WO | 00 | 7/24/2006 |
Number | Date | Country | |
---|---|---|---|
60603382 | Aug 2004 | US |