parity matrix 中文意思是什麼
parity matrix
解釋
奇偶矩陣-
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碼。 -
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年提出，當時並未受到人們的重視。 -
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碼字，模擬表明，採用矢量矩陣的結構化方法具有和-旋轉構造法相當的性能，但是實現的復雜度大於-旋轉構造法，同時碼率和碼長受到一定的限制，這也是未來需要研究的方向。 -
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比特。 -
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碼的校驗矩陣是非常稀疏的，但它的生成矩陣卻並不稀疏，這使得其編碼復雜度往往與其碼長的平方成正比。 -
( 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碼校驗矩陣。 -
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碼字性能進行分析和優化。 -
This article uses the parity check matrix to produce a simplified decoding table under the premise of not using the structure standard array
摘要在不用構造標準陣列的前提下，利用一致校驗矩陣直接生成簡化的譯碼表。 -
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 '列的子矩陣，每個子矩陣具有一定的規律。 -
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碼是一種特殊的具有稀疏校驗矩陣的糾錯編碼，其性能逼近香農限。這種碼具有實現復雜度低和數據吞吐量高的優點。 -
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碼（低密度校驗碼）是一類可以用非常稀疏的奇偶校驗矩陣定義的線性分組糾錯碼，具有逼近香農限的性能。 -
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碼的自適應編碼方案，對原始校驗矩陣適當變化，即可對信源信息進行不同碼率的自適應編碼。 -
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演算法集的基本原理和譯碼性能最好的和乘積譯碼演算法。 -
The encoding complexity of ldpc codes length n seems indeed to be of order n2, the dissertation study the coding scheme with linear time complexity. afterward, it introduces the coding schemes used in dvb - s2 and gets the parity check matrix by simulation
針對ldpc碼通用編碼演算法的復雜度與碼長的平方成正比的問題，重點研究了ldpc碼的快速編碼方法，總結出了使ldpc碼能夠達到線性編碼的途徑。 -
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限。 -
The ldpc code ’ s parity check matrix generated by this scheme has high girth and can be used to coding directly, the coding complexity is lower. as to the decoding algorithm, i modify the message passing algorithm based on the girth that i can get in the structure of parity check matrix to improve the decoding performance. what is more, the new structure of the parity check matrix is easy to implement with the hardware
接著著重圍繞ldpc碼的校驗矩陣構造方法和譯碼演算法展開討論，在比特填充演算法的基礎上提出了一種ldpc碼聯合編譯碼方案，通過該方案構造的校驗矩陣不僅具有良好的girth分佈，而且能直接用於編碼，編碼的計算復雜度低;在譯碼方面，利用構造奇偶矩陣過程中girth分佈信息，優化解碼迭代過程，能有效提高系統性能;並且該方案構造的校驗矩陣更易於實際的編譯碼硬體實現。 -
At the same time, a novel approach to construction of ldpc codes based on the permutation matrix was proposed which got a parity check matrix with the shortest girth is 6. these codes keep the advantage of linear encoding and become more flexible. simulations show that the performance of short length codes of this kind is as excellent as other ldpc codes
同時提出一種基於置換陣循環移位的構造方法，得到的校驗矩陣圍長至少為6 ，且保持編碼的線性復雜度，碼率靈活，模擬結果驗證了置換陣ldpc碼碼長較短時，在高斯通道下性能接近或超過現有其他構造方式的ldpc碼。 -
Three decoder architectures, parallel, serial and partially - parallel approaches, are analyzed in this thesis. a kind of novel partially - parallel architecture for decoding ldpc code is proposed. the trade - off between the performance of the decoder, hardware complexity and data throughout can be achieved with this partially - parallel architecture for the random parity check matrix
論文分析了三種不同的譯碼器結構:并行結構、串列結構以及部分并行結構，並提出了一種新穎的部分并行結構的ldpc譯碼器，較好地解決了當校驗矩陣為隨機結構時，譯碼性能、硬體資源和數據吞吐量平衡的問題。 -
Low density parity check ( ldpc ) codes are good error - correcting codes, which can approach shannon ' s capacity limit. due to the sparsity of its check matrix, ldpc codes can be decoded only with linear time complexity using iterative decoding algorithm. therefore, ldpc codes have become one of the most attractive fields in the channel coding community
低密度校驗碼是一種逼近香農限的好碼，由於其校驗矩陣的稀疏特性，採用迭代譯碼演算法，它的譯碼僅具有線性時間復雜度，所以目前ldpc碼己成為通道編碼理論界的研究熱點之一。 -
In next mobile communication system to suffice more and more high - speed data service and demand of qos ( quality of service ) many new wireless link layer transport technologies are going to be used such as mimo ( multiple input multiple output ), ofdm ( orthogonal frequency division multiplexing ), channel coding and acm ( adaptive coding modulation ) etc. low density parity check ( ldpc ) codes were first discovered in 1960 ’ s which belong to linear block codes with their parity matrix being sparse
下一代移動通信系統為了滿足移動用戶對高速、寬帶數據傳輸業務不斷增長和更高服務質量的要求，採用了許多新的無線鏈路傳輸技術，包括多天線發射和接收技術、正交頻分復用技術、通道糾錯編碼技術和自適應編碼調制技術等。上世紀60年代提出的低密度校驗碼，是一種校驗矩陣為稀疏矩陣的線性分組碼。
分享友人