臺灣博碩士論文加值系統

為了實現大規模機器間之通信與實時的工業監控，低延遲一直是未來無線通信的關鍵設計問題。在本篇論文中，我們考慮以非正交多工技術來達到低延遲之兩通訊系統，壓縮式用戶識別系統為討論由多用戶對單一基地台傳輸所組成的上鏈傳輸系統，我們考慮在接收端疊加的訊號中找出活動用戶之身分，在頻率選擇通道之假設下，我們提出以壓縮感測為基礎的上鏈活動用戶偵測方案，達到降低延遲之效果，具體而言，每個用戶發送之前導信號並沒有貼尋環字首(Cyclic prefix)。在訊號還原方面我們使用21/-混合規範最小化(21/-mixed norm minimization)的凸優化問題(convex optimization problem)來還原活動用戶之身分與估計通道。透過區塊受限保距特性(block restricted isometry property)我們推導出更為嚴格的系統表現之上界。
另一個非正交多工技術稱為稀疏碼多工(Sparse Code Multiple Access，簡稱SCMA)是未來5G時代極具潛力的非正交多工技術，經由明智地設計傳送之稀疏碼字並在解調端使用信息傳遞演算法(Message Passing Algorithm，簡稱MPA)達到在高頻譜效率下依然有良好系統表現的特性。而SCMA技術之瓶頸主要在於MPA時現之複雜度。在本篇論文中，將介紹SCMA系統的運作原理，並詳細解釋MPA演算法的運作與實現方法以及提出一個基於門檻判定之MPA來降低複雜度；電腦模擬的結果將說明所提出方案之效能

To enable massive machine-type communication or real-time industrial monitoring and control for future 5G, low latency has been a key design issue for future wireless communication. In this thesis we consider two non-orthogonal multiple access systems for low-latency purpose. In the first system, finding the active user identities from the superimposed signals received at base station (BS) can be formulated. We proposes a CS-based uplink active user detection scheme over frequency selective channels, with the purpose of reducing latency. Specifically, during the user detection phase, the preamble sequence is transmitted directly without CP insertion. 21/-mixed norm minimization is used for user identification and channel estimation. A tighter upper bound of performance guarantee is derived by using block restricted isometry property (Block RIP).
A commonly considered non-orthogonal multiple access is sparse code multiple access (SCMA), which has been identified as a potential solution for future 5G multiple access air interface. Through judicious design of sparse transmit codewords and by means of message-passing algorithm (MPA) implemented at the receiver, SCMA is capable of offering pretty good link quality at high spectral efficiency. A bottleneck for realizing SCMA into the current standards lies in the computationally demanding MPA. In the second part of this thesis, we will elaborate on how to implement an SCMA system and describe the process of MPA decoder in detail. A threshold-based technique is proposed to obtain a low-complexity implementation of MPA. Computer simulations are used to illustrate the performance of the proposed scheme.

中文摘要 ........................................i
英文摘要.........................................ii
誌謝............................................iii
第一章 緒論 .................................... 1
第二章 壓縮式用戶識別系統之數學模型與基本假設...... 4
2.1數學模型..................................... 4
2.2基本假設..................................... 6
2.3與文獻 [3]系統之比較.......................... 7
第三章 壓縮式感測架構與效能分析................... 9
3.1壓縮式感測技術簡介............................ 9
3.2 系統效能分析................................ 15
3.3 模擬結果 ................................... 21
第四章 低複雜SCMA系統之數學模型與基本假設......... 28
4.1數學模型..................................... 28
4.2基本假設..................................... 31
第五章 MPA演算法................................ 34
第六章 低複雜度MPA .............................. 38
第七章 模擬結果.................................. 41
7.1與OFDM系統之比較............................. 41
7.2在不同過載因子與調變方案下之模擬............... 44
7.3MPA演算法運行時間之模擬....................... 49
7.4低複雜度MPA之模擬............................. 51
第八章 結論 .................................... 54
第九章 附錄 .................................... 55
A. 定理3.2.4之證明.............................. 55
B. 定理3.2.5之證明.............................. 61
C. 定理3.2.6之證明.............................. 62
參考文獻 ....................................... 72
自傳 ........................................... 76

