block parity 中文意思是什麼

block parity 解釋
區塊奇偶校驗
  • block : n 1 片,塊,大塊;粗料,毛料;木料;石料;金屬塊;【建築】塊料,砌塊;【地質學;地理學】地塊。2 ...
  • parity : n. 1. 同等,平等。2. 同格,同位。3. 同樣;類似,一致。4. 等量,等價。5. 【物理學】宇稱(性),奇偶性。6. 【商業】平價;價值對等。
  1. Parity, block system

    塊系統配類
  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. 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碼的校驗矩陣是非常稀疏的,但它的生成矩陣卻並不稀疏,這使得其編碼復雜度往往與其碼長的平方成正比。
  5. 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碼(低密度校驗碼)是一類可以用非常稀疏的奇偶校驗矩陣定義的線性分組糾錯碼,具有逼近香農限的性能。
  6. In the channel coding part of the proposed scheme, each 16 - bit are encapsulated into one code block, which is consisted of information bits and parity bits

    信息比特經循環編碼,再經過卷積編碼組成編碼比特( 56比特) ,最後經過交織形成塊。
  7. 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

    本文演算法不僅可以利用偶校驗碼的碼結構去估計通道參數,而且對於一般的線性分組碼也適用。
  8. 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限。
  9. 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年代提出的低密度校驗碼,是一種校驗矩陣為稀疏矩陣的線性分組碼。
分享友人