https://scholars.lib.ntu.edu.tw/handle/123456789/122464
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor | 許大山 | en |
dc.contributor | 臺灣大學:電信工程學研究所 | zh_TW |
dc.contributor.author | 施凱挺 | zh |
dc.contributor.author | Shih, Kai-Ting | en |
dc.creator | 施凱挺 | zh |
dc.creator | Shih, Kai-Ting | en |
dc.date | 2006 | en |
dc.date.accessioned | 2007-11-27T11:24:15Z | - |
dc.date.accessioned | 2018-07-05T04:04:26Z | - |
dc.date.available | 2007-11-27T11:24:15Z | - |
dc.date.available | 2018-07-05T04:04:26Z | - |
dc.date.issued | 2006 | - |
dc.identifier | en-US | en |
dc.identifier.uri | http://ntur.lib.ntu.edu.tw//handle/246246/58828 | - |
dc.description.abstract | 當我們面對一個包含了內部錯誤更正碼和外部錯誤更正碼的串接編碼系統時,傳統的解法是分成兩個階段。首先,內部解碼器根據其所使用的準則來找出最好的碼字,然後將這最好的碼字傳遞給外部解碼器來檢查是否正確。然而,這種傳統解法的效能並不是最好的。如果將內部解碼器改成不只產生最好的碼字,同時還產生多個很有可能也是對的碼字給外部解碼器,則串接編碼系統的效能可以有效的得到提升。 在本論文中,我們提出一個新的演算法:「干擾解碼演算法」。干擾解碼演算法藉由給予內部解碼器許多受到干擾的接收信號來產生其他很有可能的碼字。干擾解碼演算法的觀念可適用於大部分的內部碼和外部碼的組合。因為干擾解碼演算法不需要使用精緻複雜的內部解碼器,所以非常的適合直接在IC 上的實現,且相較於傳統的解法,干擾解碼演算法可以至少提升1 dB 的效能。 | zh_TW |
dc.description.abstract | We consider a concatenated coded system consists of an inner error correcting code and an outer error detecting code. In a conventional decoding scheme, the inner decoder produces the best codeword from its perspective. The best codeword is then checked by the outer decoder. The performance of the concatenated coded system can be improved by having the inner decoder produce not only the most likely candidate but also other highly likely candidates. In this paper, we propose a new algorithm called "perturbed decoding algorithm"(PA). In PA, other highly likely candidate is produced by feeding the inner decoder with slightly perturbed versions of the received signal. The concept of PA is compatible with most combinations of inner code and outer code. Because PA does not require the use of a sophisticated inner decoder, it is straightforward to implement in silicon technology. From our simulation, PA can achieve a performance gain greater than 1 dB. | en |
dc.description.tableofcontents | 1 Introduction 1 1.1 Motivation . . . . . . . . . . . 1 1.2 Background and Related works . . . . . 2 1.3 Contribution and Organization . . . . . 3 2 Perturbed decoding algorithm 5 2.1 Conventional concatenated code system . . . . . 5 2.2 Inner decoder which produces multiple candidate codewords . . . . . 6 2.3 Perturbed decoding algorithm . . . . . . . 8 2.4 Two operational parameters for PA . . . . . . . 10 3 Performance analysis of perturbed decoding algorithm 11 3.1 Single-bit error probability of PA . . . . . . . . 11 3.1.1 Problem formulation . . . . . . . . . . 11 3.1.2 Four joint probabilities . . . . . . . . 13 3.1.3 Single-bit error probability of PA . . . . . . 15 3.2 The uncoded frame error probability of PA . . . . . 17 3.2.1 Problem formulation . . . . . . . . . . . 17 3.2.2 The uncoded frame error probability of PA . . . . 19 3.3 The coded frame error probability of . . . . . . . 22 3.3.1 Simulation environment and parameters . . . . . 23 3.3.2 The coded frame error probability of PA . . . . 24 3.3.3 Effect of the power of perturbation noise . . . 25 3.3.4 Observed statistics on the number of re-decoding . . 27 3.4 Effect of using CRC . . . . . . . . . . . . . . . . 28 4 Complexity Comparison 31 4.1 List decoding algorithm . . . . . . . . . . . . . 31 4.2 Storage requirement and average decoding time . . . . . . . 33 5 Conclusions 34 5.1 Conclusions . . . . . . . . . . . . . . . . . . . 34 5.2 Future works . . . . . . . . . . . . . . 35 Bibliography 37 A How to choose the combination of inner and outer codes 39 A.1 Problem formulation . 40 A.2 Undetected error probability . . . . . . . . . . 41 A.3 Conclusions . . . . . . . . . . . . . . . . . 42 B The draft analysis for the upper bound on coded FER of PA 44 B.1 Review the upper bound on FER of convolutional code . . 44 B.2 The upper bound on coded FER of PA . . . . . . . . 46 | en |
dc.format.extent | 599000 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language | en-US | en |
dc.language.iso | en_US | - |
dc.subject | 干擾 | en |
dc.subject | 列表解碼演算法 | en |
dc.subject | 串接系統 | en |
dc.subject | perturbed | en |
dc.subject | noise | en |
dc.subject | chase algorithm | en |
dc.subject | list decoding algorithm | en |
dc.title | 針對串接錯誤更正和錯誤偵測碼系統的干擾解碼演算法 | zh |
dc.title | Perturbed decoding algorithm for concatenated error correcting and detecting codes systems | en |
dc.type | thesis | en |
dc.identifier.uri.fulltext | http://ntur.lib.ntu.edu.tw/bitstream/246246/58828/1/ntu-95-R93942096-1.pdf | - |
dc.relation.reference | [1] N. Seshadri and C.-E.W. Sundberg, List Viterbi decoding algorithms with applications," IEEE Trans. Commun., vol. 42, pp. 311-323, Feb-Apr 1994. [2] D. Chase, Class of algorithms for decoding block codes with channel measurement informa- tion," IEEE Trans. Information Theory., vol. 18, pp. 170-182, Jan 1972 [3] A. Valembois, Fast soft-decision decoding of linear codes,"IEEE International Symposium, pp.91, June 2000. [4] W. Jin and M. Fossorier, Reliability-based list decoding with multiple bases,"Proc. 43rd An- nual Allerton Conf. Commun., Contr. and Comput., Sept. 2005. [5] Steven Kay, Can detectability be improved by adding noise? "IEEE Signal Processing Lett., vol. 7, pp. 8V10, Jan. 2000. [6] T.Klove and M. Miller, The detection of errors after error-correction decoding," IEEE Trans. Commun., vol.com-32, np.5 pp. 511-517, May 1984. [7] C.F. Leanderson and C.-E.W. Sundberg, The max-log list algorithm (MLLA)-a list-sequence decoding algorithm that provides soft-symbol output," IEEE Trans. Commun., vol. 53, pp. 433-444, March 2005. [8] C. Nill and C.-E.W. Sundberg, List and soft symbol output Viterbi algorithms: extensions and comparisons," IEEE Trans. Commun., vol. 43, pp. 277-287, Feb-Mar-Apr 1995. [9] S. Lin and DJ Costello, Jr., Error Control Coding, 2nd ed. Pearson Prentice-Hall 2004. [10] G. Caire and E. Viterbo,Upper bound on the frame error probability of terminated trellis codes,"IEEE Comm. Letters, vol. 2, pp. 24, Jan. 1998. | en |
item.openairetype | thesis | - |
item.fulltext | with fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_46ec | - |
item.grantfulltext | open | - |
item.languageiso639-1 | en_US | - |
item.cerifentitytype | Publications | - |
顯示於: | 電信工程學研究所 |
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
ntu-95-R93942096-1.pdf | 23.31 kB | Adobe PDF | 檢視/開啟 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。