Analysis and detection algorithms for complex time zeros of bandlimited signals
Y.O. Al-Jalili
Abstract
Y.O. Al-Jalili
Abstract
Bandlimited signals can be expressed in terms of their time zeros, which leads to viewing these zeros as informational attributes of the signals in a similar way to Fourier coefficients and Nyquist samples. The zeros can be used to reconstruct the signal. It is shown that for any bandlimited signal, having a finite number of Nyquist samples, the time zeros can be uniquely used to describe the signal. Computer simulation provides illustrative examples concerning the different manifestation of real and complex zeros of bandlimited signals. Two novel techniques of locating the complex zeros of bandlimited signals are presented. The two techniques effectively are applied concurrently in an efficient algorithm which aims at minimising the amount of processing required to locate the complex zeros. Computer simulation results show the efficiency of the algorithm. Some practical implementations are also discussed.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Bandlimited signals can be expressed in terms of their time zeros, which leads to viewing these zeros as informational attributes of the signals in a similar way to Fourier coefficients and Nyquist samples. The zeros can be used to reconstruct the signal. It is shown that for any bandlimited signal, having a finite number of Nyquist samples, the time zeros can be uniquely used to describe the signal. Computer simulation provides illustrative examples concerning the different manifestation of real and complex zeros of bandlimited signals. Two novel techniques of locating the complex zeros of bandlimited signals are presented. The two techniques effectively are applied concurrently in an efficient algorithm which aims at minimising the amount of processing required to locate the complex zeros. Computer simulation results show the efficiency of the algorithm. Some practical implementations are also discussed.
Key concepts: Bandlimiting, SIGNAL (programming language), Algorithm, Nyquist–Shannon sampling theorem, Nyquist rate, Discrete-time signal, Fourier transform, Signal processing