基于huffman信源編碼和ldpc信道編碼的聯(lián)合譯碼算法new

基于huffman信源編碼和ldpc信道編碼的聯(lián)合譯碼算法new

ID:33605642

大小:383.39 KB

頁數(shù):4頁

時(shí)間:2019-02-27

基于huffman信源編碼和ldpc信道編碼的聯(lián)合譯碼算法new_第1頁
基于huffman信源編碼和ldpc信道編碼的聯(lián)合譯碼算法new_第2頁
基于huffman信源編碼和ldpc信道編碼的聯(lián)合譯碼算法new_第3頁
基于huffman信源編碼和ldpc信道編碼的聯(lián)合譯碼算法new_第4頁
資源描述:

《基于huffman信源編碼和ldpc信道編碼的聯(lián)合譯碼算法new》由會(huì)員上傳分享,免費(fèi)在線閱讀,更多相關(guān)內(nèi)容在教育資源-天天文庫

1、__________________________________________________________________________________________www.paper.edu.cnJointSource-ChannelDecodingofHuffmanCodeswithLDPCCodesZhonghuiMeiandLenanWuAbstractInthispaper,wepresentajointsource-channeldecodingalgorithm(JSCD)forLDPCcodesbyexploitingtheredund

2、ancyoftheHuffmancodedsources.WhenthenumberofHuffmancodesincreases,justamoderatecomplexityisaddedforouralgorithmbyincreasingthesizeofthelookuptable,whichisusedtoestimatetheinformationbitprobabilitybasedonthesourceredundancy.Keywords-LDPC,Variablelengthcodes(VLC),Huffmancode,sum-producta

3、lgorithm(SPA),jointsource-channeldecoding(JSCD)I.INTRODUCTIONRecentlyin[1]-[4]severaljointsource-channeldecodingalgorithmsforvariablelengthcodes(VLC)havebeenproposed.Allofthesealgorithmsconsidertheoverallsequenceofvariablelengthcodewordtoexploitthesourceredundancy.Thedrawbackisthatthes

4、ymbolshavetobesynchronizedinordertolimiterrorpropagating.Furthermore,whenthenumberofVLCincreases,thedecodingcomplexityofthesealgorithmsexplodes.InthispaperwepresentaJSCDalgorithmforLDPCcodesincombinationwithHuffmancodedsources.TheerrorcorrectingpropertyofourJSCDalgorithmmainlydependson

5、channelcodesratherthansourceredundancy.Inordertoexploitthesourceredundancy,weestimatetheinformationbitprobabilitywithjustsomecorrespondingbitsbeforeit,whichsimplifiesthedecodingalgorithmsignificantly.Therestofthepaperisorganizedasfollows.SectionIIpresentstheHuffmancodedsourcemodel.TheJ

6、SCDalgorithmforLDPCcodesisdescribedinsectionIII.SectionIVprovidesthesimulationresults.SectionVconcludesthispaper.II.HUFFNANCODEDSOURCEMODELLetS=[s,s,s,......,s]denotesasequenceofinformationbitscodedbyVLC(e.g.a123nHuffmancode).In[1],[3]and[4],theyconsidertheoverallsequenceandexpressthes

7、ourceredundancywithp(S)=p(s,s,s,......,s).Inordertocomputep(S),[3]and[4]designa12ntrellistoillustratestatisticsofthesourcesequence.Whenthenumberofthetrellisstatesincreases,thecomputationalcomplexityofp(S)willriseexplosively.Inthispaper,wemakeuseofthesourceredundancywithp(s

8、[s,s,.....

當(dāng)前文檔最多預(yù)覽五頁,下載文檔查看全文

此文檔下載收益歸作者所有

當(dāng)前文檔最多預(yù)覽五頁,下載文檔查看全文
溫馨提示:
1. 部分包含數(shù)學(xué)公式或PPT動(dòng)畫的文件,查看預(yù)覽時(shí)可能會(huì)顯示錯(cuò)亂或異常,文件下載后無此問題,請放心下載。
2. 本文檔由用戶上傳,版權(quán)歸屬用戶,天天文庫負(fù)責(zé)整理代發(fā)布。如果您對本文檔版權(quán)有爭議請及時(shí)聯(lián)系客服。
3. 下載前請仔細(xì)閱讀文檔內(nèi)容,確認(rèn)文檔內(nèi)容符合您的需求后進(jìn)行下載,若出現(xiàn)內(nèi)容與標(biāo)題不符可向本站投訴處理。
4. 下載文檔時(shí)可能由于網(wǎng)絡(luò)波動(dòng)等原因無法下載或下載錯(cuò)誤,付費(fèi)完成后未能成功下載的用戶請聯(lián)系客服處理。