A Fast Nyquist Zone Index Estimation Algorithm for Pulse Radar Signal Based on Non-cooperative Nyquist Folding Receiver
Nyquist folding receiver (NYFR) is a novel wideband receiving structure. The NYFR uses the non-uniform sampling to fold the monitoring bandwidth and the input carrier frequency is transformed into an added modulation parameter. The added modulation parameter is called as the Nyquist zone (NZ) index. Under the non-cooperative receiving condition, the NYFR outputs will become hybrid modulated signals because of the unknown NZ index. To simplify the signal processing of the NYFR, a feasible way is to estimate the NZ index directly without the prior information of the signal modulation types and demodulate the hybrid modulated signal using the estimated NZ index. In this paper, a fast estimation algorithm is proposed to get the NZ index directly. The basic pulse radar signals are considered and they are constant frequency signal, binary phase coded signal and linear frequency modulation signal. Compared with the existing algorithm, the simulation results demonstrate the merits of the proposed approach.
KeywordsNyquist folding receiver Parameter estimation Basic pulse radar signal Hybrid modulated signal Non-cooperative receiving
This work was supported National Natural Science Foundation of China (61571088).
- 2.Tsui, J., Cheng, C.: Digital Techniques for Wideband Receivers, 3rd edn. SciTech Publishing, New York (2015). An imprint of the IET:16-30Google Scholar
- 5.Zeng, D., Zeng, X., Tang, B.: Nyquist folding receiver for the interception of frequency agile radar signal. Int. J. Phys. Sci. 7(9), 1454–1460 (2012)Google Scholar
- 6.Qiu, Z., Wang, P., Zhu, J., Tang, B.: A parameter estimation algorithm for LFM/BPSK hybrid modulated signal intercepted by Nyquist folding receiver. EURASIP J. Adv. Signal Process. 90 (2016)Google Scholar
- 7.Qian, Z., Cao, L., Su, W., et al.: Recent Advances in Computer Science and Information Engineering, pp. 659–664. Springer, Heidelberg (2012)Google Scholar
- 10.Golnb, G., Van Loan, C.: Matrix computations, pp. 19–20. The Johns Hopkins University Press, Baltimore (2001)Google Scholar