幾類格的快速譯碼
FAST DECODING OF SOME KINDS OF LATTICES
-
摘要: 本文通過(guò)研究16維Barnes-Wall格和基于構(gòu)造A的二元線性分組碼、四元線性分組碼的導(dǎo)出格的代數(shù)結(jié)構(gòu),將這些格的譯碼問(wèn)題轉(zhuǎn)化為在相應(yīng)碼的格圖上求最短路徑的問(wèn)題,從而提出了這些格的快速譯碼算法,并分析了譯碼算法的時(shí)間復(fù)雜性。
-
關(guān)鍵詞:
- 線性分組碼; 格圖; Barnes-Wall格; 構(gòu)造A; 譯碼
Abstract: By studying the structure of 16 dimension Barnes-Wall lattice and lattices resulting from binary linear block codes and quaternary linear block codes based on Construction A, decoding problem of the lattices can be transformed into the problem of finding the shortest path of trellises accordingly. The time complexities of the decoding algorithms are analyzed. -
Forney Jr G D, et al. Efficient modulation for band-limited channels. IEEE J. of Selected Areas in Comm., 1984, SAG2(5): 632-647.[2]Conway J H, Sloane N J A. Soft decoding techniques for codes and lattices, including the Golay codes and the Leech lattices. IEEE Trans. on IT, 1986, IT-32(1): 41-50.[3]Conway J H, Sloane N J A. Sphere Packing, Lattices and Groups. New York: Springer-Verlag, 1988, Chapters 5, 7, 20.[4]Wolf J K. Efficient maximum likelihood decoding of linear block codes using a trellis. IEEE Trans. on IT, 1978, IT-24(1): 76-80.[5]阿霍 A V,霍普克羅夫特 J E,厄爾曼 J D著,唐守文譯.數(shù)據(jù)結(jié)構(gòu)與算法.北京:科學(xué)出版社,1987, 256-261.[6]馬建峰.分組碼快速譯碼算法的研究:[博士論文].西安:西安電子科技大學(xué),1994. 12.[7]Forney Jr G D. Coset codes Part II: Binary lattices and related codes.IEEE Trans. on IT, 1988,[8]IT-34(5): 1152-1187. -
計(jì)量
- 文章訪問(wèn)數(shù): 1781
- HTML全文瀏覽量: 78
- PDF下載量: 486
- 被引次數(shù): 0
下載:
