CN104320145A - Method for designing encoding circuits of (15,7) BCH codes - Google Patents

Method for designing encoding circuits of (15,7) BCH codes Download PDF

Info

Publication number
CN104320145A
CN104320145A CN201410594712.0A CN201410594712A CN104320145A CN 104320145 A CN104320145 A CN 104320145A CN 201410594712 A CN201410594712 A CN 201410594712A CN 104320145 A CN104320145 A CN 104320145A
Authority
CN
China
Prior art keywords
relational expression
input
redundancy check
bit
register
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201410594712.0A
Other languages
Chinese (zh)
Inventor
刘梦新
刘鑫
赵发展
韩郑生
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Institute of Microelectronics of CAS
Original Assignee
Institute of Microelectronics of CAS
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Institute of Microelectronics of CAS filed Critical Institute of Microelectronics of CAS
Priority to CN201410594712.0A priority Critical patent/CN104320145A/en
Publication of CN104320145A publication Critical patent/CN104320145A/en
Pending legal-status Critical Current

Links

Abstract

The invention provides a method for designing encoding circuits of (15,7) BCH codes. The method for designing the encoding circuits comprises the steps that serial encoding circuits are constructed according to the generating polynomials of the (15,7) BCH codes; a first relational expression of redundancy check bits stored in registers after an i+1<th> information bit is input to the registers, redundancy check bits stored in all the registers after an i <th> information bit is input to the registers and the input i+1 <th> information bit is obtained for each register in the serial encoding circuits; a second relational expression of redundancy check bits stored in the registers after all the seven information bits are input to the registers, redundancy check bits stored in the registers when no information bit is input to the registers and all the seven information bits is obtained for each register in the serial encoding circuits; parallel encoding circuits are constructed according o the second relational expression. According to the method, the parallel circuits are used for replacing a traditional serial encoding scheme, and thus the encoding time is greatly shortened.

Description

