東華大學圖書館 |

Multidimensional Radar Signal Processing Based on Sparse Fourier Transforms.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Multidimensional Radar Signal Processing Based on Sparse Fourier Transforms./
作者:	Wang, Shaogang.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2019,
面頁冊數:	175 p.
附註:	Source: Dissertations Abstracts International, Volume: 81-04, Section: B.
Contained By:	Dissertations Abstracts International81-04B.
標題:	Electrical engineering. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=13815009
ISBN:	9781088326435

Multidimensional Radar Signal Processing Based on Sparse Fourier Transforms.
Wang, Shaogang.

Multidimensional Radar Signal Processing Based on Sparse Fourier Transforms. - Ann Arbor : ProQuest Dissertations & Theses, 2019 - 175 p.

Source: Dissertations Abstracts International, Volume: 81-04, Section: B.

Thesis (Ph.D.)--Rutgers The State University of New Jersey, School of Graduate Studies, 2019.

This item must not be sold to any third party vendors.

The conventional radar signal processing typically employs the Fast Fourier Transform (FFT) to detect targets and identify their parameters. The sample and computational complexity of the N-point FFT are O(N) and O(N log N), respectively. In modern Digital Beamforming (DBF) and Multiple-Input Multiple-Output (MIMO) radars, N is large due to the increased dimensions of processing (i.e., range, Doppler and angle) and the need for high radar resolution in each dimension. Hence, the FFT-based radar processing is still challenging for DBF/MIMO radars of constrained computation resources, such as the state-of-the-art automotive radars. SFT is a family of low-complexity algorithms that implement Discrete Fourier Transform (DFT) for frequency-domain sparse signals. State-of-the-art SFT algorithms achieve sample complexity of O(K) and computational complexity of O(K log K) for a K-sparse signal. When K<<N, the sample and computational savings of SFT are significant as compared with that of the FFT. In radar applications, the number of radar targets is usually much smaller than the number of resolution cells in the multidimensional frequency domain, i.e., the radar signal is sparse in the frequency domain; thus, it is tempting to replace the FFT with SFT to reduce sample and computational complexity of signal processing. However, applying SFT in radar signal processing is not trivial for the following reasons:1) Most existing SFT algorithms are designed for one-dimensional, ideal signals, which are noiseless and contain on-grid frequencies; those SFT algorithms are not practical for radar applications as the radar signals are multidimensional, noisy, and contain off-grid frequencies.2) The signal processing schemes of different radar architectures need to be properly designed to support the application of SFT. When the radar signal is not naturally sparse, proper preprocessing is required to sparsify the signal.3) The application of SFT in radar signal processing involves tradeoffs between sample/computational savings and radar detection performance. Such tradeoff needs to be characterized and the design of various parameters of SFT algorithms need to be investigated to achieve the optimal tradeoff. This dissertation aims to formulate SFT-based frameworks for radar signal processing and address the above issues by proposing two new SFT algorithms, and adapting them to DBF and MIMO radars. The proposed SFT algorithms are the Robust Sparse Fourier Transform (RSFT) and MultidimensionAl Random Slice based Sparse Fourier Transform (MARS-SFT).RSFT extends the basic SFT algorithm to multidimensional, noisy signals that contain off-grid frequencies. By incorporating Neyman-Pearson detection, frequency detection in the RSFT does not require knowledge of the exact sparsity of the signal and is robust to noise. The computational savings versus detection performance tradeoff is investigated, and the optimal threshold is found by solving a constrained optimization problem. The application of RSFT in DBF and MIMO radars is investigated. A uniform processing scheme based on RSFT is proposed for MIMO radar that employs fast-time coded and slow-time coded pulse-compression waveform. Although RSFT-based radar signal processing achieves significant computational savings as compared to FFT-based processing, it does not offer sample complexity savings. To reduce sample as well as computational complexity, we propose MARS-SFT, a sparse Fourier transform for multidimensional, frequency-domain sparse signals, inspired by the idea of the Fourier projection-slice theorem. MARS-SFT identifies frequencies by operating on one-dimensional slices of the discrete-time domain data, taken along specially designed lines; those lines are parametrized by slopes that are randomly generated from a set at runtime. The DFTs of the data slices represent DFT projections onto the lines along which the slices were taken. On designing the line lengths and slopes so that they allow for orthogonal and uniform frequency projections, the multidimensional frequencies can be recovered from their projections with low sample and computational complexity. To apply MARS-SFT to real-world radar signal processing, which involves noisy signals and off-grid frequencies, we propose the robust MARS-SFT, and demonstrate its performance in digital beamforming automotive radar signal processing. In that context, the robust MARS-SFT is used to identify range, velocity and angular parameters of targets with low sample and computational complexity. Finally, we propose a new automotive radar architecture. Such radar achieves high resolution in range, range rate, azimuth and elevation angles of extended targets by leveraging two orthogonally-placed digital beamforming linear arrays of a few channels. A deep learning based beam matching method is developed for the proposed radar to address the beam association challenges. In sparse scenarios, the proposed robust MARS-SFT can be employed in the beamforming, and range-Doppler imaging procedures to reduce computation.

ISBN: 9781088326435Subjects--Topical Terms:

649834
Electrical engineering.
Subjects--Index Terms:

Multidimensional signal processing

