EP0343370A2 - Edge effect reduction by smoothing in digital receivers - Google Patents
Edge effect reduction by smoothing in digital receivers Download PDFInfo
- Publication number
- EP0343370A2 EP0343370A2 EP89106901A EP89106901A EP0343370A2 EP 0343370 A2 EP0343370 A2 EP 0343370A2 EP 89106901 A EP89106901 A EP 89106901A EP 89106901 A EP89106901 A EP 89106901A EP 0343370 A2 EP0343370 A2 EP 0343370A2
- Authority
- EP
- European Patent Office
- Prior art keywords
- data
- edge
- signal
- sum
- paths
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03H—IMPEDANCE NETWORKS, e.g. RESONANT CIRCUITS; RESONATORS
- H03H17/00—Networks using digital techniques
- H03H17/02—Frequency selective networks
Definitions
- This invention relates to methods and apparatus for improved detection, analysis, and discrimination of signals in receiving devices.
- these methods and apparatus reduce the undesirable effects of sharp signal pulses, called edges, from strong signal emitters, allowing for greater dynamic ranges in detection.
- Radar and sonar receivers provide good examples of such detection devices. These receivers seek to locate and identify all emitters in their area, including both strong and weak signal sources. However, certain obstacles prevent precise and complete tracking. In particular, signals which turn suddenly on or off during reception and processing tend to drown out weaker signals, making their detection and discrimination much more difficult.
- FFT Fast Fourier Transform
- results of an FFT are often expressed in a power spectrum chart, graphing the amplitude weighting for each fourier sine wave component as a function of that component's frequency (sometimes called a frequency bin or an FFT "filter").
- An FFT of a simple sine wave yields a single amplitude point on a power spectrum, at exactly that frequency.
- the power spectrum will generally be more complex, but will have a peak centered on the emitter's principal frequency.
- This invention provides methods and apparatus for reducing spectral splatter produced in a digital receiver due to receiving edges from strong signal emitters.
- These apparatus include means for digitizing and buffering incoming signal data.
- this data includes a plurality of signals of different frequency and comprising complex-valued numbers.
- these apparatus provide means for ascertaining the presence of one or more edges in the same digitized data. If an edge occurs, special values or sets of weights are applied to the buffered data which smooth out the discontinuity in the edge.
- FFT Fast Fourier Transform
- the frequency spread caused by the edge is quenched, and the signal-to-noise ratios for signals of other, and especially weaker, frequencies are increased.
- the strong edge and spectral splatter associated with a signal of a given frequency no longer drowns out weaker signals at other frequencies.
- FIG. 1 shows a block diagram for a digital radar receiver.
- the Analog-Digital Conversion (ADC) Block 12 receives and converts analog data 10 to digital information. The data is duplicated after this point, with one set of data delayed in a buffer 14 while the other set travels through the Edge Detection processing blocks 16 and 18. Within this path, the Magnitude Detection Block 16 forms real magnitudes out of the ADC complex number outputs, for use in recognizing edges.
- the real magnitude may be formed from the complex numbers in an approximate way, by taking (if the data is given by a + bi) the real value as Max[
- the Edge Detection Block 18 determines whether an edge is present or not. It performs this function in two stages. First, for each point j in the signal or data stream, clusters of data points located at some time n before the point are subtracted from clusters of data points located at some time n after the point. Thus, if some discontinuity should occur, subtracting points before and after the discontinuity would yield an offset.
- the offset b j After taking the positive value of the offset b j for the given point, it is compared with the offset values immediately before (b j-1 ) and immediately after (b j+1 ) the point in question. If the offset is larger than either of its neighbors and is larger than a threshold determined from the data itself, then an edge is declared at point j.
- weighted offset values b j can be calculated as follows: The summation bounds m and the offset n can be determined for particular applications to yield the most efficient (i.e. process timesaving) and accurate algorithm required. The resulting weighted values b j for each data point j can be used to detect a pulse edge.
- a pulse edge is declared if b j > b j+1 and b j > b j-1 and b j > t j , i.e. if b j is greater than its nearest neighbors and is greater than some threshold value determined by where parameter S determines the relative sensitivity for thresholding sharp edges.
- Min refers to taking the value of the minimum of the arguments within the brackets. Configuring the parameters used in the algorithms requires testing sample data and varying the parameters, m,n, and S until the best results are obtained, best meaning the lowest overall frequency noise from sharp edges.
- the algorithm described for determining the b j 's and for declaring pulse edges is just one example of various processing alternatives.
- the partial summation results used for ever jth data point as shown above can be kept in memory and updated easily for each incoming data point by adding and subtracting the data points in a buffer. This partial summing can save processing time.
- the Edge Detection Block 18 determines an edge through the above procedure, it sends an instruction to the Pulse Smoothing block 20 to apply the smoothing weights to the data's edge.
- the weights are applied by multiplying a set number of the samples around the edge at sample j by a fixed weight set centered on data sample j.
- the weighting algorithm can be varied for specific system goals, requiring a tailoring of the weights to the particular data, their dynamic range, and to the FTT algorithms being used.
- the weighting used is represented by W s (t), given by: where f s is the data sampling rate and N is the number of samples weighted. ⁇ is the pulse rise time.
- normal pre-FFT amplitude weights 22 are applied (for example Dolph-Chebyshev weights) which reduce sidelobes for the FFT being used.
- An FFT normally processes a set number of data points at a time, the number of data points used being called the "window". If the FFT window doesn't quite match the weighted data stream, some data turning 22 may be required to properly match the weighted sample size to the FFT window.
- a whole collection of possible weights could be preset and used depending on the location of the edge within the FFT processing window. This can save processing time by calculating in advance all possible weighting combinations.
- the edge smoothing weights and the single set of amplitude (Dolph-Chebyshev) weights are replaced by a group of combined weights, each pre-optimized for a particular location of the pulse edge within the FFT processing window.
- the two approaches discussed have benefits and drawbacks.
- the first approach multiplying when detected each edge by the weights, has the greater flexibility. Any number of edges within a given window can be smoothed, and modularity allows different post-processing to be done without reprogramming or restructuring the smoothing step.
- the second approach having preset weighting sets, implements the edge smoothing into a total processing system, trading flexibility for processing speed and pre-optimization.
- Magnitude detection after the FFT is performed, determines the strengths of each frequency given in the filters of the FFT.
- Each filter bin represents a possible signal and its relative strength determines how likely it is an actual signal from an existing emitter.
- the noise estimation stage determines the noise level of all the filter bins in order to form a reasonable thresholding value for removing noise from true signals.
- the removal process is performed at the thresholding stage, using the threshold already determined.
- the pulse descriptor stage calculates the angle and times of arrival of given frequency signals, their pulse widths and their amplitudes or strengths. Determining the angle of an emitter often requires a plurality of antennas or detectors to triangulate the signal source. On the basis of these descriptors, time histories of pulses are created in the classification and identification stage, so that received pulses are correlated with emitters and these emitters may be tracked in time.
- FIGS. 2 and 3 illustrate a simple operation of the present invention.
- FIG. 2A reveals a strong signal sine wave 102, graphed with its amplitude A over time t.
- FIG. 2B shows the power spectrum resulting from performing an FFT upon the strong signal.
- F(f) represents the relative strength of the incoming signals versus frequency.
- the tall bin 104 is the amplitude of the strong signal; smaller bin 106 represents a relatively weak signal detected along with the stronger signal. In this case, both signals are easy to detect and distinguish from one another.
- FIG. 3A represents the same strong signal 202 as FIG. 2A but here the signal suddenly cuts off at time t designated t0.
- a dashed line 203 indicates the smoothing of the discontinuity which the present invention provides.
- FIG. 3B shows a power spectrum of the strong signal and its edge without any smoothing, having very FFT filter or bin excited. The noise or spectral splatter resulting from the signal edge washes out the small signal 206 shown by the dotted lines.
- FIG. 3C shows the power spectrum resulting after edge smoothing, the noise being much smaller in strength.
- Edge smoothing greatly reduces the FFT noise or spectral splatter, allowing detection of smaller signals and thereby increasing the dynamic range for detection.
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Computer Hardware Design (AREA)
- Mathematical Physics (AREA)
- Radar Systems Or Details Thereof (AREA)
- Noise Elimination (AREA)
- Image Processing (AREA)
- Signal Processing For Digital Recording And Reproducing (AREA)
Abstract
Description
- This invention relates to methods and apparatus for improved detection, analysis, and discrimination of signals in receiving devices. In particular, these methods and apparatus reduce the undesirable effects of sharp signal pulses, called edges, from strong signal emitters, allowing for greater dynamic ranges in detection.
- Devices which receive and analyze a plurality of incoming signals through one or more detectors often process these signals to determine the number, direction, and strengths of various signal emitters within their vicinity. Radar and sonar receivers provide good examples of such detection devices. These receivers seek to locate and identify all emitters in their area, including both strong and weak signal sources. However, certain obstacles prevent precise and complete tracking. In particular, signals which turn suddenly on or off during reception and processing tend to drown out weaker signals, making their detection and discrimination much more difficult.
- Many signal detection devices rely upon spectral analysis to identify and discriminate among a plurality of radar, sonar, or other electromagnetic signal sources. For data in digital form, spectral analysis through the use of a Fast Fourier Transform (FFT) yields the frequency spectrum which a particular signal source emits, effectively tagging individual sources by their frequencies. Fourier theory shows that any arbitrary signal or function, in this case a function of time, namely an electromagnetic wave, can be broken down or decomposed into a sum of individual sine waves of differing frequency.
- The results of an FFT are often expressed in a power spectrum chart, graphing the amplitude weighting for each fourier sine wave component as a function of that component's frequency (sometimes called a frequency bin or an FFT "filter"). One can reconstruct the original repeating signal function by multiplying each sine wave by its amplitude in the power spectrum and adding the resulting products. An FFT of a simple sine wave yields a single amplitude point on a power spectrum, at exactly that frequency. For an arbitrary signal in time, the power spectrum will generally be more complex, but will have a peak centered on the emitter's principal frequency.
- Fourier transform theory assumes that the signal being analyzed has been "on" forever. If a signal that appears to be a clean repeating sine wave suddenly turns off or on during an FFT analysis, the power spectrum no longer provides a simple answer for the emitter frequency. This sudden turning on or off during transmission defines a signal "edge". The power spectrum of an edge no longer yields a peak for a single frequency. Instead, one requires an infinite number of sine wave frequencies to reconstruct the sudden discontinuity in the repeating wave. Hence, a power spectrum of an edge gives rather large amplitudes for a continuum of temporal frequencies. This broadened power spectrum constitutes a "spectral splatter" for the signal being analyzed. Such frequency or spectral splatter impairs detection of weaker radar signals, simply because the frequency components of the edge drown out a signal of weaker frequency. No method or apparatus has been available to reduce the spectral splatter of an edge, while still detecting the primary frequency of the strong emitter and also detecting the frequency of weaker signals.
- This invention provides methods and apparatus for reducing spectral splatter produced in a digital receiver due to receiving edges from strong signal emitters. These apparatus include means for digitizing and buffering incoming signal data. In preferred embodiments, this data includes a plurality of signals of different frequency and comprising complex-valued numbers. Along a separate path, these apparatus provide means for ascertaining the presence of one or more edges in the same digitized data. If an edge occurs, special values or sets of weights are applied to the buffered data which smooth out the discontinuity in the edge. When the smoothed out edge is processed by the spectral analysis Fast Fourier Transform (FFT) stage, spectral splatter is reduced or eliminated. The result is that the frequency spread caused by the edge is quenched, and the signal-to-noise ratios for signals of other, and especially weaker, frequencies are increased. In other words, the strong edge and spectral splatter associated with a signal of a given frequency no longer drowns out weaker signals at other frequencies.
- The invention may be better understood through reference to the following figures:
- FIG. 1 represents a block diagram of the flow of data in the present invention.
- FIGS. 2A and 2B show graphs of a strong signal over time and its corresponding Fourier power spectrum, with a superimposed weaker signal.
- FIGS. 3A, 3B, and 3C show graphs of a strong signal over time with a pulse edge and the corresponding Fourier power spectrums both with and without edge smoothing.
- FIG. 1 shows a block diagram for a digital radar receiver. The Analog-Digital Conversion (ADC)
Block 12 receives and convertsanalog data 10 to digital information. The data is duplicated after this point, with one set of data delayed in abuffer 14 while the other set travels through the Edge Detectionprocessing blocks Block 16 forms real magnitudes out of the ADC complex number outputs, for use in recognizing edges. The real magnitude may be formed from the complex numbers in an approximate way, by taking (if the data is given by a + bi) the real value as Max[ |a|, |b|] + 1/2 Min[ |a|, |b|], in order to save processing time. The real magnitude values for each signal are then sent to the Edge Detectionblock 18. - The Edge Detection Block 18 determines whether an edge is present or not. It performs this function in two stages. First, for each point j in the signal or data stream, clusters of data points located at some time n before the point are subtracted from clusters of data points located at some time n after the point. Thus, if some discontinuity should occur, subtracting points before and after the discontinuity would yield an offset.
- After taking the positive value of the offset bj for the given point, it is compared with the offset values immediately before (bj-1) and immediately after (bj+1) the point in question. If the offset is larger than either of its neighbors and is larger than a threshold determined from the data itself, then an edge is declared at point j.
- In the Edge
Detection Block 18, if individual input amplitude magnitudes are given by aj, where j denotes the sequential order of the pulses and hence their time of arrival, then weighted offset values bj can be calculated as follows: - As described, a pulse edge is declared if
bj > bj+1 and
bj > bj-1 and
bj > tj,
i.e. if bj is greater than its nearest neighbors and is greater than some threshold value determined by - As a processing time saver, the partial summation results used for ever jth data point as shown above can be kept in memory and updated easily for each incoming data point by adding and subtracting the data points in a buffer. This partial summing can save processing time.
- Once the
Edge Detection Block 18 determines an edge through the above procedure, it sends an instruction to thePulse Smoothing block 20 to apply the smoothing weights to the data's edge. Using one method, the weights are applied by multiplying a set number of the samples around the edge at sample j by a fixed weight set centered on data sample j. - The weighting algorithm can be varied for specific system goals, requiring a tailoring of the weights to the particular data, their dynamic range, and to the FTT algorithms being used. As a preferred embodiment, the weighting used is represented by Ws(t), given by:
- After any necessary edge-smoothing weights are applied to the edges, normal
pre-FFT amplitude weights 22 are applied (for example Dolph-Chebyshev weights) which reduce sidelobes for the FFT being used. An FFT normally processes a set number of data points at a time, the number of data points used being called the "window". If the FFT window doesn't quite match the weighted data stream, some data turning 22 may be required to properly match the weighted sample size to the FFT window. As an alternative to the edge smoothing approach described, a whole collection of possible weights could be preset and used depending on the location of the edge within the FFT processing window. This can save processing time by calculating in advance all possible weighting combinations. In a further variation of this approach, the edge smoothing weights and the single set of amplitude (Dolph-Chebyshev) weights are replaced by a group of combined weights, each pre-optimized for a particular location of the pulse edge within the FFT processing window. - The two approaches discussed have benefits and drawbacks. The first approach, multiplying when detected each edge by the weights, has the greater flexibility. Any number of edges within a given window can be smoothed, and modularity allows different post-processing to be done without reprogramming or restructuring the smoothing step. The second approach, having preset weighting sets, implements the edge smoothing into a total processing system, trading flexibility for processing speed and pre-optimization.
- After the spectral analysis FFT step represented by
block 24 is performed, magnitude detection, noise estimation, thresholding, derivation of pulse descriptors, and the final emitter classifications and identifications are made. - Magnitude detection, after the FFT is performed, determines the strengths of each frequency given in the filters of the FFT. Each filter bin represents a possible signal and its relative strength determines how likely it is an actual signal from an existing emitter. The noise estimation stage determines the noise level of all the filter bins in order to form a reasonable thresholding value for removing noise from true signals. The removal process is performed at the thresholding stage, using the threshold already determined.
- Once a collection of signals is obtained, the pulse descriptor stage calculates the angle and times of arrival of given frequency signals, their pulse widths and their amplitudes or strengths. Determining the angle of an emitter often requires a plurality of antennas or detectors to triangulate the signal source. On the basis of these descriptors, time histories of pulses are created in the classification and identification stage, so that received pulses are correlated with emitters and these emitters may be tracked in time.
- FIGS. 2 and 3 illustrate a simple operation of the present invention. FIG. 2A reveals a strong
signal sine wave 102, graphed with its amplitude A over time t. FIG. 2B shows the power spectrum resulting from performing an FFT upon the strong signal. F(f) represents the relative strength of the incoming signals versus frequency. Thetall bin 104 is the amplitude of the strong signal;smaller bin 106 represents a relatively weak signal detected along with the stronger signal. In this case, both signals are easy to detect and distinguish from one another. - FIG. 3A represents the same
strong signal 202 as FIG. 2A but here the signal suddenly cuts off at time t designated t₀. A dashedline 203 indicates the smoothing of the discontinuity which the present invention provides. FIG. 3B shows a power spectrum of the strong signal and its edge without any smoothing, having very FFT filter or bin excited. The noise or spectral splatter resulting from the signal edge washes out thesmall signal 206 shown by the dotted lines. FIG. 3C shows the power spectrum resulting after edge smoothing, the noise being much smaller in strength. One clearly discerns thestrong frequency 304 as well as theweaker frequency signal 306. Edge smoothing greatly reduces the FFT noise or spectral splatter, allowing detection of smaller signals and thereby increasing the dynamic range for detection.
Claims (14)
- processing digital data along two paths (16/18, 14);
- along the first (16/18) of said two paths determining when said data comprise an edge; and
- along the second (14) of said two paths applying weights to said edge which reduce said spectral splatter when said data is spectrally analyzed.
- receiving signal data in digital form;
- processing said data along two paths (16/18, 14);
- along first (16/18) of said paths, converting said digital data to real-valued magnitudes;
- determining when a series of said real-valued data comprise an edge;
- along the second (14) of said paths, buffering said digital data;
- determining weighting values for applying to said detected edges; and
- applying said weighting values to said detected edges while said digital data traverses said second (14) path.
- calculating bj 's from said real-valued data labelled aj; and
- determining when one of said bj 's is greater than its two nearest neighbors, bj-1 and bj+1 , and is greather than a threshold value tj such that aj comprises an edge.
- calculating a first sum of 2m+1 said aj 's around aj+n;
- calculating a second sum of 2m+1 said aj 's around aj-n; and
- subtracting said second sum from said first sum.
- calculating a first sum of 2m+1 said aj 's around aj+n;
- calculating a second sum of 2m+1 said aj 's around aj-n; and
- letting tj equal a number S times the minimum of said first sum or said second sum.
- means for receiving signal data in digital form;
- means for converting said data into real-valued magnitudes;
- means for determining when a series of said real-valued magnitudes comprise an edge;
- means for delaying a second set of said signal data until said conversion means and said determining means have finished processing said signal data; and
- means for applying weighting values to said edges of said signal data.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US07/185,018 US4958361A (en) | 1988-04-22 | 1988-04-22 | Edge effect reduction by smoothing in digital receivers |
US185018 | 1988-04-22 |
Publications (3)
Publication Number | Publication Date |
---|---|
EP0343370A2 true EP0343370A2 (en) | 1989-11-29 |
EP0343370A3 EP0343370A3 (en) | 1990-09-19 |
EP0343370B1 EP0343370B1 (en) | 1994-08-24 |
Family
ID=22679214
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP89106901A Expired - Lifetime EP0343370B1 (en) | 1988-04-22 | 1989-04-18 | Edge effect reduction by smoothing in digital receivers |
Country Status (6)
Country | Link |
---|---|
US (1) | US4958361A (en) |
EP (1) | EP0343370B1 (en) |
AU (1) | AU612823B2 (en) |
CA (1) | CA1319959C (en) |
DE (1) | DE68917641T2 (en) |
ES (1) | ES2058376T3 (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0344794A2 (en) * | 1988-06-03 | 1989-12-06 | Hughes Aircraft Company | Apparatus and method for processing simultaneous radio frequency signals |
WO2000035087A1 (en) * | 1998-12-08 | 2000-06-15 | Siemens Medical Systems, Inc. | Real-time technique for reducing the settling time of a high pass filter |
WO2003001351A2 (en) * | 2001-06-22 | 2003-01-03 | Sun Microsystems, Inc. | METHOD FOR SMOOTHING dI/dT NOISE DUE TO CLOCK TRANSITIONS |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5216696A (en) * | 1989-12-22 | 1993-06-01 | Comsat Laboratories | Programmable noise bandwidth reduction by means of digital averaging |
JP2768548B2 (en) * | 1990-11-09 | 1998-06-25 | シャープ株式会社 | Panel display device |
US5367539A (en) * | 1991-12-31 | 1994-11-22 | At&T Bell Laboratories | Digital block processor for processing a plurality of transmission channels in a wireless radiotelephony system |
US5381150A (en) * | 1993-05-07 | 1995-01-10 | Trw Inc. | Partial intercept LPI (low probability of intercept) reconnaissance system |
CN102841336A (en) * | 2012-09-04 | 2012-12-26 | 中船重工鹏力(南京)大气海洋信息系统有限公司 | High-frequency ground wave radar multi-frequency signal coherent receiver |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4410955A (en) * | 1981-03-30 | 1983-10-18 | Motorola, Inc. | Method and apparatus for digital shaping of a digital data stream |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB1448697A (en) * | 1973-09-25 | 1976-09-08 | Post Office | Non-linear correction of waveforms |
US4358788A (en) * | 1981-02-27 | 1982-11-09 | Rca Corporation | Legibility for alpha-mosaic characters |
EP0083480B1 (en) * | 1981-12-31 | 1988-08-17 | The Secretary of State for Defence in Her Britannic Majesty's Government of the United Kingdom of Great Britain and | Receivers for navigation satellite systems |
JPH055725Y2 (en) * | 1987-02-06 | 1993-02-15 |
-
1988
- 1988-04-22 US US07/185,018 patent/US4958361A/en not_active Expired - Lifetime
-
1989
- 1989-04-18 AU AU33163/89A patent/AU612823B2/en not_active Ceased
- 1989-04-18 ES ES89106901T patent/ES2058376T3/en not_active Expired - Lifetime
- 1989-04-18 DE DE68917641T patent/DE68917641T2/en not_active Expired - Fee Related
- 1989-04-18 EP EP89106901A patent/EP0343370B1/en not_active Expired - Lifetime
- 1989-04-21 CA CA000597456A patent/CA1319959C/en not_active Expired - Fee Related
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4410955A (en) * | 1981-03-30 | 1983-10-18 | Motorola, Inc. | Method and apparatus for digital shaping of a digital data stream |
Non-Patent Citations (1)
Title |
---|
ELECTRICAL DESIGN NEWS, vol. 34, no. 2, 19th January 1989, pages 149-155, Newton, Ma, US; G. DOVEL: "FFT analyzers make spectrum analysis a snap" * |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0344794A2 (en) * | 1988-06-03 | 1989-12-06 | Hughes Aircraft Company | Apparatus and method for processing simultaneous radio frequency signals |
EP0344794A3 (en) * | 1988-06-03 | 1991-01-09 | Hughes Aircraft Company | Apparatus and method for processing simultaneous radio frequency signals |
WO2000035087A1 (en) * | 1998-12-08 | 2000-06-15 | Siemens Medical Systems, Inc. | Real-time technique for reducing the settling time of a high pass filter |
US6249796B1 (en) | 1998-12-08 | 2001-06-19 | Siemens Medical Systems, Inc. | Real-time technique for reducing the settling time of a high pass filter |
WO2003001351A2 (en) * | 2001-06-22 | 2003-01-03 | Sun Microsystems, Inc. | METHOD FOR SMOOTHING dI/dT NOISE DUE TO CLOCK TRANSITIONS |
WO2003001351A3 (en) * | 2001-06-22 | 2004-03-25 | Sun Microsystems Inc | Method for smoothing dI/dT noise due to clock transitions |
Also Published As
Publication number | Publication date |
---|---|
DE68917641T2 (en) | 1995-04-13 |
EP0343370A3 (en) | 1990-09-19 |
EP0343370B1 (en) | 1994-08-24 |
ES2058376T3 (en) | 1994-11-01 |
AU612823B2 (en) | 1991-07-18 |
DE68917641D1 (en) | 1994-09-29 |
AU3316389A (en) | 1989-10-26 |
CA1319959C (en) | 1993-07-06 |
US4958361A (en) | 1990-09-18 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US5235339A (en) | Radar target discrimination systems using artificial neural network topology | |
US7652617B2 (en) | Radar microsensor for detection, tracking, and classification | |
US4847817A (en) | Broadband sonar signal processor and target recognition system | |
RU2553279C1 (en) | Radar pulse detection using digital radar receiver | |
US10879946B1 (en) | Weak signal processing systems and methods | |
KR101435168B1 (en) | Method and system for detecting signal sources in a surveillance space | |
US6356600B1 (en) | Non-parametric adaptive power law detector | |
US20180083656A1 (en) | Blind Source Separation of Signals Having Low Signal-to-Noise Ratio | |
US5233354A (en) | Radar target discrimination by spectrum analysis | |
US4958361A (en) | Edge effect reduction by smoothing in digital receivers | |
KR20040007534A (en) | System and method for detection and feature extraction in passive coherent location applications | |
Madhusudhana et al. | Automatic detection of echolocation clicks based on a Gabor model of their waveform | |
US9866422B1 (en) | Methods of blind source separation filter resource management | |
US5793323A (en) | Two signal monobit electronic warfare receiver | |
CN111046025A (en) | Unmanned aerial vehicle signal detection method and device | |
RU2549207C2 (en) | Device for detecting hydroacoustic noise signals based on quadrature receiver | |
Stevenson et al. | Multiple-view time–frequency distribution based on the empirical mode decomposition | |
Erdogan et al. | Deinterleaving radar pulse train using neural networks | |
Mellinger et al. | A method for filtering bioacoustic transients by spectrogram image convolution | |
EP0535570B1 (en) | Transient detection processing, especially underwater acoustic signal recognition | |
Hood et al. | Improved passive acoustic band-limited energy detection for cetaceans | |
USH1726H (en) | CFAR time-frequency processor for signal detection and extraction in noise | |
KR20160043437A (en) | Method and apparatus for detecting an impulsive radar interference | |
Albaker et al. | Detection and parameters interception of a radar pulse signal based on interrupt driven algorithm | |
US5903883A (en) | Phase detection using neural networks |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 19890511 |
|
AK | Designated contracting states |
Kind code of ref document: A2 Designated state(s): DE ES FR GB IT SE |
|
RIN1 | Information on inventor provided before grant (corrected) |
Inventor name: KRIKORIAN, KAPRIEL A. Inventor name: ROSEN, ROBERT A. |
|
PUAL | Search report despatched |
Free format text: ORIGINAL CODE: 0009013 |
|
AK | Designated contracting states |
Kind code of ref document: A3 Designated state(s): DE ES FR GB IT SE |
|
RHK1 | Main classification (correction) |
Ipc: G01R 23/167 |
|
17Q | First examination report despatched |
Effective date: 19921021 |
|
ITF | It: translation for a ep patent filed |
Owner name: SOCIETA' ITALIANA BREVETTI S.P.A. |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): DE ES FR GB IT SE |
|
REF | Corresponds to: |
Ref document number: 68917641 Country of ref document: DE Date of ref document: 19940929 |
|
REG | Reference to a national code |
Ref country code: ES Ref legal event code: FG2A Ref document number: 2058376 Country of ref document: ES Kind code of ref document: T3 |
|
ET | Fr: translation filed | ||
EAL | Se: european patent in force in sweden |
Ref document number: 89106901.5 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 19950309 Year of fee payment: 7 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 19950315 Year of fee payment: 7 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: SE Payment date: 19950320 Year of fee payment: 7 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 19950322 Year of fee payment: 7 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: ES Payment date: 19950410 Year of fee payment: 7 |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
26N | No opposition filed | ||
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Effective date: 19960418 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SE Effective date: 19960419 Ref country code: ES Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 19960419 |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 19960418 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FR Effective date: 19961227 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DE Effective date: 19970101 |
|
EUG | Se: european patent has lapsed |
Ref document number: 89106901.5 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: ST |
|
REG | Reference to a national code |
Ref country code: ES Ref legal event code: FD2A Effective date: 19990301 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IT Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED. Effective date: 20050418 |