The coding circuit method for designing of (15,7) BCH code
Technical field
The present invention relates to error-correcting code technique field, particularly a kind of coding circuit method for designing of (15,7) BCH code.
Background technology
BCH (BoSe Ray-Chaudhuri Hocque7ghe15) is a kind of error correcting code efficiently, and its loop coding and decoding feature make it communicate, be widely used in the reliability etc. of control and memory automatically improving.
Usual Bose-Chaudhuri-Hocquenghem Code decoding adopts serial mode to realize, and needed for the coding and decoding of this scheme, circuit is very little, but the coding and decoding time but depends on clock cycle and code word size, therefore circuit speed is being required to high occasion seems inapplicable.
(15,7) BCH code can correct the mistake of 2bit, altogether needs the redundancy check bit of 8bit, at the GF (2 of m=4 4) structure can correct two wrong BCH code on territory, therefore t=2.At GF (2 4) on, basis α and α 32t-1corresponding multinomial is respectively:
φ 1(X)=1+X+X 4
φ 3(X)=1+X+X 2+X 3+X 4
The generator polynomial obtaining (15,7) BCH code is:
g(X)=φ 1(X)·φ 2(X)=1+X 4+X 6+X 7+X 8
According to the expression-form of generator polynomial g (X), can design coding and decoding circuit as Fig. 1, wherein square represents register, the expression modular two addition device with plus sige inside circle, i.e. XOR gate.Can find out, traditional BCH code coding needs through eight registers, and therefore in the synchronous digital circuit of clock control, need 7 clock cycle could be encoded in 7 bit data positions, speed is slower.And be not suitable for high speed Bose-Chaudhuri-Hocquenghem Code circuit.
Summary of the invention
The invention provides the coding circuit method for designing of one (15,7) BCH code, greatly can shorten the scramble time, not by the restriction of clock cycle, coding rate improves greatly.
According to one embodiment of present invention, provide the coding circuit method for designing of one (15,7) BCH code, this coding circuit method for designing comprises: according to this (15,7) generator polynomial of BCH code, there is the serial encoding circuitry of the register of 8 series connection; According to this serial encoding circuitry, be respectively each register in serial encoding circuitry, the first relational expression between the redundancy check bit that after redundancy check bit that after obtaining input the i-th+1 information bit, it stores and input i-th information bit, each register memory stores up, the i-th+1 information bit of input, i≤6 and be nonnegative integer; According to the first relational expression, be respectively each register in serial encoding circuitry, the redundancy check bit that when obtaining redundancy check bit of its storage after inputting whole 7 information bits and do not input any information bit, each register memory stores up, the second relational expression of whole 7 information bits; According to the second relational expression, construct with 7 information bits be input, 8 redundancy check bits are the parallel encoding circuit exported.
Alternatively, the redundancy check bit not inputting each register memory storage during any information bit is all set to 0.
Alternatively, the step obtaining the second relational expression according to the first relational expression comprises: by the first relational expression vectorization obtained for each register in serial encoding circuitry, thus obtain represent input the i-th+1 information bit after the vector of the redundancy check bit that 8 registers store, input after the vector of redundancy check bit that stores of 8 registers and input i-th information bit the i-th+1 information bit between the primary vector relational expression of relation; According to primary vector relational expression, obtain the secondary vector relational expression of the vector of the redundancy check bit that 8 registers store after representing whole 7 information bits of input and relation when not inputting any information bit between the vector of the redundancy check bit that 8 registers store, whole 7 information bits; From secondary vector relational expression, obtain the second relational expression of each register corresponded in serial encoding circuitry.
The redundancy check bit that after the present invention's redundancy check bit that first draw input the i-th+1 information bit from serial encoding circuitry after, each register stores and input i-th information bit, each register memory stores up, relation between the i-th+1 information bit of input, and then the redundancy check bit that the redundancy check bit that after drawing whole 7 information bits of input, each register stores stores up with each register memory when not inputting any information bit, the relation of whole 7 information bits, this relation is exactly the relation of 8 redundancy check bits and 7 information bits, thus can construct with 7 information bits as input, 8 redundancy check bits are the parallel encoding circuit exported.Compared with the serial encoding circuitry of prior art, parallel circuit is adopted to replace traditional tandem coding solution, can not by the restriction of clock cycle, greatly shorten the scramble time, coding rate improves greatly.
Accompanying drawing explanation
By reading the detailed description done non-limiting example done with reference to the following drawings, other features, objects and advantages of the present invention will become more obvious.
Fig. 1 is the coding circuit of (15,7) BCH code of prior art;
Fig. 2 is the serial encoding circuitry first constructed of (15,7) BCH code of an example of coding circuit as the present invention (15,7) BCH code;
Fig. 3 is the parallel encoding circuit finally constructed of (15,7) BCH code of an example of coding circuit as the present invention (15,7) BCH code;
Fig. 4 is the flow chart of the coding circuit method for designing of (15,7) according to an embodiment of the invention BCH code.
Embodiment
Embodiments of the invention are described below in detail.
The example of described embodiment is shown in the drawings, and wherein same or similar label represents same or similar element or has element that is identical or similar functions from start to finish.Being exemplary below by the embodiment be described with reference to the drawings, only for explaining the present invention, and can not limitation of the present invention being interpreted as.Disclosing hereafter provides many different embodiments or example is used for realizing different structure of the present invention.Of the present invention open in order to simplify, hereinafter the parts of specific examples and setting are described.Certainly, they are only example, and object does not lie in restriction the present invention.
The invention provides the coding circuit method for designing of one (15,7) BCH code, wherein the figure place of information bit is 7, and the total bit after coding is 15, and the figure place of redundancy check bit is 8.As shown in Figure 4, the method comprises:
In step S1, according to the generator polynomial of this (15,7) BCH code, there is the serial encoding circuitry of the register of 8 series connection.
With the generator polynomial of above-mentioned (15,7) BCH code for example, Fig. 2 shows a serial encoding circuitry with the register of 8 series connection constructed, and it can construct by the mode of prior art.With the generator polynomial of (15,7) BCH code described above be:
g(X)=φ 1(X)·φ 2(X)=1+X 4+X 6+X 7+X 8
Situation be example, construct the serial encoding circuitry shown in Fig. 2.In fact, Fig. 2 is the connection layout specialized of Fig. 1.This circuit comprises S 0~ S 7eight registers.
Concrete, during circuit working, clock signal clk controls eight register S 0~ S 7.When rising edge clock arrives, the output of eight registers sends into next stage respectively, produces the output of next stage simultaneously.After information bit has inputted, the value of preserving in 8 registers has been exactly the value of 8 bit check positions.Together with the data of preserving in 8 registers input with the external world, cyclic shift.Understand according to algebraic method, 8 bit check positions are exactly the information bit multinomial that information bit is formed, and are then multiplied by X 8(output of input information and rightmost register together computing is equivalent to be multiplied by X 8), then the coefficient of the residue obtained divided by the generator polynomial g (X) that BCH is corresponding.
In step S2, according to this serial encoding circuitry, be respectively each register in serial encoding circuitry, the first relational expression between the redundancy check bit that after redundancy check bit that after obtaining input the i-th+1 information bit, it stores and input i-th information bit, each register memory stores up, the i-th+1 information bit of input, i≤6 and be nonnegative integer.
Still with above-mentioned (15,7) BCH code for example, according to Fig. 2, can be each register in 8 registers of Fig. 2, obtain the first relational expression as follows:
S 0 i + 1 = S 7 i + u i + 1 S 1 i + 1 = S 0 i S 2 i + 1 = S 1 i S 3 i + 1 = S 2 i S 4 i + 1 = S 3 i + S 7 i S 5 i + 1 = S 4 i S 6 i + 1 = S 5 i + S 7 i S 7 i + 1 = S 6 i + S 7 i - - - ( 1 )
Wherein, each register S after expression input i-th information bit 0~ S 7the redundancy check bit of interior storage, each register S after expression input the i-th+1 information bit 0~ S 7the redundancy check bit of interior storage, u i+1represent the i-th+1 information bit of input.As shown in Figure 2, register S 7after input the i-th+1 information bit its storing value be on a clock cycle (after inputting i-th) last register S 6the result that the value mould two that the value passed over and itself pass over adds, namely register S 6after input the i-th+1 information bit its storing value be on a clock cycle (after inputting i-th) last register S 5the value passed over and register S 7the result that the value mould two passed over adds, namely adding here is all that mould two adds.
In step s3, according to the first relational expression (1), be respectively each register in serial encoding circuitry, the redundancy check bit that when obtaining redundancy check bit of its storage after inputting whole 7 information bits and do not input any information bit, each register memory stores up, second relational expression (2) of whole 7 information bits.Particularly:
In sub-step S31, by the first relational expression vectorization obtained for each register in serial encoding circuitry, thus obtain represent input the i-th+1 information bit after the vector of the redundancy check bit that 8 registers store, input after the vector of redundancy check bit that stores of 8 registers and input i-th information bit the i-th+1 information bit between the primary vector relational expression of relation.
Still with above-mentioned (15,7) BCH code be example for example, the first relational expression (1) is rewritten into primary vector relational expression (I):
S i + 1 = A [ S i &CirclePlus; G , i + 1 ] - - - ( I )
S ithe vector of the redundancy check bit of 8 register storages after expression input i-th information bit, S i+1the vector of the redundancy check bit of 8 register storages after expression input the i-th+1 information bit.Still with aforementioned (15,7) BCH code for example:
S i = [ S 7 i , S 6 i , . . . . . . S 0 i ]
S i + 1 = [ S 7 i + 1 , S 6 i + 1 , . . . . . . S 0 i + 1 ]
The coefficient matrix of matrix A for being obtained by each coefficient in above formula (1).Matrix A is:
A = 1 1 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0
G i+1it is the vector of the i-th+1 information bit of reflection input.It is a column vector, and the first row is the vector of the i-th+1 information bit of input, all the other behaviors 0.If U is the vectorial U=[u of all information bits composition 0, u 1..., u 6],
G = 1 0 0 0 0 0 0 0 &CenterDot; U = u 0 u 1 u 2 u 3 u 4 u 5 u 6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 8 &times; 7
Wherein G , i+1i-th+1 row of representing matrix.
In sub-step S32, according to primary vector relational expression (I), obtain the secondary vector relational expression of the vector of the redundancy check bit that 8 registers store after representing whole 7 information bits of input and relation when not inputting any information bit between the vector of the redundancy check bit that 8 registers store, whole 7 information bits.
With above-mentioned (15,7) BCH code for example, by primary vector relational expression (I), obtain secondary vector relational expression (II):
S 7 = A [ S 6 &CirclePlus; G , 7 ] = A [ A [ S 5 &CirclePlus; G , 6 ] &CirclePlus; G , 7 ] = . . . = A 7 S 0 &CirclePlus; A 7 G , 1 &CirclePlus; . . . &CirclePlus; A 2 G , 6 &CirclePlus; AG , 7 - - - ( II )
S 7for the vector of the redundancy check bit of 8 register storages after whole 7 information bits of expression input, S 0the vector of the redundancy check bit that 8 registers store during for not inputting any information bit.The redundancy check bit of register memory storage each when not inputting any information bit all can be set to 0, now S 0be 0, above formula (II) becomes:
S 7 = A 7 G , 1 &CirclePlus; . . . &CirclePlus; A 2 G , 6 &CirclePlus; AG , 7 - - - ( II - 1 )
In step S33, from secondary vector relational expression, obtain the second relational expression of each register corresponded in serial encoding circuitry.
With above-mentioned (15,7) BCH code for example, above formula (II-1) is launched to obtain following expression, namely corresponds to the second relational expression of each register in serial encoding circuitry:
S 7 7 = u 0 + u 2 + u 6 S 6 7 = u 0 + u 1 + u 2 + u 5 + u 6 S 5 7 = u 1 + u 2 + u 4 + u 5 + u 6 S 4 7 = u 0 + u 1 + u 3 + u 4 + u 5 S 3 7 = u 3 + u 4 + u 6 S 2 7 = u 2 + u 3 + u 5 S 1 7 + u 1 + u 2 + u 4 S 0 7 = u 0 + u 1 + u 3 - - - ( 2 )
Step S3 also can perform not according to the mode of above-mentioned S31-S33.Such as, directly from the first relational expression (1), namely
S 0 i + 1 = S 7 i + u i + 1 S 1 i + 1 = S 0 i S 2 i + 1 = S 0 i S 3 i + 1 = S 2 i S 4 i + 1 = S 3 i + S 7 i S 5 i + 1 = S 4 i S 6 i + 1 = S 5 i + S 7 i S 7 i + 1 = S 6 i + S 7 i - - - ( 1 ) , also can be by be expressed as u 0-u 6function, namely obtain (2), only process is complicated a little.
Herein, plus sige all represents the addition on mould two, namely equals binary XOR
In step S4, according to the second relational expression, construct with 7 information bits be input, 8 redundancy check bits are the parallel encoding circuit exported.
With above-mentioned (15,7) BCH code for example, according to above-mentioned (2), construct parallel encoding circuit as shown in Figure 3.
Suppose that information bit to be encoded is for (1100000), corresponding multinomial is U (X)=1+X, and U (X) is multiplied by X 8after divided by generator polynomial:
g(X)=φ 1(X)·φ 2(X)=1+X 4+X 6+X 7+X 8
Rear residue is X+X 5+ X 7.
Therefore the code word after coding is (010001011100000), can by formula checking derivation result is correct above.
The present invention proposes the coding circuit method for designing of one (15,7) BCH code, adopts parallel circuit to replace traditional tandem coding solution, can not by the restriction of clock cycle, and greatly shorten the scramble time, coding rate improves greatly.

