查詢結果分析
來源資料
相關文獻
- A New Decoding Algorithm for Binary BCH Codes
- Improvement of Step-by-Step Decoding Algorithm for Binary BCH Codes
- Low-Complexity Decoding for the Golay Code
- Novel Decoding of Binary BCH Codes
- The Calculation of Complexity in Normal and Apoplectic EEG Signals
- LP單形法的程式建立
- Measurements for Rule Based Systems
- Parallel Two-dimensional Prefix Computation on a Mesh-connected Computer
- 動態批量平行演算法之探討
- Effects of Task Complexity on Reaching Kinematics: A Pilot Study
頁籤選單縮合
題 名 | Low-Complexity Decoding for the Golay Code=低複雜度格雷碼解碼法 |
---|---|
作 者 | 池慶龍; 柳復華; 壽賀年; 林麗鳳; | 書刊名 | 航空技術學院學報 |
卷 期 | 5:1 民95.08 |
頁 次 | 頁439-444 |
分類號 | 310.153 |
關鍵詞 | 二位元BCH碼; 步階解碼; 複雜度; 矩陣運算; Binary BCH codes; Step-by-step decoding; Complexity; Matrix calculation; |
語 文 | 英文(English) |
中文摘要 | 步階解碼演算法可以像代數解碼法ㄧ樣應用在(23, 12, 7)格雷碼解碼。本文提出一種可以解格雷碼的改進式步階解碼法,應用邏輯分析產生一簡單規則可以直接判斷收到字元中之一個位元是否正確。此方法可以有效的降低運算複雜度。 |
英文摘要 | Similar to algebraic decoding schemes, the (23, 12, 7) Golay code can be decoded by applying the step-by-step decoding algorithm. In this work, a modified step-by-step algorithm for decoding the Golay code is presented. Logical analysis yielded a simple rule for directly determining whether a bit in the received word is correct. The computational complexity can be reduced significantly using this scheme. |
本系統中英文摘要資訊取自各篇刊載內容。