Coding apparatus capable of high speed operation

Claim 2

A coding apparatus comprising: a first shift register for performing bit shifting on an input bit sequence and storing each bit of the input bit sequence in a sequential manner; an input register for storing coefficients of terms of respective orders of a generator polynomial; and a logical operation section for obtaining: logical products of the respective bits stored in the first shift register and corresponding coefficients of terms stored in the input register, a logical product of a next bit of the input bit sequence to be input into the first shift register and a corresponding coefficient of term stored in the input register; and deriving an exclusive logical sum of the logical products obtained; and then outputting the sum as one bit of a code sequence, wherein each time a given bit of the input bit sequence is shifted into said first shift register, said given bit corresponds with a higher order of the coefficients of terms of the generator polynomial stored in said input register.

Claim 3

The apparatus of claim 1 , further comprising a second shift register for storing the input bit sequence thereon, wherein the second shift register performs bit shifting on the input bit sequence and outputs one bit of the input bit sequence after another to the first shift register.

Claim 4

The apparatus of claim 2 , further comprising a memory for storing and then outputting the input bit sequence, wherein the logical operation section gets the code sequence stored on the memory.

Claim 5

The apparatus of claim 2 , wherein the logical operation section outputs the code sequence to the second shift register, and wherein the second shift register allocates one bit of the code sequence after another to a bit position at which no bit of the input bit sequence is stored anymore as a result of the bit shifting.

Claim 6

A digital signal processor comprising the coding apparatus recited in claim 2 and an arithmetic and logic unit, wherein the input register is connected to the arithmetic and logic unit.

Claim 7

A digital signal processor comprising the coding apparatus recited in claim 2 , the digital signal processor and the coding apparatus being integrated together on the same semiconductor substrate.

Claim 8

The apparatus of claim 1 , wherein the logical operation section comprises: a plurality of AND gates for obtaining the respective logical products; and a plurality of exclusive OR gates for obtaining the exclusive logical sum, wherein the number of gates existing between one of the AND gates and a last-stage one of the exclusive OR gates is different from the number of gates existing between another one of the AND gates and the last-stage exclusive OR gate by no greater than one.

Claim 9

A coding apparatus comprising: a shift register for performing bit shifting and storing one input bit after another; a first input register for storing coefficients of terms on respective orders of a first generator polynomial; a second input register for storing coefficients of terms on respective orders of a second generator polynomial; a first logical operation section; and a second logical operation section, wherein the first logical operation section: obtains logical products of the respective bits stored in the shift register and corresponding coefficients of terms of said first generator polynomial, wherein each time a given bit is shifted into said shift register, said given bit corresponds with a higher order of the coefficients of terms of the first generator polynomial stored in the first input register; and derives an exclusive logical sum of the logical products obtained and a bit of an input bit sequence, which bit is currently input to the first logical operation section; and then outputs the sum to the shift register, and wherein the second logical operation section: obtains logical products of the respective bits stored in the shift register and corresponding coefficients of terms of said second generator polynomial stored in the second input register; a logical product of a next bit to be input into the shift register and a corresponding coefficient of term of the second generator polynomial stored in the second input register wherein each time a given bit is shifted into said shift register, said given bit corresponds with a higher order of the coefficients of terms of the second generator polynomial stored in the second input register; and derives an exclusive logical sum of the logical products obtained; and then outputs the sum as one bit of a code sequence.

Claim 10

