Digital signal processing circuit

Abstract: A digital signal processing circuit of a so-called RNS system is disclosed in which an RNS encoder (10) for converting input data into RNS code data is provided with a converter (1) for connecting the input data into a multiple of one or more of the moduli of the RNS code. The converter (1) is operated in the case of occurrence of a trouble in the processing system of the moduls to locate the site of the trouble on the basis of the output of the digital signal processing circuit.

Description: This invention relates to a digital signal processing circuit making use of the so-called RNS system in which the input data expressed by the binary code is processed after conversion thereof into the RNS code which represents the input data by the combination of residues obtained by dividing the input data by plural moduli. Description of the Prior Art As a digital signal processing circuit, a system of an arithmetic operation making use of the RNS system (residue number system) has been proposed in IRE transactions on electronic computers, vol. EL-8, No. 6, June 1959, pages 140 to 147 or in IEEE computer, vol. 17, No. 5, May 1984, pages 50 to 61. With the digital signal processing system, making use of the RNS system, the input data represented by the binary code is converted into the RNS code in which the input data is represented by the combination of residues obtained upon dividing the input data by plural moduli, and the modulo operation is performed in each of the systems allocated to the respective moduli, so that the carry operation such as in a binary operation operation becomes unnecessary to perform at the time of the arithmetic operation, and hence digital signals can be processed more accurately and at a higher processing speed. As a digital signal processing system making use of the above mentioned RNS system, there is a digital filter system, as disclosed in "Treatises of Electric Communication Association," '84/4 vol. J67-1, No. 4, pages 536 to 543. The digital filter apparatus making use of the above mentioned RNS system is constructed as shown in Fig. 1. The digital filter apparatus of the RNS system shown in Fig. 1 is constituted by an encoder section 40 to which a digital video signal D BI represented by the binary code is entered, a filter section 50 to which an output of the encoder section 40 is entered, and a decoder section 60 to which an output of the filter section 50 is supplied. The encoder section 40 is constituted by (n+1) encoders 41, 42, ..., each of which is formed by a ROM conversion table. The conversion table employed in the above encoders 41, 42, ... , is constituted by a ROM into which are written residue data R 0 , R 1 , R 2 , ..., R n which are obtained by dividing the binary code data by (n+1) positive integers that are prime numbers with respect to one another and whi ch are associated with the moduli m 0 , m 1 , m 2 , ..., m n , respectively. The digital video signal D BI represented in the binary code, entered into the encoder section 40, is inoverted by the encoders 41, 42, ... making use of the conversion talbe, into the residue data R 0 , R 1 , R 2 , ..., R n , associated with the moduli m 0 , m 1 , m 2 , ..., mn, respectively. When the digital video signal D BI is entered into the encoder section 40, the RNS code data D RI represented by the combination of the residue data R 0 , R 1 , R 2 , ..., R n produced by the encoders 41, 42, ... is output from the encoder section 40. The RNS code data D RI , output by the encoder section 40, is supplied to the filter section 50. The filter section 50 is constituted by (n+1) digital filter circuits 51, 52, ... associated with the coefficients m 0 , m 1 , m 2 , ..., m n respectively. Each of the digital filter circuits 51, 52, ... processes the RNS code data D RI supplied from the encoder section 40 by a modulo operation for affording the desired same filter characteristics to each of the above residue data R 0 , R 1 , R 2 , ..., R n , that is, to each of the moduli m 0 , m 1 , m 2 , ..., m n . Meanwhile, the digital filter circuit 51 performs an arithemtic moduls operation on the residue data R 0 , the digital filter circuit 52 performs an arithmetic modulo operation on the residue data R 1 , and so forth, so that each of the digital filter circuits performs a modulo operation for each of the residue data allocated thereto. That is, in the filter section 50, each of the digital filter circuits 51, , 52, ... processes the RNS code data D RI represented by the combination of the rsidue data R 0 , R 1 , R 2 , ..., R n by a separate modulo operation for each of the moduli m 0 , m 1 , m 2 , ..., m n , so that the residue data having desired filter characteristics are formed by the digital filter circuits 51, 52, ... The filter section 50 outputs RNS code data D RO represented by the combination of the residue data obtained by the digital filter circuits 51, 52, .... The RNS code data D RO , output by the filter section 50, is supplied to the decoder section 60. The decoder section 60 is constituted by a conversion table formed by a ROM. The conversion table employed in the decoder section 60 is constituted by a ROM in which the binary code data corresponding to the RNS code data are written as the conversion table data. This decoder section 60 outputs the RNS code data D RO supplied from the filter section 50 after conversion into corresponding binary code data D BO by the above conversion table. It is noted that the above RNS code data may be converted into the binary code data based on, for example, Son's residue theorem. According to Son's residue theorem, if the residue r i of x by a modulus m i is expressed by a formula (1) r i = x mod m i by using a symbol mod, the RNS code data D RO is expressed by the combination of residue data R 0 , R 1 , R 2 , ..., R n by positive integers m 0 , m 1 , m 2 , ..., m n , that are prime nubers with respect to a positive integer, and the RNS code data may be demodulated into a binary code data having the value B by solving the formula (5) from the values M, M i and N i represented by the formulas (2), (3) and (4) M i = M m i 1 = N i M i mod m i The decoder section 60 may be constituted by using a ROM conversion table in which the thus produced binary code data are written as the conversion table data. In the above described digital filter apparatus shown in Fig. 1, with n=4, m 0 =7, m 1 =11, m 2 =13, m 3 =15 and m 4 =16, as an example, the relation of correspondence between the binary code data D B and the RNS code data D R may be represented as shown in the following Table 1. Relation of Correspondence Between Binary Code Data D B and RNS Code Data D R with m 0 =7, m 1 =11, m 2 =13, m 3 =15 and m 4 =16 Binary Code Data D B RNS Code Data D R m 0 m 1 m 2 m 3 m 4 0 0 0 0 0 0 1 1 1 1 1 1 2 2 2 2 2 2 7 0 7 7 7 7 1 0 0 0 0 0 5 10 4 10 0 1 0 0 0 0 1 6 0 5 11 1 1 0 0 0 0 2 2 0 1 6 12 2 1 0 0 0 0 3 1 2 7 13 3 With the digital filter appratus, making use of the RNS system, when the binary code data D B are continuous, the RNS code data D R are also changed continously. However, the binary code data D B which is represented when the residue data of any of the moduli of the RNS code data D R [00000] which stands for [0] of the binary code data proves to be 1 is as shown in the following Table 2. Binary Code D B Represented When Residue Data of Any of Moduli of RNS Code Data D R [00000] is 1 RNS Code Data D R Binary Code Data D B m 0 m 1 m 2 m 3 m 4 0 0 0 0 0 0 1 0 0 0 0 2 0 5 9 2 0 0 1 0 0 0 1 9 6 5 6 0 0 0 1 0 0 3 6 9 6 0 0 0 0 1 0 1 7 6 1 7 6 0 0 0 0 1 1 0 5 1 0 5 Thus it is seen that, when the value of the residue data of any of the moduli m 0 , m 1 , m 2 , m 3 or m 4 of the RNS code data D R is changed only by one, the value of the associated binary code data D B is changed drastically. Hence, with the digital filter apparatus making use of the RNS system, when only one signal bit is shrted with the other signal bit or deteriorated to 0 or 1, the result of decoding becomes significantly different from the true value. For this reason, in case a malfunction occurs in a modulus series or system, it can be estimated only difficultly in which signal bit of which modulus system the malfunctioning has occurred. From ICASSP '88 V&E, VLSI SPECTRAL ESTIMATION, vol. 4, New York, 4/88, pp 2076-2079 it is known how to employ the algebraic and structural properties of Residue Number System (RNS) to optimize the design of systolic arrays. RNS is employed to establish parallelism on the algorithmic level by decomposing the original computational field into a set of finite fields, in which arithmetic operations are performed independently for each field. The use of systolic arrays for RNS structures is discussed. The impact of the moduli size on the structural choices is analyzed. Three different structures; word-parallel, bit-parallel, and bit-serial, are presented. Redundant RNS is used for fault-tolerance capabilities. A fault detection technique is shown as an alternative to the standard procedure based on mixed radix algorithm and Finite Impulse Response (FIR) filter algorithm is used. In "The Design of Error Checkers for Self-Checking Residue Number Arithmetic", IEEE transactions on computers, vol. C-32, No. 4, 4/83, pages 388 to 396 a digital signal processing apparatus similar to the one shown in figure 1 it is disclosed. The digital signal processing apparatus disclosed in this article comprises RNS encoding means for generating residue data for each RNS modulus and processing means for processing said residue data for generating processed data. The processing means comprise an encoder section, a filter section and a decoder section. The apparatus disclosed, however, suffers from the same disadvantages as the system discussed refering to figure 1. The object of the present invention is therefore to provide a digital signal processing apparatus in which, on occurance of malfunctioning, such as shorting of a signal bit to another signal bit or deterioration to 0 or 1 the location of the trouble may be estimated by trouble diagnosis. It is a more specific object of the present invention to provide a digital signal processing apparatus in which, by observation of the analog signal wave form of the output signal, it can be estimated in which modulus system the trouble has occured. These objects are solved by a digital signal processing apparatus with the features of claim 1. Claims 2 to 4 comprise further developments of the present invention. The objects as well as the novel features of the present invention will become apparent upon reading the following detailed description in conjunction with the accompanying drawings and the new matter pointed out in the claim. Brief Description of the Drawings Fig. 1 is a block diagram showing the construction of a conventional digital filter apparatus employed the RNS system. Fig. 2 is a block diagram showing the construction of a digital filter apparatus according to the present invention. Figs. 3A and 3B are waveform diagrams for illustrating the operation of the trouble diagnostic mode in the digital filter apparatus shown in Fig. 2. Fig. 4 is a block diagram showing essential portions of a modified embodiment of the digital filter apparatus according to the present invention. Fig. 5 is a block diagram showing an example of the construction of a decoder in the digital filter apparatus shown in Fig. 2. Fig. 6 is a block diagram showing an example of the construction of a random noise generator in the decoder shown in Fig. 2. Fig. 7 shows the state of occurrence of a carry in a fractional number data processing circuit in the decoder shown in Fig. 2. Fig. 8 is a block diagram showing another example of the construction of another random noise generating circuit in the decoder shown in Fig. 2. Detailed Description of the Preferred Embodiment An embodiment of the present invention will be hereinafter explained by referring to the accompanying drawings. In the present embodiment, a digital filter apparatus of the RNS system, having positive integers m 0 , m 1 , m 2 , m 3 and m 4 , which are prime numbers relative to one another, as moduli, in which, on occurrence of a trouble such as shorting of a signal pit to another or deterioration to 1 or 0, the site of such trouble can be estimated by trouble diagnosis. Referring to Fig. 2, the digital signal processing circuit of the present invention is constituted by an input converting section 1 to which binary code data D S and control data D CTL are entered, an encoder section 10 to which the converted output of the converting section 1 is engtered, a filter section 20 to which an encoded output of the encoding section 10 is supplied and a decoding section 30 to which the output of the filter section 20 is supplied. The input converting section 1 is constituted by using a conversion table formed by a ROM. The conversion table, employed in the input converting section 1, is constituted by a ROM into which 15-bit conversion table data are written, and to which are entered the lower 10 bit binary code data D S as the input signal and the upper 5 bit control data D CTL as the control signal. In the input converting section 1 , the lower 10-bit binary code data D S is subjected, by the above mentioned conversion table, to 2 5 =32 modes of converting operations (1) to (6) designated by the above mentioned upper 5-bit control data D CTL . These modes may be summarized as follows: (1) The binary code data D S is output directly as the binary code output S one mode (2) The binary code data S is output in the form of a multiple of m i , where i = 0, 1, ..., 4 five modes (3) The binary code data S is output in the form of a multiple of m i ·m j , where i, j = 0, 1, 2 4, 4, i≠j ten modes (4) The binary code data S is output in the from of a multiple of m i ·mj·m k , where i, j, k = 0, 1, ..., 4, i≠j ≠k ten modes (5) The binary code data S is output in the form of a multiple of m i ·m j ·m k ·m l , wherein i, j, k, l = 0, 1, 2, ... 4, i≠j≠k≠l five modes (6) The binary code data S is output in the form of a multiple of m 0 ·m 1 ·m 2 ·m 3 ·m 4 one mode The 10-bit binary code data S, converted by the input converting section 1, is supplied to the encoding section 10. The encoding section 10 is constituted by five encoding circuits 11, 12, 13, 14 and 15 to which 10-bit binary code data S supplied from the input converting section 1 are entered as inputs. Each of the encoding circuits 11, 12, 13, 14 and 15 is constituted with the use of a ROM conversion table. The conversion table employed in each of the encoding circuits 11, 12, 13, 14 and 15 is formed by a ROM in which 4-bit each of the residue data R 0 , R 1 , R 2 , R 3 and R 4 of the binary code data with positive integers m 0 , m 1 , m 2 , m 3 and m 4 as the moduli are entered as conversion table data, wherein the integers m 0 to m 4 are prime numbers with respect to one another. The binary code data S, entered into the encoding section 10, is converted by the encoding circuits 11, 12, 13, 14 and 15 making use of the conversion table, into each 4-bit residue data R 0 , R 1 , R 2 , R 3 and R 4 , associated with the moduli m 0 , m 1 , m 2 , m 3 and m 4 , respectively. When the binary code data S are input to the encoder section 10, the RNS code data D RI [R 0 , R 1 , R 2 , R 3 , R 4 ] is input, which represents the input binary code data in the form of residue data R 0 , R 1 , R 2 , R 3 and R 4 obtained at the encoder circuits 11, 12, 13, 14 and 15. The RNS code data D RI , output from the encoding section 10, is supplied to the filter section 20. The filter section 20 is constituted by five digital filter circuits 21, 22, 23, 24 and 25. Each of the digital filter circuits 21 to 25 processes the RNS code data D RI supplied from the encoding section 10 by a modulo operation by which the desired same filter characteristics are afforded for each of the residue data R 0 , R 1 , R 2 , R 3 and R 4 representing the RNS code data D RI that is, for each of the moduli m 0 , m 1 , m 2 , m 3 and m 4 . It is noted that the digital filter circuit 21 performs an arithmetic operation on the residue data R 0 with the modulus m 0 , the digital filter circuit 22 performs an arithmetic operation on the residue data R 1 with the modulis m 1 , the digital filter circuit 23 performs an arithmetic operation on the residue data R 2 with the modulus m 2 , the digital filter circuit 24 performs an arithmetic operation on the residue data R 3 with the modulus m 3 and the digital filter circuit 25 performs an arithmetic operation on the residue data R 4 with the modulus m 4 . That is, the filter section 20 processes the RNS code data D RI , represented by the combination of R 0 , R 1 , R 2 , R 3 and R 4 , by separate modulo operation for each of the residue data R 0 , R 1 , R 2 , R 3 and R 4 , that is, for each of the moduli m 0 , m 1 , m 2 , m 3 and m 4 . In this manner, each of the residue data supplied with the desired filter characteristics is formed by the digital filter circuits 21, 22, 23, 24 and 25. The filter section 20 outputs RNS code data D RO representing the input binary code data by the combination of the residue data obtained by the digital filter circuits 21, 22, 23, 24 and 25. The RNS code data output from the filer section 20 is supplied to the decoding section 30. This decoder section 30 is constituted with the use of the conversion table formed by a ROM. The conversion table employed in the decoding section 30 is constituted by a ROM in which binary code data corresponding to the RNS code data are written as conversion table data. The decoding section 30 outputs the RNS code data D RO , supplied from the filter section 20, after conversion thereof into 10-bit binary code data D OUT with the aid of the conversion stable. The above described digital filter apparatus functions as the normal digital filter under the condition in which the control data D CTL of the mode (1) is supplied to the input converting section 1 to cause the input binary data D S to be supplied directly to the encoding section 10 as the converted binary code data S. This is the normal operating mode. With this normal mode, the encoding section 10 causes the binary code data S, that is the input binary code data D S , to be converted directly into RNS code data D RI . The filter section 20 performs a modulo operation for imparting desired filter characteristics to the RNS code data D RI so that the RNS code data D RO on which the modulo operation has been performed by the filter section 20 is converted by the decoding section 30 into the output binary code data S OUT . The state in which the control data D CTL of the modes (2), (3), (4), (5) and (6) causing the binary code data S supplied to the encoding section 10 to be converted into multiples by one or more of the moduli m 0 , m 1 , m 2 , m 3 and m 4 is supplied to the input converting section 1, represents a trouble diagnostic mode for estimating the site of trouble in case of accurrence of a trouble such as shorting of a signal bit with another signal bit or deterioration to 0 or 1. With this trouble diagnostic mode, the following trouble diagnostic operation may be performed. That is, with the present digital filter apparatus, when the binary code data S converted by the input converting section 1 into a multiple of the modulus m 0 , for example, is supplied to the encoding section 10, the output R 0 of the encoding circuit 11 of the encoding section 10 with the modulus m 0 is zero (R 0 =0) and the output of the filter circuit 21 with the modulus m 0 of the filter section 20 is also zero, while the binary code data D OUT , output from the decoding section 30, is a multiple of the modulus m 0 . Hence, if the ramp waveform data shown Fig. 3A is used as the binary code data D S supplied to the input converting section 1, the binary code data D OUT output from the decoding section 30 proves to be a step wave having a step difference corresponding to the modulus m 0 , as shown in Fig. 3B. In case of a trouble of shorting of a modulus m 0 system signal, for example, with another signal or of signal deterioration to zero, supposing that the input converting section 1 is operated under the operating mode (1) and the binary code data D S having the ramp waveform is supplied directly as the binary code data S to the encoding section 10 via input converting section 1, the binary code data D OUT output from the decoding section 30 exhibits a drastically disturbed waveform. Conversely, when the input converting section 1 is operated under the trouble diagnostic mode (2) so that the binary code data D S is multiplied by the modulus m 0 into the binary code data S, which is then supplied to the encoding section 10, the output of the system of the modulus m 0 is forced to be zero. Thus the binary code data D OUT output from the decoding section 30 presents a neat step waveform. Thus, by observing the output waveform of the binary code data D OUT output from the decoding section 30, it may be estimated that a trouble has occurred in the system of the modulus m 0 . In addition, the waveform of the signal bit of the system with the modulus m 0 may be observed to estimate the signal bit where the trouble has occurred. The above described procedure is repeated for each of the systems with the moduli m 0 , m 1 , m 2 , m 3 and m 4 and, when the waveform disturbed with the normal operating mode (1) should present a neat step wave with the trouble diagnostic mode (2), the trouble has occurred in the system of the modulus designatged at this time. When the signal shorting or deterioration to zero has occurred in two or more modulus systems, the output waveform represented by the binary code data D OUT output from the decoder 30 is disturbed during the normal operating mode (1), whereas, when the binary code data S converted at the input converting section 1 into a multiple of the product of the corresponding moduli at the trouble diagnostic modes (3), (4) and (5) is supplied to the encoding section 10, the binary code data D OUT output by the decoder section 30 presents a neat step waveform. Thus the system of the modulus where the trouble has occurred may be estimated by observing the waveform of the output waveform represented by the binary code data D OUT . In addition, the occurrence of a trouble in which the signal of a system of a modulus is deteriorated to 1 may be detected by operating the input converting section 1 at the trouble diagnostic mode (6) and supplying the binary code data S, which is set to zero (S=0), to the encoding section 10. That is, when the systems of the moduli m 0 , m 1 , m 2 , m 3 and m 4 are operating normaly, the binary code data D OUT , output from the decoder section 30, becomes zero (D OUT =0), whereas, if "1" is set in any modulus system, as a result of trouble occurrence, D OUT 0. Thus it suffices to find the signal bit where "1" is set by waveform observation, such as by means of an oscilloscope. It is also possible to divide the value of the binary code data D OUT , output by the decoder section 30, by the moduli m 0 , m 1 , m 2 , m 3 and m 4 , to find out a system of a modulus with a remainder to estimate that the trouble has occurred in this system. It is noted that the trouble in the digital filter apparatus of hte RNS system in general occurs most frequently in one modulus system and that the frequency of the trouble occurring across plural modulus systems becomes the lower the more the number of the modulus systems across which the trouble occurs. Therefore, the number of the trouble diagnostic modes may be limited appropriately. For example, by limiting the operating modes to the normal operating mode (1) and to the trouble diagnostic modes (2) and (6), the input converting section 1 may be operated under seven operating modes and control may be made by 3-bit control data D CTL . Although the input converting section 1 and the encoding section 10 are constituted by separate ROM conversion tables, the 10-bit binary code data D S supplied as the input signal may be divided into upper 5 bits and lower 10 bits and the input conversion may be performed for each of the moduli m 0 , m 1 , m 2 , m 3 and m 4 , while the function of input conversion may be combined with the RNS encoding function to thereby reduce the ROM capacity. Fig. 4 shows the constructin of a section taking charge of both the input conversion and the RNS encoding of a system of a modulus m i , hereinafter referred to as m i converting section. The m i converting section shown in Fig. 4 is constituted by an upper 5 bit converting circuit 101 to which upper five bits of the 10-bit binary code data D S , applied as the input signal, are supplied, a lower 5 bit converting circuit 102 to which lower five bits of the binary code-data D S are supplied, and an encoding output stage 103 to which the conversion outputs of the conversion circuits 101 and 102 are supplied. The upper bit conversion circuit 101 is constituted by using a ROM conversion table. The conversion table employed in the upper bit conversion circuit 101 is constituted by a ROM into which a 10-bit conversion table is recorded, and to which the upper 5-bit data D U of the 10-bit binary code data D S , applied as the input signal, and the 5-bit control data D CTL , are supplied as the inputs. The upper bit converting circuit 101 processes the upper 5-bit data D U , with the aid of the conversion table, for converting the upper 5-bit data D U into 4-bit upper residue data D ui in 2 5 =32 modes (1) to (6) designated by the control data D CTL . (1) The value S U of the upper 5-bit data D U is converted into upper residue data D ui shown by the formula (6) C ui = (S u × 2 5 ) mod m i one mode (2) The value S U is converted into upper residue data D ui of a value C ui shown by the formula (7) C ui = {(S u × 2 5 )/m i ·m j } mod m i (i = 0, 1, ..., 4) 5 modes (3) The value S U is converted into upper residue data D ui of a value C ui shown by the formula (8) C ui = {(Su × 2 5 )/(m j ·m k )·(m j ·m k )} mod m i (i, k = 0, 1, ..., 4, i≠k) 10 modes (4) The value S u is converted into the upper residue data D ui of the value C ui shown by the formula (9) C ui = {(S u × 10 5 )/(m j ·m k ·k l )·(m j ·m k ·m l )} mod m i (j,k,l = 0,1, ..., 4, j≠k≠l) 10 modes (5) The value S u is converted into the upper residue data D ui of the value C ui shown by the formula (10) C ui = {(S u × 10 5 )/(m j ·m k ·k l ·m n )·(m j ·m k ·m l ·m n )} mod m i (j,k,l,n = 0,1, ..., 4, j#k#l#n) 5 modes (6) The value C i is set to zero (the value of C ui is converted into a multiple of(m 0 ·m 1 ·m 2 ·m 3 ·m 4 ) The 4-bit upper residue data D ui , converted by the bit converting circuit 101, is supplied in this manner to the encoding output stage 103. The lower bit converting circuit 102 is constituted by using a ROM conversion table. The conversion table, employed in the lower bit conversion circuit 102, is constituted by a ROM in which 10-bit conversion table data are written and to which are entered the lower 5-bit data D L of the 10-bit binary code data D S applied as the input signal, and the 5-bit control data D CTL . The lower bit converting circuit 102 causes the upper 5-bit data D L to be converted by the conversion table into 4-bit lower residue data D Li in 2 5 =32 modes (1) to (6) designated by the control data D CTL . These modes may be summarized as follows: (1) The value S L of the lower 5-bit data D L is converted into upper lower data D Li shown by the formula (11) C Li = S L mod m i (2) The value S L is converted into lower residue data D Li of a value C Li shown by the formula (12) C Li = {(S U × 2 5 )/m i ·m j } mod mi (i = 0, 1, ..., 4) 5 modes (3) The value S L is converted into lower residue data D Li of a value C Li shown by the formula (13) C Li = {(S u × 2 5 )/(m j ·m k )·(m j ·m k )} mod m i (i,k = 0, 1, ..., 4, i≠k) 10 modes (4) The value S L is converted into the lower residue data D Li of the value C ui shown by the formula (14) C Li = {(S u × 10 5 )/(m j ·m k ·m l )·(m j ·m k ·m l )} mod m i (i,k, = 0, 1, ..., 4, i≠k≠l) 10 modes (5) The value S L is converted into the lower residue data D Li of the value C Li shown by the formula (15) C L = {(S u ×10 5 )/(m j ·m k ·k l ·m n )·(m j ·m k ·m l ·m n )} mod m i (j,k, ,n = 0,1, 4, j≠k≠l≠n) 5 modes (6) The value C ui is set to zero (the value of C ui is converted into a multiple of m 0 ·m 1 ·m 2 ·m 3 ·m 4 ) 1 mode The 4-bit lower residue data D Li , thus converted by the lower bit conversion circuit 102, are supplied to the encode output stage 103. The encode output stage 103 is constituted by a conversion table by a ROM. The conversion table, employed in the encode output stage 103, is constituted by a ROM in which are written conversion table data for converting the upper residue data D Ui and lower residue data D Li supplied from the conversion circuits 101, 102 into output residue data D i of a value R i shown by the formula (16) R 1 = (C Ui + C Li ) mod m i The residue data D i , output from the encode output stage 103, are supplied as the RNS code data of the modulus m i to a filter section, not shown. When the 10-bit binary code data D S , supplied as the input signal, is divided into upper 5 bits and lower 5 bits, an input converting operation is performed for each of the moduli m 0 , m 1 , m 2 , m 3 and m 4 , and the encoding function is combined with the input converting function, the data volume of the conversion table employed in each of the converting circuits 101, 102 in a m i converting section for a modulus m i is (2 10 ×4)×2 bits, whereas the data volume of the conversion table of the encoding output stage 103 is 2 8 ×4 bits. Hence, when the digital filter apparatus is constructed by systems of five moduli m 0 , m 1 , m 2 , m 3 and m 4 , the RNS encoding and input conversion for the operation of the normal operational mode (1) and the trouble diagnostic modes (2) to (6) similar to those of the embodiment of Fig. 2 may be performed by using a conversion table formed by a ROM having a storage capacity of {(2 10 ×4)×2+2 8 ×4}×5=46,080 bits. It is noted that, in the embodiment shown in Fig. 2, 2 15 ×10 bits and 2 10 ×4×5 bits are necessitated for the conversion tables employed in the input converting section 1 and the encoding section 1, respectively, so that it is necessary to provide a ROM having a total storage capacity of 340, 160 bits. Although a variety of different constructions may be conceived for the decoder 30 in the signal processing circuit shown in Fig. 2, a decoder shown for example in Japanese Patent Application 62-287101 (1987) may be employed in the signal processing circuit of Fig. 2. Meanwhile, in this type of the decoder, binary data may be output with rounding below a predetermined bit. The construction of this rounding operation is disclosed in the Japanese Patent Application 62-287101. A construction of the rounding is hereinafter explained by referring to the drawings. Referring to Fig. 5, a digital data processing circuit 101 of the present embodiment performs predetermined rouding on, for example, 16-bit input digital data DG IN to produce output digital data DG OUT constituted by 8 effective bits. Thus the 8-bit effective data DG IN1 , starting from the 16-bit input digital data DG IN to be rounded are entered into a rounding circuit 102. The fractional number data DG IN2 , constituted by 8 bits lower than the effective data DG IN1 of the input digital data DG IN , are entered into a fractional number data processing circuit 103. Besides the fractional number data DG IN2 , random noise data D RN of, for example, 3 bits, output from a random noise generating circuit 104, are also entered into the fractional data processing circuit 103. In practice, the rounding circuit 102 and the fractional number data processing circuit 103 are configured as the adder, with the fractional data processing circuit 103 adding the 3 bits from the most significant bit (MSB) of the fractional number data DG IN2 to the random noise data D RN to produce a 1-bit carry data D CR indicating a carry information. This carry data is transmitted to the rounding circuit 102. The rounding circuit 102 adds the carry data D CR transmitted from the circuit 103 at the least significant bit (LSB) of the effective data DG IN1 of the input digital data DG IN to transmit the thus produced 8-bit data as an output digital data DG OUT formed by the rounded effective data. It is noted that the random noise generating circuit 104 is constituted by a multi-element M (maximal length pulse) sequences generating circuit adapted for making use of a primitive polynominal on a Galois field (CF(p)), Meanwhile, with the Galois field CF(p), p is selected to be a prime number, and the generated series values are 0, 1, 2, ..., p-1. By selecting the number p to be a prime number, the self correlation function of the series is 1 for an integer multiple of the period f and -1/f otherwise so as to have the properties as the so-called pseudo noise series. In this case, the prime number p is selected in accordance with the formula (17) P = 2 n + 1 where n is an arbitrary integer, or the formula (18) P = 2 n - 1 and the resulting n-bit series value is added to the n bits from MSB of the fractional number data DG IN2 . In this manner, the mean value of the series values, added or not added to 1, is roughly coincident with the central value of the n-bit value from MSB of the fractional number data DG IN2 . Thus the probability of the occurrence of the carries in the fractional number data processing circuit 103 may be averaged. The random noise generating circuit 104 of the present embodiment is constituted by a 7-element 3-degree M sequences generating circuit, with n and p equal to 3 and 7, respectively, as shown in Fig. 6. In practice, the generating circuit 104 is constituted by a linear cyclic shift register including four latch circuits 10 to 13, three modulus multiplies 114 to 116 performing a modulo 7 operation and two adders 117, 118, and is constructed so as to have the following formula (19) x 4 + x 3 + x 2 + 3 as the primitive polynominal. The period f may be expresed in this case by the following formula (20) f = 7 4 - 1 = 2400 while the average value A v of the generated 3-bit series values 0 to 6 is given by the following formula (21) A v = 0×(7 3 -1)+1×7 3 +2×7 3 +...+6×7 3 7 4 - 1 = 3.00125 A value 1 is added to each of the series values 0 to 6 and the resulting values 1 to 7 are transmitted as the random noise data D RN3 , with the average value being 4,00125 (≒4.0). In this case, on adding the random noise data D RN3 to the 3 bits from the MSB of the fractional number data DG IN2 the carry occurs as shown in a diagram of Fig. 7. In the diagram of Fig. 7, "1" indicates occurrence of a carry and "0" the non-occurrence of a carry. It may be seen from the diagram that the case of occurrence of a carry and the case of non-occurrence of a carry become symmetrical relative to each other between the values "3" and "4" of the three bits from the MSB of the fractional number data DG IN2 so that the probability of the occurrence of a carry is 1/2 as a whole. On the other hand, the larger the value of the three bits from the MSB of the fractional number data DG IN2 , the higher is the probability of the occurrence of the carry, so that errors may be reduced from the statistical point of view. It is noted that the above described half-adjust technique corresponds to the left side half and the right side half of the diagram being "0" and "1", respectively, with the probability of carry occurrence being deviated as a function of the value of the three bits from the MSB of the fractional number data DG IN2 . It is noted that, when the value of the three bits from the MSB of the fractional number data DG IN2 is "7", carry occurs irrespective of the value of the random noise data D RN3 , whereas, when the above value is "0", carry cannot occur irrespective of the value of the random noise data D RN3 . Thus a digital data processing circuit 101 capable of averaging out the occurrences of the rounding errors irrespective of the fractional number data DG IN2 may be implemented by the above described construction in which 3-bit random noise data D RN3 generated by random noise generator 104 constituted by 7-element 3-degree M series generator is added to the three bits from the MSB of the fractional number data DG IN2 of the digital data DG IN and the carry data D CR formed by the result of the addition is added to the LSB of the effective data DG IN1 of the digital data DG IN to produce the output digital data DG OUT . Although the random noise generator 104 is constituted by a 7-element 3-degree M sequences generating circuit in the above embodiment, any other multi-element M sequences generating circuit may also be employed. Fig. 8 shows, for example, a 17-element 4-degree M series generating circuit, with n and p being 4 and 17, respectively. In practice, the circuit is a linear cyclic shift register constituted by three latch circuits 120 to 122, two modulus multiplication circuits 123, 124 each performing a modulo 17 operation, and an adder 125, and is configured to have the following formula (22) x 3 + x 2 + 7 as the primitive polynominal. In this case, the period f is represented by the following formula (23) f = 17 3 - 1 = 4912 and the average value of the generated 4-bit series values is represented by the following formula (24) A v = 0×(17 2 -1)+1×7 2 +...+16×17 2 17 3 - 1 = 8.00163 8.0 In this case, the series values are 0 to 16, which are added as the random noise data D RN4 to the four bits from the MSB of the fractional number data DG IN2 . Thus, with the series value of "16", the carry occurs irrespective of the value of the four bits from the MSB of the fractional number data DG IN2 , whereas, with the series value of "0", the carry does not occur irrespective of the value of the four bits from the MSB of the fractional number data DG IN2 . Hence, the value "1" may be added to the LSB of the effective data DG IN1 at the probability of 1/17, even when the input digital data DG IN is not entered. In practice, for effectively avoiding such addition, the series values "16" and "0" are converted into values "15" and "1", respectively. In this case, the average value is given by the following formula (25) A v = 0×(17 2 -1)+1×7 2 +...+15×17 2 17 3 - 1 = 8.00143 8.0 In the above described embodiment, the rounding operation is performed solely by the digital data processing circuit 101. Instead, when a plurality of rounding operations are performed in the same digital data processing system, the random noise generating circuits 104 may be constituted by multi-element M sequences generating circuits which are not correlated with one another, in wich case it becomes possible to prevent peculiar level increase or decrease of the digital data which might otherwise be caused when the circuit is constructed by the same multi-element M sequences generating circuits. With the above described rounding circuit, a digital data processing circuit capable of averaging out the occurrences of rounding errors irrespective of the value of the fractional number data may be provided by a simplified construction in which the random noise generated by the multi-element M sequences is added to the fractional number data of the digital data and the digital data rounding is performed on the basis of the results of the addition. The above described digital signal processing circuit according to the present invention has the function of converting input data into a multiple of one or more of the moduli m i of the RNS code by input converting means provided at an input stage of an encoder adapted for converting the input data into RNS code data, whereby the output of the series of the modulus m i is forced to be zero, so that, with the use of ramp waveform data as the input data, a stepped waveform output having a step difference corresponding to the modulus m i may be obtained. Hence, with the present digital signal processing circuit, on shorting of a signal bit with another signal bit or deterioration of a signal bit to 0 or 1, the waveform of the output for the above mentioned ramp waveform input data may be absorved and compared with respect to the operating state and non-operating state of the input converting means to estimate at which signal bit of which modulus series the trouble is occurring.

Claims: A digital signal processing apparatus for processing input digital data composed of binary codes comprising converting means (1) for converting said input digital data into a converted value which is a multiple of one or more selected RNS moduli and for selecting said input digital data or said converted data, RNS encoding means (10) supplied with said selected data from said converting means and adapted for generating residue data for each RNS modulus, and processing means (20, 30) for processing said residue data for generating processed data. A digital signal processing apparatus according to claim 1, wherein said processing means includes digital filter means (20). A digital signal processing apparatus according to claim 1 or 2, wherein said input converting means (1) is constituted by a ROM to which said input digital data in form of m-bit binary code data and n-bit control data are entered and in which (m+n) bit conversion table data are written. A digital signal processing apparatus according to claim 1 or 2, wherein said input digital data consist of (m 1 +m 2 ) bit binary code data and n-bit control data, and said input converting means includes an upper bit converting section (101) constituted by a ROM to which upper m 1 bit data of said (m 1 +m 2 ) bit binary code data and said n-bit control data are entered and in which (m 1 +n) bit conversion table data are written, and a lower bit converting section (102) to which lower m 2 bit data of said (m 1 +m 2 ) bit binary code data and said n-bit control data are entered as the input and in which (m 2 +n) bit conversion table data are written.

Inventors: FUJITA TADAO, INABA YOSHIAKI, TAKAYAMA JUN, FUJITA, TADAO, INABA, YOSHIAKI, TAKAYAMA, JUN
Applicants: SONY CORP, SONY CORPORATION
Application year: 1990
Main classification: G06F7
IPC codes: G06F11, H03H17, G06F7, H03M7