[1] NGMN 5G white paper, https://www.ngmn.org/uploads/media/ NGMN_5G_White_Paper_V1_0.pdf.

[2] Y. C. Eldar and G. Kutyniok, Compressed sensing: Theory and applications. New York: Cambridge Univ. Press, 2012.

[3] N. M. Gowda and A. P. Kannu, "Interferer identification in HetNets using compressive sensing framework," IEEE Trans. Communications, vol. 61, no. 11, pp. 4780-4787, November 2013.

[4] J. P. Hong, W. Choi and B. D. Rao, "Sparsity controlled random multiple access with compressed sensing," IEEE Trans. Wireless Communications, vol. 14, no. 2, pp. 998-1010, Feb. 2015.

[5] F. Fazel, M. Fazel and M. Stojanovic, "Random access compressed sensing over fading and noisy communication channels," IEEE Trans. Wireless Communications, vol. 12, no. 5, pp. 2114-2125, May 2013.

[6] F. Fazel, M. Fazel and M. Stojanovic, "Impact of fading on random access compressed sensing," 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR), Pacific Grove, CA, pp. 408-412, 2011.

[7] Y. C. Eldar and M. Mishali, "Robust recovery of signals from a structured union of subspaces," IEEE Trans. Information Theory, vol. 55, no. 11, pp. 5302-5316, Nov. 2009.

[8] L. Dai, B. Wang, Y. Yuan, S. Han, C. l. I and Z. Wang, "Non-orthogonal multiple access for 5G: solutions, challenges, opportunities, and future research trends," IEEE Communications Magazine, vol. 53, no. 9, pp. 74-81, September 2015.

[9] L. Lu, Y. Chen, W. Guo, H. Yang, Y. Wu and S. Xing, "Prototype for 5G new air interface technology SCMA and performance evaluation," China Communications, vol. 12, no. Supplement, pp. 38-48, December 2015.

[10] R. Hoshyar, F. P. Wathan and R. Tafazolli, "CTH06-4:
Novel low-density signature structure for synchronous DS-CDMA systems," IEEE Globecom 2006, San Francisco, CA, pp. 1-5, 2006.

[11] F. R. Kschischang, B. J. Frey and H. A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Information Theory, vol. 47, no. 2, pp. 498-519, Feb 2001.

[12] 3GPP Technical Specifcation 36.211, ‘Physical channels and modulation (Release 10)’, www.3gpp.org.

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

[14] Huang, Hong, et al. "Applications of compressed sensing in communications networks," arXiv:1305.3002, 2013.

[15] R. G. Baraniuk, "Compressive Sensing [Lecture Notes]," IEEE Signal Processing Magazine, vol. 24, no. 4, pp. 118-121, July 2007.

[16] D. Baron, M.F. Duarte, M.B. Wakin, S. Sarvotham, R.G. Baraniuk, "Distributed compressive sensing," ECE Department Tech. Report TREE-0612, Rice University,
Houston, TX, Nov. 2006.

[17] E. Candes, J. Romberg, and T. Tao. "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inform. Theory, vol.52, no.2, pp.489-509, 2006.

[18] D. Donoho, “Compressed sensing,”IEEE Trans. Inform. Theory, vol. 52, no. 4, pp. 1289–1306, Apr. 2006.

[19] E. Candes, "The restricted isometry property and its implications for compressed sensing," Comptes Rendus Mathematique, Paris, vol. 346, no. 9-10, pp. 589-592, May 2008.

[20] A. Ganesh, Z. Zhou, and Y. Ma, “Separation of a subspace-sparse signal: algorithms and conditions,”Proc. IEEE International Conf. Acoust., Speech and Signal Process, pp. 3141–3144, 2009.

[21] Y. C. Eldar and H. Rauhut, "Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation," IEEE Trans. Information Theory, vol. 56, no. 1, pp. 505-519, Jan. 2010.

[22] M. Stojnic, "Block-length dependent thresholds for ℓ2/ℓ1-optimization in block-sparse compressed sensing," 2010 IEEE International Conference on Acoustics, Speech and Signal Processing, Dallas, TX, pp. 3918-3921, 2010.

