文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > 工程科技 > 信息与通信 > cyclic code
侵权投诉

cyclic code

循环码

Description of Encoding and Decoding of Binary Cyclic Codes in a Class Sequential Machines

Fikrat Feyziyev1, Lidiya Ramazanova2, Мehrdad Arablu Babavand Aslan3

Sumgait State University, Sumgait, Azerbaijan

Parsabad Moghan Branch, Islamic Azad University, Parsabad Moghan, Iran

1

FeyziyevFG@mail.ru, 3babaVand@yahoo.com

Abstract— The question of description of encoding and decoding Let i=(i,i,...,i) is arbitrary k-dimensional vector

3

1,2

on the base Meggit’s theorem of binary cyclic codes in class sequential machines is considered. Formulas for the description of the logical of detection and correction of mistakes in cyclic of superfluous codes are thus offered.

Keywords— sequential machines; cyclic codes; encoding; decoding; Meggit’s theorem I. INTRODUCTION

Let the set Bis a cyclic code [1, 2] in length n over the Galois field GF(2)and the code words have the form n- dimensional vectorsc=(c0,c1,...,cn 1).

Let g(x)=g kn kxn+...+g1x+g0 is generator polynomial of the codeB. Polynomial g(x) is a divisor of the polynomial xn

+1and the code B consists of all the product of the polynomial g(x)by polynomials on degree at most k 1 [1]. Each vector can be represented by xa polynomial in the form

c(x)=cn 1n 1x+...+c1x+c0.

Let’s

B(x)={c(x)=cn 1n 1x+...+c1x+c0(c0,...,cn 1)∈B}.

Set B(x)

have the structure of the sub ring of ring GF(2)[x]/(xn+1) [1], where are defined the operations of addition and multiplication by mod(xn

+1) follows:

p1(x) p2(x)=Rxn+1[p1(x)p2(x)] (1)

This record Rxn+1[p1(x)p2(x)]is the remainder obtained by dividing the productp1(x) and p1(x)in the ring

GF(2)[x]by a polynomialxn

+1, i.e. product on the left side of (1) is a product by mod(xn+1). Clearly, the cyclic shift can be written down as follows:

c′(x)=x c(x)=Rxn+1[x c(x)].

01k 1overGF(2). Then each k- dimensional information vector

i can be encoded in B by the formulas

c(x)=i(x) g(x).

Let instead of the data word iis transferred the polynomialc(x), i.e. its coefficients, on a connection channel

and on the other end of the connection channel polynomial υ(x)=υn 1n 1x+...+υ1x+υ0

is received. This means that the received n-dimensional

vector, which formed from the coefficients of the polynomialυ(x). Let’s e(x) is error polynomial, i.e.:

e(x)=υ(x)+c(x).

Let’s s(x)is syndrome polynomial, i.e.

s(x)=Rg(x)[υ(x)].

It is clear that

s(x)=Rg(x)[υ(x)]==R (2)

g(x)[c(x)+e(x)]=Rg(x)[e(x)].

Let’s

e(x)=en 1n 1x+...+e1x+e0, s(x)=sn k 1n k 1x+...+s1x+s0.

υThe problem of decoding the received polynomial

(x)consist in finding in it those positions, which are happened mistakes in them, their correction and calculation of

data polynomial.

II. THE DESCRIPTION OF ENCODING OF DATA WORDS

When encoding of data words the encoder works n cycles.

In the initial kcycles are moves to the input

sequencei0,i1,...,ik 1, and in the subsequent cycles n k 1

are moves to the input zero. The output of the encoder must be obtained from the coefficients of the polynomial code sequencec0,c1,...,cn 1. The works of encoder can be

represented by the following sequential machine (SM) [1], described by the following equation:

第1页

你可能喜欢

热门文档

相关文档

  • Chapter3 Cyclic Codes_hcp通信理论与系统编码

    – BCH is a kind of binary cyclic code. ? RS codes – Structured by Reed and Solomon in 1960. – RS is a kind of nonbinary cyclic code. 2013年...

  • ...error correction circuits based on cyclic code_...

    The realization of quantum error correction circuits based on cyclic code 隐藏>> The realization of quantum error correction circuits based on cyclic code ...

  • Cyclic codes

    1 is the generator polynomial of some cyclic code in Fn Corollary 7.2.9 There is a one-to-one correspondence between the cyclic codes in Fnand the ...

  • Chapter3 Cyclic Codes

    – BCH is a kind of binary cyclic code. ? RS codes – Structured by Reed and Solomon in 1960. – RS is a kind of nonbinary cyclic code. 2015-...

  • Quasi-Cyclic_LDPC 码的新进展

    Quasi-Cyclic LDPC Code... 暂无评价 6页 免费 DESIGN OF QUASI-CYCLIC......Quasi-Cyclic:LDPC 码的新进展宋挥师 本文作者宋挥师先生,国家广播电影电视总局...

  • Quasi-Cyclic_LDPC 码的新进展

    Quasi-Cyclic LDPC Code... 暂无评价 6页 免费 DESIGN OF QUASI-CYCLIC......Quasi-Cyclic:LDPC 码的新进展宋挥师 本文作者宋挥师先生,国家广播电影电视总局...

  • 系统Code_error对照表

    系统Code_error对照表_IT/计算机_专业资料。网上找的,号称全集,但至少是比较...23 0x0017 资料错误 (cyclic redundancy check) 24 0x0018 程式发出一个长度...

  • 4. convolution code

    4. convolution code_机械/仪表_工程科技_专业资料。Outline Channel Coding I...Cyclic block codes (Reed-Solomon and BCH codes) Convolutional Codes Structure...

  • cyclic redundancy checking for ethernet

    Definition: A cyclic code is a linear (N,k) block code with the property that every cyclic shift of a codeword results in another codeword. Cyclic ...

  • Chapter3 Cyclic Codes_hcp

    (Solomon)构造出来,因 此由他们的名字命名; – 是非二进制的循环码(nonbinary cyclic code);– 对照BCH码的定义:它是m=1,m0=1的q元 本原BCH码,是一种特殊...

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email