Abstract:
PROBLEM TO BE SOLVED: To provide a signal processing method, a signal processing system, a program for the signal processing, and a computer-connectable recording medium for recording the processing program. SOLUTION: The signal processing method for the digital signal includes a step of formulating a Yule-Walker equations in a prescribed form of a matrix of elements in a Galois field (2 ) and a vector, including the element as a factor in the Galois field (2 ), a step of returning the solution of the equation to a calculation of a symmetric matrix in a Jacobi's formula, a step of determining the number of errors as the size of the maximum matrix corresponding to the solution other than zero, and a step of determining whether or not the number of errors is equal to the maximum number of correctable errors.
Abstract:
PROBLEM TO BE SOLVED: To provide a combinational circuit, an encoder by using the combinational circuit, a decoder, and a semiconductor device. SOLUTION: The combinational circuit includes a plurality of multipliers, for multiplying individually two or more encoded digital signals in a Galois field GF (2 ), where (m) is an integer of 2 or larger. The multiplier is composed of an input-side XOR processor, an AND processor and an output-side XOR processor, and the input-side XOR processor functions in common, for the plurality of multipliers. The multiplier includes an adder connected between the AND processor and the output-side XOR processor, and the output-side XOR processor is used in common. The output from the AND processors of the multipliers are added by the adder, and the added result can be processed by the common output-side XOR processor.
Abstract:
PROBLEM TO BE SOLVED: To provide a technique for realizing a high speed combinational circuit including an S-Box and for simultaneously generating an RO-BDD prescribing the circuit structure of the combinational circuit. SOLUTION: The combinational circuit is provided with the number of independent selector groups 100 to 170 corresponding to the number of output bits that individually generates the output bits and a driver chain that supplies primary input to the respective selector groups 100 to 170, the respective selector groups 100 to 170 are provided with a plurality of selectors 101 connected by forming the number of stages equal to or less than the number of bits of the primary input and selected signals of the selectors 101 at the respective stages are driven by one primary input. COPYRIGHT: (C)2003,JPO
Abstract:
PROBLEM TO BE SOLVED: To provide a decoding circuit, a decoder with the decoding circuit, a decoding method, and a semiconductor device. SOLUTION: The decoding circuit for correcting an error in digital signal is composed of an input unit 10 for receiving an input digital encoded signal ID in parallel corresponding to code interleaving; a processing unit 12, including an error-position polynomial coefficient processing unit 18 and an error-value polynomial coefficient processing unit 20 for processing each data output in serial among interleaved encoded words from the input unit 10; and an output unit 14 for receiving the output of the processing unit 12 and the input digital signal ID, and generating an output digital signal OD, in parallel corresponding to the code interleaving, after the error is corrected in a linear processing in the Galois field from the output of processing unit 12 and the input digital signal.
Abstract:
PROBLEM TO BE SOLVED: To reduce the overall circuit scale by allowing a plurality of coding circuits having different maximum error correction capability to share most of circuit components in common. SOLUTION: In the case that a received message is an information word, an attachment circuit 10 attaches a fixed value to the information word. Then a linear arithmetic circuit 11 receives data resulting from attaching the fixed value to this information word, or data of the received message when it is a received word, or data resulting from adding a prescribed fixed value to a received word, if required, to make number of bits of the data given to the linear arithmetic circuit constant, and applies a linear arithmetic operation to the received data by using a prescribed matrix to calculate an intermediate signal (u). The bit length of the intermediate signal (u) is smaller than that of a corrected word given to the linear arithmetic circuit 11. That is, number of circuits can remarkably be reduced by using the intermediate signal (u) with the smaller bit length so as to obtain a parity value or the like without using the information word and the received word that are directly received for the parity calculation and the syndrome calculation.
Abstract:
PROBLEM TO BE SOLVED: To provide a method of an inverse discrete cosine transform (IDCT) for reproducing a compressed image with high fidelity by limiting an accumulation of round-off errors of the decimal point arithmetic. SOLUTION: The method of the inverse discrete cosine transform includes a step for receiving a temporary data t'(k, v) with 30 bits as a result of executing a one dimensional inverse discrete cosine transform, a mode 0 step for reserving a memory for 11 bits (without including a sign bit S) for use of an integer when the temporary data is stored in an external RAM if the integer of the data t'(k, v) is not within a range of -128 to +127, and a mode 1 step, which, on the other hand, reserves 7 bits (without including a sign bit S) for the integer if the integer is within the range of -128 to +127 and allocates remaining 4 bits to the decimals. Consequently, the method can increase the accuracy of computing the data t'(k, v) without expanding the external RAM required for temporally storing the data t'(k, v). COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To provide a multiplication module for multiplying m-bit data on a Galois field GF (2m) (m>=1). SOLUTION: This multiplication module is provided with 1st and 2nd power exponent computing means u1 and u2 to which 1st m-bit data is inputted from a 1st input part, a 1st multiplying means u3 to which the 1st m-bit data and an output from the 1st power exponent computing mean are inputted, a 2nd multiplying means u4 to which 2nd m-bit data from a 2nd input part and an output from the means u2 are inputted and a selecting means u5 to which an output signal of a the 2nd multiplying means and the 2nd m-bit data are inputted. A 1st control signal S1 is inputted to the 1st power exponent computing means, a 2nd control signal S2 is inputted to the 2nd power exponent computing means, a 3rd control signal S0 for controlling the output of the selecting means is inputted to the selecting means, the 1st multiplying means outputs a 1st output signal, and the selecting means outputs a 2nd output signal.
Abstract:
PROBLEM TO BE SOLVED: To provide a decoding circuit for a Reed-Solomon code which is fast and low power consumption. SOLUTION: A syndrome calculating circuit 1 calculates a syndrome Sj (j=0, 1,..., 2t-1) from a 1st codeword Yi (i=0, 1,..., n-1) that may include an error. A coefficient calculating circuit 3 calculates the coefficient Λk of an error position polynomial corresponding to the number of estimated errors (e) (e
Abstract:
PROBLEM TO BE SOLVED: To provide a technology for the encryption processing of stored data and the management of an encryption key suitably applicable to the case that the user authentication and encryption of stored data are both applied to a storage device. SOLUTION: The storage device is provided with an encryption circuit 54 for using an encryption key created from prescribed individual identification information such as a password to encrypt desired data and the individual identification information itself, a magnetic disk 10 for recording the data and the individual identification information encrypted by the encryption circuit 54, and a CPU 58 for using the encrypted individual identification information stored in the magnetic disk 10 to authenticate a user. Then the storage device authenticates the user on the basis of authentication data, uses the encryption key to encrypt write data transmitted from a host system and records the encrypted data to the magnetic disk 10, or uses the encryption key to decrypt the data read from the magnetic disk 10 and to transmit the decrypted data to the host system. COPYRIGHT: (C)2004,JPO&NCIPI