請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/28307
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 顧孟愷 | |
dc.contributor.author | Chin-Wen Chang | en |
dc.contributor.author | 張錦文 | zh_TW |
dc.date.accessioned | 2021-06-13T00:04:50Z | - |
dc.date.available | 2008-08-28 | |
dc.date.copyright | 2007-08-28 | |
dc.date.issued | 2007 | |
dc.date.submitted | 2007-07-29 | |
dc.identifier.citation | [1] P. Robert, A. Darwish, and J. Reed, “MPEG video quality prediction in a
wireless system,” Vehicular Technology Conference, 1999 IEEE 49th, vol. 2, 1999. [2] J. Chakareski and P. Frossard, “Rate-Distortion Optimized Bandwidth Adaptation for Distributed Media Delivery,” Multimedia and Expo, 2005. ICME 2005. IEEE International Conference on, pp. 763–766, 2005. [3] R. Gallager, “Low-density parity-check codes,” Information Theory, IEEE Transactions on, vol. 8, no. 1, pp. 21–28, 1962. [4] D. MacKay and R. Neal, “Near Shannon limit performance of low density parity check codes,” Electronics Letters, vol. 33, no. 6, pp. 457–458, 1997. [5] S. Chung, G. Forney Jr, T. Richardson, R. Urbanke, A. Inc, and M. Chelmsford, “On the design of low-density parity-check codes within 0.0045 dB ofthe Shannon limit,” Communications Letters, IEEE, vol. 5, no. 2, pp. 58–60, 2001. [6] F. Kschischang, B. Frey, and H. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 498– 519, 2001. [7] G. Forney, “Concatenated codes.” 1965. [8] H. Behairy and S. Chang, “Parallel concatenated Gallager codes,” Electronics Letters, vol. 36, no. 24, pp. 2025–2026, 2000. [9] ——, “Parallel concatenated Gallager codes for CDMA applications,” Global Telecommunications Conference, 2001. GLOBECOM’01. IEEE, vol. 2, 2001. [10] ——, “Analysis and design of parallel concatenated Gallager codes,” Electronics Letters, vol. 38, no. 18, pp. 1039–1040, 2002. [11] ——, “On the design, simulation and analysis of parallel concatenated Gallager codes,” Communications, 2002. ICC 2002. IEEE International Conference on, vol. 3, 2002. [12] J. Hagenauer, E. Offer, and L. Papke, “Iterative decoding of binary block and convolutional codes,” Information Theory, IEEE Transactions on, vol. 42, no. 2, pp. 429–445, 1996. [13] R. Shao, S. Lin, and M. Fossorier, “Two simple stopping criteria for turbo decoding,” Communications, IEEE Transactions on, vol. 47, no. 8, pp. 1117– 1120, 1999. [14] Y. Wu, B. Woerner, and W. Ebel, “A simple stopping criterion for turbo decoding,” Communications Letters, IEEE, vol. 4, no. 8, pp. 258–260, 2000. [15] F. Zhai and I. Fair, “New error detection techniques and stopping criteria for turbodecoding,” Electrical and Computer Engineering, 2000 Canadian Conference on, vol. 1, 2000. [16] X. Xiaojian, L. Jin, and H. Hanying, “A low-complexity stopping criterion for the decoder of parallel concatenated LDPC codes.” [17] A. Albanese, J. Blomer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” Information Theory, IEEE Transactions on, vol. 42, no. 6, pp. 1737–1744, 1996. [18] J. Ha and S. McLaughlin, “Optimal puncturing distributions for ratecompatible low-density parity-check codes,” Information Theory, 2003. Proceedings. IEEE International Symposium on, pp. 233–233. [19] J. Ha, J. Kim, and S. McLaughlin, “Rate-Compatible Puncturing of Low- Density Parity-Check Codes,” IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 50, no. 11, p. 2825, 2004. [20] M. Yazdani and A. Banihashemi, “On construction of rate-compatible lowdensity parity-check codes,” Communications, 2004 IEEE International Conference on, vol. 1, 2004. [21] J. Ha, J. Kim, and S. McLaughlin, “Puncturing for finite length low-density parity-check codes,” Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on. [22] J. Ha, J. Kim, D. Klinc, and S. McLaughlin, “Rate-compatible punctured low-density parity-check codes with short block lengths,” Information Theory, IEEE Transactions on, vol. 52, no. 2, pp. 728–738, 2006. [23] N. Vellambi, R. Badri, and F. Fekri, “Rate-Compatible Puncturing of Finite- Length Low-Density Parity-Check Codes,” Information Theory, 2006 IEEE International Symposium on, pp. 1129–1133, 2006. [24] O. Harmanci and A. Tekalp, “Rate-Distortion Optimal Video Transport Over IP Allowing Packets With Bit Errors,” Image Processing, IEEE Transactions on, vol. 16, no. 5, pp. 1315–1326, 2007. [25] Y. Lee and R. Komiya, “A low-complexity unequal error protection of H. 264/AVC video using adaptive hierarchical QAM,” Consumer Electronics, IEEE Transactions on, vol. 52, no. 4, pp. 1153–1158, 2006. [26] P. Radosavljevic, A. de Baynast, and J. Cavallaro, “Optimized Message Passing Schedules for LDPC Decoding,” Signals, Systems and Computers, 2005. Conference Record of the Thirty-Ninth Asilomar Conference on, pp. 591–595, 2005. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/28307 | - |
dc.description.abstract | Transmitting visible applications over wireless networks is
a challenging work. Bandwidth, channel noise, and heterogeneous receivers are critical factors which will affect the quality of visible applications. Thus cross-layer design of wireless network is proposed to address these problems. In general cross-layer design, Unequal Error Protection(UEP) is an important work to address noisy transmission channel and adaptive transmission rate. So we want to propose an UEP scheme using Parallel Concatenated LDPC Code(PCGC). PCGC is a powerful code whose BER performance is better than LDPC code under some constraints. In this thesis, we propose a new kind of stopping criterion to reduce long latency of PCGC decoding. Besides, we introduce some puncturing methods for finite length LDPC code and propose a puncturing scheme for PCGC system. Finally, we will propose an UEP scheme which uses PCGC as its error-correcting code. In the work of stopping criteria, we want to propose a local stopping criterion to couple with existing global stopping criteria. In the work of puncturing, we let the mentioned puncturing methods to select recommended punctured-bits in individual constituent codes of PCGC, and then to propose how to select punctured-bits over all PCGC system. In the final work, we will propose an application and channel aware UEP scheme in the viewpoint of relation between frame PSNR and decoded BER. Finally, we will show the performances to verify advantages of our works. | en |
dc.description.provenance | Made available in DSpace on 2021-06-13T00:04:50Z (GMT). No. of bitstreams: 1 ntu-96-R94922077-1.pdf: 1403434 bytes, checksum: a7a1c7232831c8dee4c91babaf5dacff (MD5) Previous issue date: 2007 | en |
dc.description.tableofcontents | 1 Introduction 1
1.1 Why Joint Source-Channel Coding? . . . . . . . . . . . . . . . . . . . 1 1.2 Cross-Layer Design . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2 Related Works 4 2.1 Low-Density Parity-Check Code . . . . . . . . . . . . . . . . . . . . . 5 2.1.1 Sparse Parity-CheckMatrix and Tanner Graph . . . . . . . . 5 2.1.2 Massage-Passing Algorithm . . . . . . . . . . . . . . . . . . . 7 2.2 Parallel Concatenated Gallager Code . . . . . . . . . . . . . . . . . . 9 2.2.1 PCGC Encoder . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.2.2 PCGC Decoder . . . . . . . . . . . . . . . . . . . . . . . . . . 13 2.3 Existing Global Stopping Criteria . . . . . . . . . . . . . . . . . . . . 15 2.3.1 Cross-Entropy . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 2.3.2 Sign-Change-Ratio . . . . . . . . . . . . . . . . . . . . . . . . 18 2.3.3 Hard-Decision-Aided . . . . . . . . . . . . . . . . . . . . . . . 19 2.3.4 Simulations and Summary . . . . . . . . . . . . . . . . . . . . 20 3 Proposed Stopping Criteria 23 3.1 Proposed Local Stopping Criteria . . . . . . . . . . . . . . . . . . . . 24 3.1.1 Agreement of Reliability-Trend . . . . . . . . . . . . . . . . . 25 3.1.2 Variation of Reliability-Trend . . . . . . . . . . . . . . . . . . 28 3.1.3 Local HDA . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 3.2 Combine Global and Local Stopping Criteria . . . . . . . . . . . . . . 35 3.2.1 Feasibility of using Cross-Entropy . . . . . . . . . . . . . . . . 36 3.2.2 Feasibility of using Sign-Change-Ratio . . . . . . . . . . . . . 39 3.2.3 Feasibility of using Hard-Decision-Aided . . . . . . . . . . . . 42 3.3 Simulations and Summary . . . . . . . . . . . . . . . . . . . . . . . . 44 4 Unequal Error Protection using PCGC 50 4.1 Puncturing for Finite Length LDPC Codes . . . . . . . . . . . . . . . 51 4.1.1 Step-Recoverable . . . . . . . . . . . . . . . . . . . . . . . . . 52 4.1.2 Node Distance Constraint . . . . . . . . . . . . . . . . . . . . 54 4.2 Puncturing of PCGC . . . . . . . . . . . . . . . . . . . . . . . . . . . 56 4.2.1 Puncturing at lower-MCWpart . . . . . . . . . . . . . . . . . 56 4.2.2 Puncturing at higher-MCWpart . . . . . . . . . . . . . . . . 58 4.2.3 Mixture . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 4.3 Proposed UEP using PCGC . . . . . . . . . . . . . . . . . . . . . . . 64 5 Simulation and Analysis 70 5.1 PCGC Performance Analyses . . . . . . . . . . . . . . . . . . . . . . 70 5.2 Puncturing Performance . . . . . . . . . . . . . . . . . . . . . . . . . 74 5.3 UEP using PCGC: A Case Study on H.264 . . . . . . . . . . . . . . . 74 6 Conclusion and Future Work 81 | |
dc.language.iso | en | |
dc.title | 一個利用平行串接式低密度奇偶校驗碼的不等量錯誤保護機制 | zh_TW |
dc.title | An Unequal Error Protection Scheme using Parallel Concatenated Low-Density Parity-Check Code | en |
dc.type | Thesis | |
dc.date.schoolyear | 95-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 簡韶逸,魏宏宇,洪士灝 | |
dc.subject.keyword | 不等量錯誤保護,平行串接式低密度奇偶校驗碼,低密度奇偶校驗碼,停止準則,消去, | zh_TW |
dc.subject.keyword | UEP,PCGC,LDPC,Stopping Criterion,Puncturing, | en |
dc.relation.page | 87 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2007-07-30 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 資訊工程學研究所 | zh_TW |
顯示於系所單位: | 資訊工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-96-1.pdf 目前未授權公開取用 | 1.37 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。