Claims (3)

1. the coding circuit method for designing of one kind (15,7) BCH code, this coding circuit method for designing comprises:
According to the generator polynomial of this (15,7) BCH code, there is the serial encoding circuitry of the register of 8 series connection;
According to this serial encoding circuitry, be respectively each register in serial encoding circuitry, the first relational expression between the redundancy check bit that after redundancy check bit that after obtaining input the i-th+1 information bit, it stores and input i-th information bit, each register memory stores up, the i-th+1 information bit of input, i≤6 and be nonnegative integer;
According to the first relational expression, be respectively each register in serial encoding circuitry, the redundancy check bit that when obtaining redundancy check bit of its storage after inputting whole 7 information bits and do not input any information bit, each register memory stores up, the second relational expression of whole 7 information bits;
According to the second relational expression, construct with 7 information bits be input, 8 redundancy check bits are the parallel encoding circuit exported.
2. coding circuit method for designing according to claim 1, the redundancy check bit wherein not inputting each register memory storage during any information bit is all set to 0.
3. coding circuit method for designing according to claim 1, wherein comprises according to the step that the first relational expression obtains the second relational expression:
By the first relational expression vectorization obtained for each register in serial encoding circuitry, thus obtain represent input the i-th+1 information bit after the vector of the redundancy check bit that 8 registers store, input after the vector of redundancy check bit that stores of 8 registers and input i-th information bit the i-th+1 information bit between the primary vector relational expression of relation;
According to primary vector relational expression, obtain the secondary vector relational expression of the vector of the redundancy check bit that 8 registers store after representing whole 7 information bits of input and relation when not inputting any information bit between the vector of the redundancy check bit that 8 registers store, whole 7 information bits;
From secondary vector relational expression, obtain the second relational expression of each register corresponded in serial encoding circuitry.
CN201410594712.0A 2014-10-29 2014-10-29 Method for designing encoding circuits of (15,7) BCH codes Pending CN104320145A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410594712.0A CN104320145A (en) 2014-10-29 2014-10-29 Method for designing encoding circuits of (15,7) BCH codes

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410594712.0A CN104320145A (en) 2014-10-29 2014-10-29 Method for designing encoding circuits of (15,7) BCH codes

