Name
Abstract | ||
|---|---|---|
In this paper we consider signals consisting of a finite though unknown number of periodic time-interleaved pulse trains. For such signals, we present a novel approach for determining both the number of pulse trains present and the frequency of each pulse train. Our approach requires only the time of arrival data of each pulse. It is robust to noisy time of arrival data and missing pulses, and above all is very computationally efficient. If N is the number of pulses being processed, the computation required is of the order of N log N. |
Year | Venue | Keywords |
|---|---|---|
1996 | Signal Processing and Its Applications, 1996. ISSPA 96., Fourth International Symposium | cyclic redundancy check,frequency,signal processing,quantum computing,robustness,adaptive systems,time of arrival,spectrum,application software |
Field | DocType | Volume |
Signal processing,Computer science,Real-time computing,Pulse (signal processing),Robustness (computer science),Artificial intelligence,Time of arrival,Computation,Pattern recognition,Algorithm,Pulse wave,Train,Periodic graph (geometry) | Conference | 1 |
ISBN | Citations | PageRank |
0-7803-4114-7 | 1 | 0.72 |
References | Authors | |
1 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert Orsi | 1 | 1 | 0.72 |
| JOHN B. MOORE | 2 | 412 | 84.61 |
| Robert Mahony | 3 | 23 | 5.69 |