[23] A. Ziaei, A. Pezeshki, S. Bahmanpour and M. R. Azimi-Sadjadi, "Compressed sensing of different size block-sparse signals: efficient recovery," 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, pp. 818-821, 2010.

[24] Z. Zeinalkhani and A. H. Banihashemi, "Iterative Reweighted ℓ2/ℓ1 Recovery Algorithms for Compressed Sensing of Block Sparse Signals," IEEE Trans. Signal Processing, vol. 63, no. 17, pp. 4516-4531, Sept.1, 2015..

[25] M. Stojnic, " ℓ2/ℓ1-Optimization in Block-Sparse Compressed Sensing and Its Strong Thresholds," IEEE Journal of Selected Topics in Signal Processing, vol. 4, no. 2, pp. 350-357, April 2010.

[26] Kowalski, Matthieu, and Bruno Torrésani. "Sparsity and persistence: mixed norms provide simple signal models with dependent coefficients." Signal, image and video processing, vol. 3, no. 3, pp. 251-264, 2009.

[27] H. Nikopour and H. Baligh, "Sparse code multiple access," 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), London, pp. 332-336, 2013.

[28] IST-WINNER II, D1.1.2 "WINNER II channel models," ver 1.0, Sep 2007, https://www.istwinner.org/WINNER2-Deliverables/.

[29] Altera Innovate Asia website, Presentation "1 st 5G algorithm innovation competition-ENVl.O-SCMA", Web: http://www. innovateasia.com/Sglen/gp2.
html.

[30] T. Richardson and R. Urbanke, "The capacity of low-density paritycheck codes under message-passing decoding," IEEE Trans. Information Theory, vol. 47, no. 2, pp. 599–618, Feb. 2001.

[31] C. Xiaoguang, J. Xu, W. Zhilu and M. Bo, "A low complexity iterative multiuser detector for LDPC-coded TDRSS return link MA service," 2016 IEEE 13th International Conference on Signal Processing (ICSP), Chengdu, pp. 1214-1218, 2016.

[32] S. H. Rezenom and F. Takawira, "Iterative Low Complexity Algorithm for LDPC Systems in the Presence of Phase Noise," IEEE Wireless Communications Letters, 2017.

[33] F. Angarita, J. Valls, V. Almenar and V. Torres, "Reduced-Complexity Min-Sum Algorithm for Decoding LDPC Codes With Low Error-Floor," IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 61, no. 7, pp. 2150-2158, July 2014.

[34] Y. Du, B. Dong, Z. Chen, J. Fang, P. Gao and Z. Liu, "Low-Complexity Detector in Sparse Code Multiple Access Systems," IEEE Communications Letters, vol. 20, no. 9, pp. 1812-1815, Sept. 2016.

[35] L. Yang, Y. Liu and Y. Siu, "Low Complexity Message Passing Algorithm for SCMA System," IEEE Communications Letters, vol. 20, no. 12, pp. 2466-2469, Dec. 2016..

[36] A. Bayesteh, H. Nikopour, M. Taherzadeh, H. Baligh and J. Ma, "Low Complexity Techniques for SCMA Detection," 2015 IEEE Globecom Workshops (GC Wkshps), San Diego, CA, pp. 1-6, 2015.

[37] M. Taherzadeh, H. Nikopour, A. Bayesteh and H. Baligh, "SCMA codebook design," 2014 IEEE 80th Vehicular Technology Conference (VTC2014-Fall), Vancouver, BC, pp. 1-5, 2014.

[38] V. P. Klimentyev and A. B. Sergienko, "Detection of SCMA signal with channel estimation error", 2016 18th Conference of Open Innovations Association and Seminar on Information Security and Protection of Information Technology (FRUCT-ISPIT), St. Petersburg, pp. 106-112, 2016.

[39] W. U. Bajwa, J. Haupt, G. Raz, and R. Nowak, “Compressed channel sensing,” Proc. 42nd Annu. Conf. Information Sciences and Systems (CISS’08), Princeton, NJ, pp. 19-21, Mar. 2008.

[40] L. H. Chang and J. Y. Wu, "An improved RIP-based performance guarantee for sparse signal reconstruction with noise via orthogonal matching pursuit," 2014 International Symposium on Information Theory and its Applications, Melbourne, VIC, pp. 70-74, 2014.