校驗矩陣 的英文怎麼說

中文拼音 [jiàoyànzhèn]
校驗矩陣 英文
check matrix
  • : 校名詞1. (學校) school 2. (校官) field officer3. (姓氏) a surname
  • : 動詞1. (察看; 查考) examine; check; test 2. (產生預期的效果) prove effective; produce the expected result
  • : 名詞1. (畫直角或正方形、矩形用的曲尺) carpenter's square; square2. (法度; 規則) rules; regulations 3. [物理學] moment
  • : Ⅰ名詞1 (作戰隊伍的行列或組合方式) battle array [formation]: 布陣 deploy the troops in battle fo...
  • 矩陣 : [數學] matrix; array
  1. Symp. inform. theory, yokohama, japan, 2003, p. 122

    停止集和停止距離都依賴于校驗矩陣的選擇。
  2. Theory, 2002, 48 : 1570 - 1579. 5 kou y, lin s, fossorier m p c. low - density parity - check codes based on finite geometries : a rediscovery and new results. ieee trans

    Schwartz和vardy在2005年得到以下結果:任給校驗矩陣h0 ,一定可以通過增加冗餘行得到新的校驗矩陣h使得停止距離s h達到上界d 。
  3. Ldpc ( low density parity check ) code is a kind of linear block code that defined by very sparse parity matrix or tanner graph, and it is also called gallager code since gallager initially presented it

    Ldpc ( lowdensityparitycheck )碼是一類用非常稀疏的校驗矩陣或二分圖定義的線性分組糾錯碼,最初由gallager發現,故亦稱gallager碼。
  4. The linear block code is called a binary low - density parity - check code if it is based on a sparse parity - check matrix. this sort of code was originally proposed by dr. gallager in 1962, which cannot attract a large amount of interest at that time

    低密度奇偶( ldpc )碼是基於稀疏校驗矩陣的線性分組碼,它最初由gallager於1962年提出,當時並未受到人們的重視。
  5. On the other hand, in the approach based on vector - matrix, through several special operations on vector - matrix, we have constructed a sparse ‘ 0 ’, ‘ 1 ’ parity - check matrix with dual diagonal matrix whose structure can easily construct the code. the simulation results have demonstrated the performance of this approach is similar to that of - rotation while the complexity is also higher. this problem is to be solved in the future research

    在基於矢量的結構化方法中,通過對矢量進行一系列特殊處理可以構造出稀疏的『 0 』 、 『 1 』校驗矩陣,而校驗矩陣中的雙對角結構易於構造出相應的ldpc碼字,模擬表明,採用矢量的結構化方法具有和-旋轉構造法相當的性能,但是實現的復雜度大於-旋轉構造法,同時碼率和碼長受到一定的限制,這也是未來需要研究的方向。
  6. In b3g - system, the ldpc code has been used with the random irregular parity - check matrix, which the data length is 3944

    「 b3g 」系統中, ldpc碼校驗矩陣為隨機的非規則校驗矩陣,碼長為3944比特。
  7. We obtain a new general upper bound on the stopping redundancy of binary linear codes which improves the corresponding results of schwartz and vardy

    設c為二元線性碼, n為碼長, d為極小距離, h為校驗矩陣, gh為h對應的tanner圖。
  8. Ldpc code belongs to the linear block code which is encoded by the information sequence multiplies generator matrix. although the parity - check matrix of ldpc code is sparse, the generator matrix is not. the encoding complexity of it is linearly proportional to the square of code length

    Ldpc碼屬于線性分組碼,線性分組碼的通用編碼方法是由信息序列根據碼的生成來求相應的碼字序列,盡管ldpc碼的校驗矩陣是非常稀疏的,但它的生成卻並不稀疏,這使得其編碼復雜度往往與其碼長的平方成正比。
  9. ( 2 ) introduce the graph theory of ldpc codes ; analyse the impact of cycle ; and research how to construct the parity check matrix

    ( 2 )介紹了ldpc碼圖模型理論;分析環對ldpc碼性能的影響;並討論了如何構造ldpc碼校驗矩陣
  10. This paper made a careful study on a class of quasi - regular ldpc codes which could encode in linear time only making use of their parity matrix such as - rotation ldpc codes. two factors of the minimum distance and girth length were discussed to improve the performance of these ldpc codes

    本文著重研究以旋轉ldpc碼為代表的準規則結構的ldpc碼的構造和編碼方法,可以直接利用校驗矩陣實現快速線性編碼,並從碼距和圍長兩個方面,對這類ldpc碼字性能進行分析和優化。
  11. This article uses the parity check matrix to produce a simplified decoding table under the premise of not using the structure standard array

    摘要在不用構造標準列的前提下,利用一致校驗矩陣直接生成簡化的譯碼表。
  12. The bit - interleaved coded modulation with iterative decoding for bandwidth - efficient transmission over rayleigh fading channel is studied

    該方案利用ldpc碼校驗矩陣作為系統迭代終止判決準則,可大幅度降低譯碼演算法的平均復雜度。
  13. By column exchanging, the ( m, n ) parity check matrix is divided into k ( m, ni " ) sub - matrixes which obey the same rules

    該方法對m行n列的校驗矩陣進行列交換處理,使得校驗矩陣形成k個m行ni '列的子,每個子具有一定的規律。
  14. Low density parity check ( ldpc ) code, which is a special case of error correction code with sparse parity - check matrix, has the performance very close to the shannon limit

    Ldpc碼是一種特殊的具有稀疏校驗矩陣的糾錯編碼,其性能逼近香農限。這種碼具有實現復雜度低和數據吞吐量高的優點。
  15. Low density parity check codes are a class of linear block error - correcting codes that can be defined by the very sparse parity - check matrix. their error performance approach shannon limits

    Ldpc碼(低密度碼)是一類可以用非常稀疏的奇偶校驗矩陣定義的線性分組糾錯碼,具有逼近香農限的性能。
  16. Since their rediscovery, design, construction, decoding, analysis and applications of ldpc coded have become focal points of research. among them, the decoding algorithm and its implementation design are the focus of this thesis

    Ldpc碼是一種具有稀疏校驗矩陣的線性分組碼,研究結果表明,採用迭代的概率譯碼演算法, ldpc碼可以達到接近香農極限的性能。
  17. This class of codes decoded with soft - in soft - out ( siso ) iterative decoding performs amazingly well. since their rediscovery, design, construction, decoding, analysis and applications of ldpc coded have become focal points of research

    Ldpc碼是一種具有稀疏校驗矩陣的線性分組碼,研究結果表明,採用迭代的概率譯碼演算法, ldpc碼可以達到接近香農極限的性能。
  18. Since ldpc codes have a wonderful future, an adaptive coding scheme was developed based on quasi - regular ldpc codes and it encodes the source bits with different code rate by dividing the original parity check matrix properly

    由於ldpc碼在未來的廣闊應用前景,本文提出一種針對結構化ldpc碼的自適應編碼方案,對原始校驗矩陣適當變化,即可對信源信息進行不同碼率的自適應編碼。
  19. Then discusses conventional encoding and efficient encoding using special sparse parity check matrix in encoding algorithm, and expatiates the principle of message passing and spa which has the best performance in decoding algorithm

    在編碼演算法里詳細討論了傳統的編碼演算法以及使用特殊形式奇偶校驗矩陣的快速編碼演算法。在譯碼演算法里介紹了mp演算法集的基本原理和譯碼性能最好的和乘積譯碼演算法。
  20. Some properties of separation vector of linear block codes are shown, the relationship of a variety of codewords subspace and separation vector is derived, also a serie of theorems of parity check matrix and code symbol separation are proved. the singlton bound of separation is then proved

    然後簡單分析了線性碼的碼元分離度的性質,並在此基礎上分析了一致校驗矩陣的列相關性,從而得到了線性碼的消息分離度和碼元分離度的singlton限。
分享友人