Publications (1)

Publication Number Publication Date
CN104320145A true CN104320145A (en) 2015-01-28

Family

ID=52375341

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410594712.0A Pending CN104320145A (en) 2014-10-29 2014-10-29 Method for designing encoding circuits of (15,7) BCH codes

Country Status (1)

Country Link
CN (1) CN104320145A (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1126397A (en) * 1994-03-25 1996-07-10 三菱电机株式会社 Error-correcting encoder, error-correcting decoder and data transmitting system with error-correctincodes
WO2004059851A1 (en) * 2002-12-30 2004-07-15 Optix Networks Ltd. An encoder for high rate parallel encoding
CN101227194A (en) * 2008-01-22 2008-07-23 炬力集成电路设计有限公司 Circuit, encoder and method for encoding parallel BCH
US20110185265A1 (en) * 2010-01-27 2011-07-28 Raghunath Cherukuri High-speed and agile encoder for variable strength long BCH codes
CN102761340A (en) * 2012-08-10 2012-10-31 济南微晶电子技术有限公司 Broadcast channel (BCH) parallel coding circuit
CN102820892A (en) * 2012-06-20 2012-12-12 记忆科技(深圳)有限公司 Circuit for parallel BCH (broadcast channel) coding, encoder and method

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1126397A (en) * 1994-03-25 1996-07-10 三菱电机株式会社 Error-correcting encoder, error-correcting decoder and data transmitting system with error-correctincodes
WO2004059851A1 (en) * 2002-12-30 2004-07-15 Optix Networks Ltd. An encoder for high rate parallel encoding
CN101227194A (en) * 2008-01-22 2008-07-23 炬力集成电路设计有限公司 Circuit, encoder and method for encoding parallel BCH
US20110185265A1 (en) * 2010-01-27 2011-07-28 Raghunath Cherukuri High-speed and agile encoder for variable strength long BCH codes
CN102820892A (en) * 2012-06-20 2012-12-12 记忆科技(深圳)有限公司 Circuit for parallel BCH (broadcast channel) coding, encoder and method
CN102761340A (en) * 2012-08-10 2012-10-31 济南微晶电子技术有限公司 Broadcast channel (BCH) parallel coding circuit

Similar Documents

Publication Publication Date Title
US7543212B2 (en) Low-density parity-check (LDPC) encoder
CN105553485B (en) BCH coding and decoding device and its decoding method based on FPGA
CN101946230B (en) Method and system for detection and correction of phased-burst errors, erasures, symbol errors, and bit errors in received symbol string
US10200065B2 (en) Apparatus and method for correcting at least one bit error within a coded bit sequence
CN103886915B (en) Circuitry and method for correcting 3-bit errors containing adjacent 2-bit error
CN103023518B (en) A kind of error correction method of the circulation Hamming code based on parallel encoding decoding
US20170075754A1 (en) Apparatus and method for parallel crc units for variably-sized data frames
CN110071727B (en) Encoding method, decoding method, error correction method and device
CN101814922A (en) Multi-bit error correcting method and device based on BCH (Broadcast Channel) code and memory system
Freudenberger et al. A configurable Bose–Chaudhuri–Hocquenghem codec architecture for flash controller applications
CN103199873B (en) The quickly configuration method of two-stage piecemeal CRC computing
CN103325425B (en) Memory controller
CN101483442B (en) BCH decoder for configuring error correcting capability according to Nand Flash extra space
US9614550B2 (en) Parallel BCH coding circuit, encoder and method
Parvathi et al. FPGA based design and implementation of Reed-Solomon encoder & decoder for error detection and correction
CN102761340B (en) Broadcast channel (BCH) parallel coding circuit
CN106708654A (en) Circuit structure for BCH error correcting code of NAND flash
US9336085B2 (en) Memory system and memory controller
US20180219560A1 (en) List decode circuits
CN103309766A (en) Error correction method of cyclic hamming code based on parallel coding and decoding
CN104320145A (en) Method for designing encoding circuits of (15,7) BCH codes
US20060227017A1 (en) Information encoding by shortened reed-solomon codes
CN104506201A (en) Code circuit designing method for (15, 5) BCH (Bose, Chaudhuri and Hocquenghem) code
US10009041B2 (en) BCH decorder in which folded multiplier is equipped
El-Medany FPGA implementation of CRC with error correction

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20150128

RJ01 Rejection of invention patent application after publication