A coding apparatus comprising: a shift register for performing bit shifting and storing one input bit after another; a first input register for storing coefficients of terms on respective orders of a first generator polynomial; a second input register for storing coefficients of terms on respective orders of a second generator polynomial; a first logical operation section; and a second logical operation section, wherein the first logical operation section: obtains logical products of the respective bits stored in the shift register and corresponding coefficients of terms of said first generator polynomial, wherein each time a given bit is shifted into said shift register, said given bit corresponds with a higher order of the coefficients of terms of the first generator polynomial stored in the first input register; and derives an exclusive logical sum of the logical products obtained and a bit of an input bit sequence, which bit is currently input to the first logical operation section; and then outputs the sum to the shift register, and wherein the second logical operation section: obtains logical products of the respective bits stored in the shift register and corresponding coefficients of terms of said second generator polynomial stored in the second input register; a logical product of a next bit to be input into the shift register and a corresponding coefficient of term of the second generator polynomial stored in the second input register wherein each time a given bit is shifted into said shift register, said given bit corresponds with a higher order of the coefficients of terms of the second generator polynomial stored in the second input register; and derives an exclusive logical sum of the logical products obtained; and then outputs the sum as one bit of a code sequence.

Claim 11

A coding method comprising the steps of: performing bit shifting on an input bit sequence and storing each bit of the input bit sequence in a sequential manner in a shift register; obtaining logical products of the respective bits stored in the shift register and corresponding coefficients of terms of respective orders of a generator polynomial stored on an input register; and a logical product of a next bit of the input bit sequence to be input into the shift register and a corresponding coefficient of term stored in the input register; and deriving an exclusive logical sum of the logical products obtained and then outputting the sum as one bit of a code sequence.

Claim 12

A coding method comprising the steps of: performing bit shifting on an input bit sequence and storing each bit of the input bit sequence in a sequential manner in a shift register; obtaining logical products of the respective bits stored in the shift register and corresponding coefficients of terms of respective orders of a generator polynomial stored on an input register; and a logical product of a next bit of the input bit sequence to be input into the shift register and a corresponding coefficient of term stored in the input register; and deriving an exclusive logical sum of the logical products obtained and then outputting the sum as one bit of a code sequence.

Claim 13

A digital signal processor, which realizes the coding method recited in claim 9 by executing a single instruction.

Claim 14

A coding method comprising the steps of: performing bit shifting and storing one input bit after another in a shift register; obtaining logical products of the respective bits stored in the shift register and corresponding coefficients of terms of a first generator polynomial, said coefficient of terms of the first generator polynomial being stored in a first input register, wherein each time a given bit is shifted into said shift register, said given bit corresponds with a higher order of the coefficients of terms of the first generator polynomial; deriving an exclusive logical sum of the logical products obtained and a bit of an input bit sequence, which bit is currently input to the shift register, and then outputting the sum to the shift register; obtaining logical products of the respective bits stored in the shift register and corresponding coefficients of terms of a second generator polynomial stored in a second input register; and a logical product of a next bit to be input into the shift register and a corresponding coefficient of term of the second polynomial stored in the second input register, wherein each time a given bit is shifted into said shift register, said given bit corresponds with a higher order of the coefficients of terms of the second generator polynomial stored in the second input register, and deriving an exclusive logical sum of the logical products obtained and then outputting the sum as one bit of a code sequence.

Claim 15

A coding method comprising the steps of: performing bit shifting and storing one input bit after another in a shift register; obtaining logical products of the respective bits stored in the shift register and corresponding coefficients of terms of a first generator polynomial, said coefficient of terms of the first generator polynomial being stored in a first input register, wherein each time a given bit is shifted into said shift register, said given bit corresponds with a higher order of the coefficients of terms of the first generator polynomial; deriving an exclusive logical sum of the logical products obtained and a bit of an input bit sequence, which bit is currently input to the shift register, and then outputting the sum to the shift register; obtaining logical products of the respective bits stored in the shift register and corresponding coefficients of terms of a second generator polynomial stored in a second input register; and a logical product of a next bit to be input into the shift register and a corresponding coefficient of term of the second polynomial stored in the second input register, wherein each time a given bit is shifted into said shift register, said given bit corresponds with a higher order of the coefficients of terms of the second generator polynomial stored in the second input register, and deriving an exclusive logical sum of the logical products obtained and then outputting the sum as one bit of a code sequence.

Claim 16

A digital signal processor, which realizes the coding method recited in claim 11 by executing a single instruction.