parity check code 中文意思是什麼

parity check code 解釋
奇偶檢驗碼
  • parity : n. 1. 同等，平等。2. 同格，同位。3. 同樣；類似，一致。4. 等量，等價。5. 【物理學】宇稱（性），奇偶性。6. 【商業】平價；價值對等。
  • check : n 1 （象棋）將軍（ ），被將軍的局面。2 （突然的）妨礙[制止，阻止]；停頓，挫折；【打獵】（獵狗聞不...
  • code : n 1 法典；法規。2 規則，準則；（社會、階級等的）慣例，習俗，制度。3 （電）碼，代碼，密碼，暗碼；...
  1. Horizontal and vertical parity check code

    二維奇偶驗碼
  2. 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碼。
  3. 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年提出，當時並未受到人們的重視。
  4. 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碼字，模擬表明，採用矢量矩陣的結構化方法具有和-旋轉構造法相當的性能，但是實現的復雜度大於-旋轉構造法，同時碼率和碼長受到一定的限制，這也是未來需要研究的方向。
  5. 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比特。
  6. 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碼的校驗矩陣是非常稀疏的，但它的生成矩陣卻並不稀疏，這使得其編碼復雜度往往與其碼長的平方成正比。
  7. Construction of low - density parity - check code approaching the shannon limit

    構造接近香農極限的低密度校驗碼
  8. By comparing this algorithm with ( 3, 2 ) and ( 7, 6 ) parity check code, we find that the performance of short code is better than that of the longer one

    本文通過（ 3 ， 2 ）碼和（ 7 ， 6 ）碼的估計性能比較，發現利用短碼的估計性能較好，而且隨著碼字個數統計的增加，估計性能會提高。
  9. 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碼是一種特殊的具有稀疏校驗矩陣的糾錯編碼，其性能逼近香農限。這種碼具有實現復雜度低和數據吞吐量高的優點。
  10. In detail, they are bit - interleaved coded modulation ( with iterative decoding ), low - density parity - check codes and stf technology. by the performance analysis of bicm ( - id ), which can make code and modulation optimal separately, and achieve maximum possible coding diversity as well as modulation gain, guidelines for its design and an easy algorithm for siso are proposed. design of capacity - approaching of ldpc codes and efficient encoding of them as well as several kinds of its decoding algorithms are investigated

    具體的講，就是討論了基於比特交織的編碼調制技術，並給出了映射方式的設計準則以及核心模塊siso的一種簡單的f - map演算法；研究了編碼最小漢明距隨碼長線性增加的ldpc碼的幾個方面的問題，包括接近香農限碼子集的度分佈對的設計、有效編碼器的實現和各種譯碼演算法的優缺點，並對基於ldpc碼的bicm應用於ofdm傳輸系統中的性能進行了模擬。
  11. Parity check code

    奇偶校驗碼
  12. These sub - codes can be the same or not, bch code, single parity check code, extended hamming code, and so on

    這些子碼可以相同也可以不同，可以是bch碼、單奇偶校驗碼、擴展hamming碼等。
  13. Although the estimation algorithm is carried out by parity check code, but it is also applicable in general linear block codes to estimate the channel ’ s parameter

    本文演算法不僅可以利用偶校驗碼的碼結構去估計通道參數，而且對於一般的線性分組碼也適用。
  14. If no errors occur in it, the parity check part itself can retrieve the information by invertible process. if errors occur, the parity check part will be combined with the previously received information part to build an error - correction code, and try to recover the information. this kind of harq can match channel states very well

    該harq將信息碼字和校驗碼字分開傳送，通道狀態較好時只傳送信息碼字；通道變差時才要傳送校驗碼字，校驗碼字可單獨或與信息碼字一起將信息恢復出來，因此這種結構對通道有較好的適應性。
  15. 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碼的自適應編碼方案，對原始校驗矩陣適當變化，即可對信源信息進行不同碼率的自適應編碼。
  16. 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限。
  17. 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分佈信息，優化解碼迭代過程，能有效提高系統性能;並且該方案構造的校驗矩陣更易於實際的編譯碼硬體實現。
  18. 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譯碼器，較好地解決了當校驗矩陣為隨機結構時，譯碼性能、硬體資源和數據吞吐量平衡的問題。
  19. The code length is very large when it be used. also, a significant amount of memory is needed to store their parity - check matrices. in this way, the encoding problem of ldpc codes may be an obstacle for their applications because they have high encoding complexity

    Ldpc碼在應用時選定的碼長很長而且編碼實現時所需的用於存儲的寄存器數量非常多，這樣，其編碼復雜度特別大，成為應用的一個障礙。
  20. Low - density parity - check code ( ldpc codes ) is a kind of asymptotic good codes that can approach shannon ' s capacity with low complexity iterative decoding

    基於圖模型的ldpc碼是一種有較低的迭代譯碼復雜度和接近shannon容量限的漸近好碼。
分享友人
分享到 Line

分享到臉書