x

parity check

uploads/parity check.jpg

parity check 【自動化】奇偶校驗。

【自動化】奇偶校驗。 “parity“ 中文翻譯：   n. 1.同等，平等。 2.同格，同位。 3.同樣；類似 ...“check“ 中文翻譯：   n. 1.(象棋)將軍(!)，被將軍的局面。 2.(突然 ...“check, parity“ 中文翻譯：   奇偶檢測“parity-check“ 中文翻譯：   奇偶校驗“binary parity check“ 中文翻譯：   二進制奇偶校驗“block parity check system“ 中文翻譯：   字組奇偶校驗方式“character parity check“ 中文翻譯：   字符奇偶校驗“check digit parity“ 中文翻譯：   配類核對數位“check even parity“ 中文翻譯：   偶配類核對“check, two-coordinate parity“ 中文翻譯：   雙坐標奇偶檢測“cross parity check“ 中文翻譯：   縱橫奇偶校驗“data parity check“ 中文翻譯：   數據奇偶校驗“even parity check“ 中文翻譯：   偶數奇偶校驗; 偶數奇偶性校驗; 偶校驗“even-parity check“ 中文翻譯：   偶數同位校驗; 偶數同位佼驗“file parity check“ 中文翻譯：   文件奇偶校驗（檢錯）“file parity check register“ 中文翻譯：   文件奇偶校驗寄存器“generalized parity check“ 中文翻譯：   廣義均等核對, 廣義奇偶校驗“horizontal and vertical parity check“ 中文翻譯：   縱橫奇偶校驗“horizontal parity check“ 中文翻譯：   橫向奇偶校驗; 水平檢驗; 縱向奇偶性檢驗“lateral parity check“ 中文翻譯：   橫向配類核對“longitudinal parity check“ 中文翻譯：   縱向奇偶檢驗; 縱向奇偶校驗; 縱向奇偶性檢驗“lpc longitudinal parity check“ 中文翻譯：   縱向奇偶校驗“magnetic tape parity check“ 中文翻譯：   磁帶奇偶校驗“memory parity error check“ 中文翻譯：   存儲器奇偶較驗; 奇偶校驗檢查“odd parity check“ 中文翻譯：   奇數奇偶性較驗; 奇校驗

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 '列的子矩陣,每個子矩陣具有一定的規律。

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 '列的子矩陣,每個子矩陣具有一定的規律。

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 '列的子矩陣,每個子矩陣具有一定的規律。

park

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年代提出的低密度校驗碼,是一種校驗矩陣為稀疏矩陣的線性分組碼。

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譯碼器,較好地解決了當校驗矩陣為隨機結構時,譯碼性能、硬件資源和數據吞吐量平衡的問題。

Wavelet transform provides a new approach for improving synchronization attack - resistance of video watermarking , based on time - domain discrete wavelet transform ( tdwt ) , a localized watermarking scheme is introduced , according to robust content features . important embedded regions are selected in both low and high frequency component to improve the spatial synchronization attack - resistance . parity checking is used in the two algorithms to realize the watermark embedding and blind retrieving , and the performance of the two algorithms is evaluated 小波變換為提高水印在同步攻擊中的魯棒性提供了新思路,本文在基于時間域離散小波變換( tdwt )的視頻水印算法中,引入了嵌入區域局部化方法,即以魯棒內容特征為依據,分別在視頻的低頻分量和高頻分量中選擇重要區域為嵌入區域,進一步提高了水印的空間同步魯棒性。

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碼。

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將信息碼字和校驗碼字分開傳送，信道狀態較好時只傳送信息碼字；信道變差時才要傳送校驗碼字，校驗碼字可單獨或與信息碼字一起將信息恢復出來，因此這種結構對信道有較好的適應性。

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分布信息,優化解碼迭代過程,能有效提高系統性能;并且該方案構造的校驗矩陣更易于實際的編譯碼硬件實現。

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碼己成為信道編碼理論界的研究熱點之一。

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 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碼能夠達到線性編碼的途徑。

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算法集的基本原理和譯碼性能最好的和乘積譯碼算法。

Low density parity check ( ldpc ) codes are shown to be one class of shannon limit approaching codes . with advantages of high encoding gain , low decoding complexity and flexible code rates , etc . , the research of these codes has become a hot spot of coding academia 低密度校驗碼( 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碼的自適應編碼方案,對原始校驗矩陣適當變化,即可對信源信息進行不同碼率的自適應編碼。

As to the error control and data correction , the parity check and hamming code check solutions are provided also to guarantee the reliability of data transmission and improve the anti - jamming capability of the system 在差錯控制和數據糾錯方式上，也提供了奇偶校驗和漢明碼校驗的解決辦法，以保證數據傳輸的可靠性，提高系統的抗干擾能力。

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碼。

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碼(低密度校驗碼)是一類可以用非常稀疏的奇偶校驗矩陣定義的線性分組糾錯碼,具有逼近香農限的性能。

A term applied to an operation ( say , parity checking ) or to a hardware element ( say , microcode storage ) that is not evident to a user program and need not be considered by a programmer 用于描述操作(如奇偶校驗)或硬件元件(如微碼存儲器)的術語,對用戶程序來說是隱蔽的,且不需要由程序員來考慮。