適用於分散式壓縮感知超寬頻雷達系統之低複雜度定位演算法與架構

Low-Complexity Localization Algorithm and Architecture for Distributed Compressive Sensing Ultra-Wideband Radar System

黃韋晋(Wei-Chin Huang)

指導教授 ： 黃元豪

國立清華大學/電機資訊學院/通訊工程研究所/碩士(2017年)

摘要

近年來，壓縮感知(Compressive Sensing)是一個熱門的研究主題。壓縮感知的基本概念是基於信號本身的稀疏特性以及信號量測方法的不相關性所組成。可藉由減少取樣率以移除冗餘資訊的信號特性，使壓縮感知的技術具有廣泛的應用。在雷達系統中，matched filter以及ADC的頻寬需求非常高，壓縮感知的技術能改善此問題。所有壓縮感知的問題都在追求高速度(低運算複雜度)與完美重建表現，例如Orthogonal Matching Pursuit(OMP)是其中一種熱門的訊號重建演算法。壓縮感知技術的核心部分為訊號重建演算法。然而，訊號重建的複雜度會隨著壓縮感知雷達的解析度而增加，因此複雜度為壓縮感知雷達應用中，重要的議題。這份研究提出一個適用於分散式壓縮感知超寬頻雷達系統之低複雜度定位演算法與架構。提出的演算法可有效降低運算上的複雜度，縮短運算時間。也可與兩階段訊號重建演算法結合，擁有比傳統OMP更低的複雜度以及更好的定位效能。其節省的運算耗費時間與稀疏性呈線性關係。模擬中使用分散式雷達系統可減少更多的定位死角，提升涵蓋能力。最後為此研究所提出多向量選取訊號重建演算法的硬體架構並驗證於FPGA。

關鍵字

定位演算法 ； 超寬頻雷達系統 ； 壓縮感知

並列摘要

In recent years, Compressive Sensing (CS) has been a hot research topic. The idea
of compressive sensing is based on sparsity and incoherence, which is related to signal
characteristic and measurement scheme respectively. Owing to signal characteristic of
removing redundant information by reducing the sampling rate, CS technique has a wide
range of applications. In the radar system, matched lter and the bandwidth requirement
of analog to digital converter are very high, which can improve radar system by CS
technique. All the CS problems pursue the high speed (low computational complexity)
and high signal reconstruction performance, for example, orthogonal matching pursuit
(OMP) is one of the popular algorithms. The signal reconstruction algorithm is the
essentials of CS technique. Nevertheless, the complexity of reconstruction algorithms
for CS radar increases with the resolution, which is the critical issue of CS radar applications.
This study proposed Low-Complexity Localization Algorithm and Architecture for Distributed Compressive Sensing Ultra-Wideband Radar System. Proposed algorithm can reduce computation complexity efficiently, so it has a shorter operation time.
Furthermore, this study also presents to combine with Two-Stage algorithm, which has lower complexity and better positioning performance than conventional OMP algorithm.
The saving computation time and sparsity is linear relationship. We use the distributed radar system, in order to reduce the positioning blind spot, and improve the coverage ability in the simulation. The architecture of the proposed algorithm is implemented and veried by FPGA in the end.

並列關鍵字

Localization Algorithm ； Ultra-Wideband Radar System ； Compressive Sensing

參考文獻

[1] E. Candes and M. Wakin, "An introduction to compressive sampling," Signal Processing Magazine, IEEE, vol. 25, no. 2, pp. 21-30, 2008.

[2] D. Donoho, "Compressed sensing," Information Theory, IEEE Transactions on, vol. 52, no. 4, pp. 1289-1306, 2006.

[3] S. Qaisar, R. Bilal, W. Iqbal, M. Naureen, and S. Lee, "Compressive sensing: From theory to applications, a survey," Communications and Networks, Journal of, vol. 15, no. 5, pp. 443-456, Oct 2013.

[4] M. Wakin, "Sparse image and signal processing: Wavelets, curvelets, morphological diversity (starck, j.-l., et al; 2010) [book reviews]," Signal Processing Magazine, IEEE, vol. 28, no. 5, pp. 144-146, 2011.

[5] M. Mishali, Y. Eldar, O. Dounaevsky, and E. Shoshan, "Xampling: Analog to digital at sub-nyquist rates," Circuits, Devices Systems, IET, vol. 5, no. 1, pp.8-20, 2011.