電子信息類(lèi)文獻(xiàn)翻譯-資料下載頁(yè)
2025-06-17 14:20本頁(yè)面
【正文】 and iterarive decoding algorithms. In this paper,we consider the encoding problem for LDPC generally,we consider the encoding probelm for codes specified by sparse paritycheck show how to exploit the sparseness of the paritycheck matrix to otain efficient the (3,6)regular LDPC code,for example,the plexity of encoding is essentially quadratic in the block ,we show that the associatedcoefficient can be made quite small,so that encoding codes even of length n=100000 is still quite importantly,we will show thatoptimizedcodes actually admit lineat time encoding.題目：低密對(duì)等檢測(cè)代碼的有效加密作者：Thomas and Rudiger 摘要：低密對(duì)等檢測(cè)碼可能是被認(rèn)為是高級(jí)代碼在性能和復(fù)雜性方面最大的競(jìng)爭(zhēng)對(duì)手，他是基于一個(gè)相似理論。它包括全體隨機(jī)碼和迭代解密算法。在這篇文章中，我們考慮對(duì) LPDC 碼的加密問(wèn)題。更一般的，我們考慮用少量的對(duì)等檢測(cè)模型對(duì)具體的碼字進(jìn)行加密。我們知道怎樣利用這個(gè)對(duì)等檢測(cè)模型來(lái)獲得有效的加密碼。對(duì)（3，6）這個(gè)規(guī)則的 LPDC 碼。它的加密的復(fù)雜形勢(shì)一般的塊長(zhǎng)的二次方。然而，我們知道這個(gè)聯(lián)合系數(shù)能被取得十分小。因此，對(duì)長(zhǎng)度 N 約等于 100000 的碼加密是實(shí)際可行的。更重要的事，我們知道 “最優(yōu)化”碼是允許被線性加密的。TITLE:Matlaab/VC++/Access Coprogramming and Its ApplicationAUTHOR :LIU Jing1Abstract:The paper introduces a Matlab/VC++/Acess coprogramming method and the way of integrating those systems and applications the end,an esample is example is examinde in detail to explain implemetation steps.Key words Matlab。Matlab math library。ICF題目：Matlab/VC++/Access 組合編程方法及其應(yīng)用作者：LIU Jing19 / 9摘要：提出了一種 Matlab/VC++/Access 組合編程的方法，并闡述了將 3 種編程環(huán)境的功能優(yōu)勢(shì)與應(yīng)用系統(tǒng)無(wú)縫集程的方式。最后，在慣性約束核聚變實(shí)驗(yàn)數(shù)據(jù)處理及管理系統(tǒng)的具體事例中詳細(xì)說(shuō)明實(shí)現(xiàn)步驟。TITLE:Analyzing the turbo Decoder Using the Gaussian ApproximationAnthor:Heshmal EL Gamal,Member,IEEEAbstract:In this paper,we introduce a simple technique for ananlyzing the iterative decoder that is broadly applicable to different classes of codes defined over graphs in certain fading as well as additive white Gaussian noise(AWGN) technique is based on the observation that the extrinsic information from constituent maximum sing the Gaussian Approximation. Inputs to the decoders are model implies the existence of an iterative decoder threshold that statistically characterizers the convergence of the iterative EL ,IEEE,and Hammons,Jr,Member,IEEE aposteriori(MAP) decoders is well approximated by Gaussian of error as the number of iterations increases if and only if the channel Eb/Eo exceeds the threshold.題目：用高斯近似理論來(lái)分析高級(jí)解碼器作者：Heshmal EL Gamal,Member,IEEE摘要：在這一章中，我們將介紹一種簡(jiǎn)單的技術(shù)一用來(lái)分析迭代解碼器,它能廣泛的應(yīng)用于不同級(jí)別的代碼制圖在某些條件下如高私白噪聲通道，這種技術(shù)是基于從形成最大的高斯近似信號(hào)的外部信息的觀測(cè)上的。 解碼其的輸入是高斯信號(hào)，這種獨(dú)立的高斯模型標(biāo)志著一種迭代解碼起開(kāi)端的存在性，這種解碼器將迭代解碼其的其他特征匯集于一身，SpeHesham EL ,IEEE,and Hammons,Jr,Member,IEEE aposteriori(MAP)解碼器應(yīng)用高斯近似理論后相當(dāng)精確，迭代過(guò)程中數(shù)字誤差率在并只在信道Eb/Eo 超出開(kāi)端的的情況下才會(huì)增加。
語(yǔ)文相關(guān)推薦
鄂ICP備17016276號(hào)-1