minimum-distance decoding 中文意思是什麼
minimum-distance decoding
解釋
最短距離譯碼-
Based on tanner graph, the representation and construction of ldpc codes are addressed, and the two decoding algorithm for ldpc codes, i. e, bit - flipping algorithm and sum - product algorithm, are discussed. from two aspects - minimum distance and the failure of independence assumption, the impacts of cycles to the performance of ldpc codes are analyzed. 2
基於tanner圖模型，詳細介紹了ldpc碼的表示和構造；介紹了ldpc碼的硬判決譯碼（比特翻轉演算法）和軟判決迭代譯碼（和積演算法） ；從最小距離和獨立性假設失效兩個方面分析了環的存在對ldpc碼譯碼性能的影響； 2
分享友人