Multidimensional Radar Signal Processing Based on Sparse Fourier Transforms.
LDR:06239nmm a2200325 4500 001 2268636
005 20200824072417.5
008 220629s2019 ||||||||||||||||| ||eng d
020 $a 9781088326435
035 $a (MiAaPQ)AAI13815009
035 $a AAI13815009
040 $a MiAaPQ $c MiAaPQ
100 1 $a Wang, Shaogang. $3 3545925
245 1 0 $a Multidimensional Radar Signal Processing Based on Sparse Fourier Transforms.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2019
300 $a 175 p.
500 $a Source: Dissertations Abstracts International, Volume: 81-04, Section: B.
500 $a Advisor: Petropulu, Athina P;Patel, Vishal M.
502 $a Thesis (Ph.D.)--Rutgers The State University of New Jersey, School of Graduate Studies, 2019.
506 $a This item must not be sold to any third party vendors.
520 $a The conventional radar signal processing typically employs the Fast Fourier Transform (FFT) to detect targets and identify their parameters. The sample and computational complexity of the N-point FFT are O(N) and O(N log N), respectively. In modern Digital Beamforming (DBF) and Multiple-Input Multiple-Output (MIMO) radars, N is large due to the increased dimensions of processing (i.e., range, Doppler and angle) and the need for high radar resolution in each dimension. Hence, the FFT-based radar processing is still challenging for DBF/MIMO radars of constrained computation resources, such as the state-of-the-art automotive radars. SFT is a family of low-complexity algorithms that implement Discrete Fourier Transform (DFT) for frequency-domain sparse signals. State-of-the-art SFT algorithms achieve sample complexity of O(K) and computational complexity of O(K log K) for a K-sparse signal. When K<<N, the sample and computational savings of SFT are significant as compared with that of the FFT. In radar applications, the number of radar targets is usually much smaller than the number of resolution cells in the multidimensional frequency domain, i.e., the radar signal is sparse in the frequency domain; thus, it is tempting to replace the FFT with SFT to reduce sample and computational complexity of signal processing. However, applying SFT in radar signal processing is not trivial for the following reasons:1) Most existing SFT algorithms are designed for one-dimensional, ideal signals, which are noiseless and contain on-grid frequencies; those SFT algorithms are not practical for radar applications as the radar signals are multidimensional, noisy, and contain off-grid frequencies.2) The signal processing schemes of different radar architectures need to be properly designed to support the application of SFT. When the radar signal is not naturally sparse, proper preprocessing is required to sparsify the signal.3) The application of SFT in radar signal processing involves tradeoffs between sample/computational savings and radar detection performance. Such tradeoff needs to be characterized and the design of various parameters of SFT algorithms need to be investigated to achieve the optimal tradeoff. This dissertation aims to formulate SFT-based frameworks for radar signal processing and address the above issues by proposing two new SFT algorithms, and adapting them to DBF and MIMO radars. The proposed SFT algorithms are the Robust Sparse Fourier Transform (RSFT) and MultidimensionAl Random Slice based Sparse Fourier Transform (MARS-SFT).RSFT extends the basic SFT algorithm to multidimensional, noisy signals that contain off-grid frequencies. By incorporating Neyman-Pearson detection, frequency detection in the RSFT does not require knowledge of the exact sparsity of the signal and is robust to noise. The computational savings versus detection performance tradeoff is investigated, and the optimal threshold is found by solving a constrained optimization problem. The application of RSFT in DBF and MIMO radars is investigated. A uniform processing scheme based on RSFT is proposed for MIMO radar that employs fast-time coded and slow-time coded pulse-compression waveform. Although RSFT-based radar signal processing achieves significant computational savings as compared to FFT-based processing, it does not offer sample complexity savings. To reduce sample as well as computational complexity, we propose MARS-SFT, a sparse Fourier transform for multidimensional, frequency-domain sparse signals, inspired by the idea of the Fourier projection-slice theorem. MARS-SFT identifies frequencies by operating on one-dimensional slices of the discrete-time domain data, taken along specially designed lines; those lines are parametrized by slopes that are randomly generated from a set at runtime. The DFTs of the data slices represent DFT projections onto the lines along which the slices were taken. On designing the line lengths and slopes so that they allow for orthogonal and uniform frequency projections, the multidimensional frequencies can be recovered from their projections with low sample and computational complexity. To apply MARS-SFT to real-world radar signal processing, which involves noisy signals and off-grid frequencies, we propose the robust MARS-SFT, and demonstrate its performance in digital beamforming automotive radar signal processing. In that context, the robust MARS-SFT is used to identify range, velocity and angular parameters of targets with low sample and computational complexity. Finally, we propose a new automotive radar architecture. Such radar achieves high resolution in range, range rate, azimuth and elevation angles of extended targets by leveraging two orthogonally-placed digital beamforming linear arrays of a few channels. A deep learning based beam matching method is developed for the proposed radar to address the beam association challenges. In sparse scenarios, the proposed robust MARS-SFT can be employed in the beamforming, and range-Doppler imaging procedures to reduce computation.
590 $a School code: 0190.
650 4 $a Electrical engineering. $3 649834
650 4 $a Fourier transforms. $3 3545926
650 4 $a Radar. $3 594027
653 $a Multidimensional signal processing
653 $a Radar signal processing
653 $a Sparse Fourier transform
690 $a 0544
710 2 $a Rutgers The State University of New Jersey, School of Graduate Studies. $b Electrical and Computer Engineering. $3 3429082
773 0 $t Dissertations Abstracts International $g 81-04B.
790 $a 0190
791 $a Ph.D.
792 $a 2019
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=13815009