Transform processing apparatus and method and medium for storing compressed digital signals

Abstract: A forward transform processing method for performing a modified discrete cosine transform. A block of N time domain input samples is multiplied by a forward transform window to provide a block of N processed samples which is transformed into a block of N /2 spectral coefficients by preprocessing the block of N processed samples to provide a block of N /4 complex numbers, transforming the block of N /4 complex numbers by the equivalent of a Fast Fourier Transform into a block of N /4 transformed complex numbers that is then post-processed to provide an output block of N /2 spectral coefficients in the frequency domain. The corresponding apparatus embodies the method just described. An inverse transform method for performing an inverse modified discrete cosine transform. A block of N /2 spectral coefficients is pre-processed to provide a block of N /4 frequency domain complex numbers, which is transformed into a block of N /4 time domain complex numbers by processing equivalent to a Fast Fourier Transform. The block of N /4 time domain complex numbers is post processed to provide a block of N /2 processed samples in the time domain, which is re-arrayed and multiplied by an inverse transform window to provide an output block of N samples in the time domain. The apparatus embodies the method just described.

Description: This invention relates to transform processing apparatus and methods. Throughout the description and claims of this patent specification "j" is a symbol for the square root of minus one. EP-A-0 463 473 discloses a system to compute a Modified Discrete Cosine Transform (MDCT) comprising: a) input means to input a sequence of blocks of input data, b) first multiplying window means to multiply said sequence of blocks of input data by a window function to determine a sequence of windowed data; c) preprocessing means to reorder said sequence of windowed data; d) Fast Fourier Transform (FFT) computing means to compute a FTT of said sequence of windowed data; e) postprocessing means to compute from said FFT data the MDCT output data. EP-A-0 463 473 also discloses a system to compute an Inverse Modified Discrete Cosine Transform (IMDCT) comprising: a) input means to input a sequence of blocks of input data; b) inverse Fast Four Transform (IFFT) computing means to compute an FFT of said sequence of windowed data; c) postprocessing mean and multiplying inverse window means to compute the IFFT and to reorder the IFFT transformed data to obtain the IMDCT transformed data. Orthogonal transform coding is known as a way of high efficiency coding sampled data signals in the time domain, such as digital signals resulting from sampling analog audio signals. The input signal is divided in time into blocks of a predetermined number of samples. Transform coding orthogonally transforms each block of the input signal into a block of plural spectral coefficients in the frequency domain. Transform coding is typified by the discrete cosine transform (DCT). Discrete cosine transform coding suffers from distortion caused by discontinuous connecting points between adjacent blocks, and which manifests itself as noise. Block distortion has conventionally been reduced by overlapping one end of a block with the end of the adjoining block. A modified discrete cosine transform (MDCT) overlaps a given block with the adjoining blocks on both sides by one half of the block length. The MDCT is well suited for high efficiency coding because samples in the overlapped portions are not transmitted. Thus, N /2 spectral coefficients are generated from a frame of N time domain samples. Discussion of the MDCT and the inverse MDCT (IMDCT) may be found in Motizuki et al., Constraints in MDCT Filters in Which Plural Block Sizes Co-exist, SHINGAKU GIHOU, CAS90-10 and DSP90-14, pp. 55 to 60, or in Sugiyama et al., Adaptive Transform Coding with Adaptive Block Lengths Using MDCT (ATC-ABS), ABSTRACTS IN 1990 SPRING MEETING OF ELECTRONIC INFORMATION COMMUNICATION MEETING, A-197. The modified discrete cosine transform and inverse modified discrete cosine transform will now be briefly described by referring to Figure 1. In Figure 1, a given block of sample data in the time domain, such as the J -th block, has an overlap of one-half (50%) with each of the ( J -1)-th block and the ( J +1)-th j -th block. If the number of samples in the block is N , where N is a natural number, there is an overlap of N/2 samples with the ( J -1)-th block, and an overlap of N /2 samples with the ( J +1)-th block. Each of the N samples in each block, such as the J -th block, is processed by a forward transform window or pre-filter Wh to produce a block 102 of N windowed samples in the time domain. The characteristics of the forward transform window or pre-filter Wh are so selected that power density of the transformed data is maximized in conformity with the statistical properties of input signals. The block 102 of N windowed samples in the time domain in processed by a forward MDCT to produce a block 103 of independent spectral coefficients in the frequency domain. The number of spectral coefficients is one half the number of input samples in the block 102, or N /2. In the inverse transform, the block 103 of N /2 spectral coefficients is processed with a linear IMDCT to produce a block 104 of N processed samples in the time domain. The block 104 of N processed samples is processed by an inverse transform window or synthesizing filter Wf to produce a block 105 of samples in the time domain. The block 105 of samples in the time domain is summed to the preceding and succeeding blocks of samples in the time domain to produce an output signal of samples in the time domain. A method of high speed processing using a Fast Fourier Transform (FFT) to provide an MDCT and IMDCT has been proposed by Iwatare et al., A Study in MDCT System and High Speed Processing Method, SHINGAKU-GIHOU, CAS 90-9, DSP 90-13, pp. 49 to 54, and a similar method has also been proposed in Japanese Patent Early Publication 4-44099 (1992). The processing method proposed by Iwatare et al. will now be described. The MDCT is defined by the equation: where x 0 : MDCT input signal N : block length h : function of forward transform window y 0 : MDCT output signal C 0 : constant, and n is an integer between 0 and N - 1, and k is an integer between 0 and N/2 - 1. The block numbers are omitted because MDCT processing is carried out on the time domain data in each block independently. The method for performing an MDCT is substantially independent of the value of C 0 , so the following description assumes that C 0 = 1. In the calculation process, x 0 is multiplied by the forward transform window to find x 01 : x 01 ( n )= x 0 ( n ) h ( n ) for 0 ≤ n ≤ N -1 x 02 is derived from x 01 in accordance with the following equation: x 03 is calculated from in accordance with the following equation: x 03 ( n )= x 02 (2 n )- x 02 ( N -1-2 n ) for 0 ≤ n ≤ N 2 -1 x 03 is multiplied by the coefficient shown in equation (5) to produce a block of complex numbers z 01 . z 01 is processed by a Fast Fourier Transform (FFT) having a length of N/2 to produce a block of complex numbers z 02 . y 01 is a block of real numbers calculated from the block of complex numbers z 02 as follows: y 01 thus calculated thus coincides with y 0 as defined in equation (1), as demonstrated by the above-cited treatise A Study in MDCT System and High Speed Processing Method. Conversely, the IMDCT is defined by the following equation (8): where y 1 : IMDCT input signal N : block length f : inverse transform window function x 1 : IMDCT output signal C 1 : constant, and where n is an integer between 0 and N - 1, and k is an integer between 0 and N /2 - 1. The block numbers are omitted because IMDCT processing is carried out on the frequency domain data in each block independently. The present IMDCT calculating method is substantially independent of the value of C 1 , so the following description assumes that C 1 = 1. In the known calculation method, y 1 is re-arrayed in accordance with the following equation to produce y 11 . y 11 is multiplied by the coefficient shown in equation (10) to produce a block of complex numbers z 11 . z 11 is processed by an inverse FFT of a length of N /2 to produce a block of complex numbers z 12 . The block of complex numbers z 12 is multiplied by the coefficient shown in equation (12), and the real part is extracted to produce the block of real numbers x 11 . x 11 is re-arrayed with a sign change and multiplied by the inverse transform window in accordance with the equation: This coincides with x 1 as defined in equation (8), as demonstrated by the above-cited treatise A study in MDCT System and High Speed Processing Method.. The processing to perform an MDCT to determine the spectral coefficients for block of N samples and to perform a complementary IMDCT involves perfoming a complex number FT having a length of N/2. Suitable algorithms for this are described in E. Oran Brigha, THE FAST FOURIER TRANSFORM. In chapter 11, entitled Theory of FFT Algorithm with a Base of 2, the algorithm described on pages 196 to 199 in the Japanese translation of Miyagawa et al. has the following requirements N/4 log ( N/2 ) complex number multiplications, N/2 log ( N/2 ) complex number additions, and a work area for storing N/2 complex numbers. Thus, the method described above is not fully suitable for high-speed processing, especially when a small processing system is used. In accordance with a first aspect of the present invention, there is provided a forward transform processing apparatus for carrying out a modified discrete cosine transform on a digital input signal comprising plural samples in the time domain, the apparatus comprising: a) means to input a sequence of blocks of input data wherein each block includes N data samples x 0 (n) with O≤n≤N-1; b) means for multiplying said input data samples x 0 (n) by a forward window function h(n) to obtain a sequence of N windowed samples x 01 (n) wherein x 01 (n)= x 0 (n)h(n) c) first preprocessing means to preprocess said sequence of windowed data samples x 01 (n) to obtain a sequence of N data samples x 02 (n) with O≤n≤N-1 wherein x 02 (n)= -x 01 (n+3N/4) for O≤n≤N/4-1 x 02 (n)= x 01 (n-N/4) for N/4≤n≤N-1 d) second preprocessing means to further preprocess said sequence of N data samples X 02 (n) with O≤n≤N-1 to obtain a sequence of N/2 data samples x 03 (n) with O≤n≤N/2-1 wherein x 03 (n)= x 02 (2n)-x O2 (N-1-2n) for O≤n≤N/2-1 e) means to compute from said sequence of data samples x 03 (n) a sequence of N/4 complex data samples Z 01 (n) with O≤n≤N/4-1 wherein Z 01 (n) = [x O3 (2n)+j x 03 .(2n+l)][exp (-j2Πn/(N/2)] for O≤n≤N/4-1 f) means to compute the FFT of said sequence of complex data samples Z 01 (n) to obtain a sequence of N/2 FFT complex data samples Z 02 (k) with O≤k≤N/2-1 wherein Z 02 (k)= ΣZ 01 (n) exp[-j(2Πkn/(N/4))] for O≤k≤N/2-1 and g) postprocessing means to obtain from the sequence of FFT N/2 complex data samples Z 02 (k) a sequence of N/2 real data samples Y 01 (k) with O≤k≤N/2-1 which are the MDCT data samples. In accordance with a second aspect of the present invention there is provided an inverse transform apparatus for carrying out an inverse modified discrete cosine transform on spectral coefficients in the frequency domain to provide a digital output signal in the time domain, the apparatus comprising: a) means to input a sequence of blocks of input data wherein each block includes N/2 data samples y 1 (k) with O≤k≤N/2-1; b) first preprocessing means to preprocess said sequence of input data samples yl(k) to obtain a sequence of N data samples y 11 (k) with O≤k≤N/2-1_wherein y 11 (k)= y 1 (2k) for O≤k≤N/4-1 y 11 (k)= -y 1 (N-1-2k) for N/4≤k≤N/2-1 c) second preprocessing means to further preprocess said sequence of N/2 data samples y 11 (k) with O≤k≤N/2-1 to obtain a sequence of N/4 complex data samples Z 11 (k) with O≤k≤N/4-1 wherein Z 11 (k)= [y 11 (2k) + jy 11 (2k+l)]exp[-j2Πk/(N/2)] for O≤k≤N/4-1 d) means to compute the IFFT of said sequence of complex data samples Z ll (k) to obtain a sequence of N/2 IFFT complex data samples Z 12 (n) with O≤n≤N/2-1 wherein Z 12 (n)= ΣZ 11 (k) exp[-j2Πkn/(N/4)] for O≤k≤N/2-1 e) postprocessing means to obtain from the sequence of IFFT N/2 complex data samples Z 12 (n) a sequence of N/2 real data samples X 11 n) with O≤n≤N/2-1 wherein said postprocessing means comprise: i. means to obtain from said sequence of N/2 complex data Z 11 (n) a sequence of N/2 complex data Z 13 (n) with O≤n≤N/2-1 wherein Z 13 (n)= 1/2 [Z 12 (n) + Z 12 (N/4-1-n)] for O≤n≤N/2-1 ii. means to obtain from said sequence of N/2 complex data Z 12 (n) a sequence of N/2 complex data Z 14 (n) with O≤n≤N/2-1 wherein Z 14 (n)= {1/2j exp [-j2Π(2n+I)/N] [Z 12 (n)- Z 12 (N/4-1 -k)]} for O≤n ≤ N/2-1 iii. means to obtain from said sequences of N/2 complex data Z 13 (n) and Z 14 (n) a sequence of N/2 real data X 11 (n) with O≤n≤N/2-1 wherein X 11 (n)= Re{exp[-j2Π(2n+l)/(4N)][Z 13 (n) + Z 14 (n)]} for O≤n≤N/2-1 and f) means to reorder and means to carry out a multiplication by an inverse window function f(n) of said sequence of N/2 real sample data X 11 (n) to obtain a sequence of N real data samples X 12 (n) which are the IMDCT sequence of data samples and wherein X 12 (n)= f(n) X 11 (n+N/4) for O≤n≤N/4-1 X 12 (n)= -f(n) X 11 (3N/4-1-n) for N/4≤n≤3N/4-1 X 12 (n)= -f(n) X 11 (n-3N/4) for 3N/4≤n≤N-1. In accordance with a third aspect of the present invention there is provided a forward transform processing method for carrying out a modified discrete cosine transform on a digital input signal comprising plural samples in the time domain, the method comprising the steps of: a) inputting a sequence of blocks of input data wherein each block includes N data samples x 0 (n) with O≤n≤N-1; b) multiplying said input data samples x 0 (n) by a forward window function h(n) to obtain a sequence of N windowed samples x 01 (n) wherein x 01 (n)= x 0 (n)h(n) c) preprocessing said sequence of windowed data samples x 01 (n) to obtain a sequence of N data samples x 02 (n) with O≤n≤N-1 wherein x 02 (n)= -x 01 (n+3N/4) for O≤n≤N/4-1 x 02 (n)= x 01 (n-N/4) for N/4≤n≤N-1 d) further preprocessing said sequence of N data samples X 02 (n) with O≤n≤N-1 to obtain a sequence of N/2 data samples x 03 (n) with O≤n≤N/2-1 wherein x 03 (n)= x 02 (2n)-x 02 (N-1-2n) for O≤n≤N/2-1 e) computing from said sequence of data samples x 03 (n) a sequence of N/4 complex data samples Z 01 (n) with O≤n≤N/4-1 wherein Z 01 (n) = [x O3 (2n)+j x 03 .(2n+l)][exp (-j2Πn/(N/2)] for O≤n≤N/4-1 f) computing the FFT of said sequence of complex data samples Z 01 (n) to obtain a sequence of N/2 FFT complex data samples Z 02 (k) with O≤k≤N/2-1 wherein Z 02 (k)= ΣZ 01 (n) exp[-j(2Πkn/(N/4))] for O≤k≤N/2-1 and g) obtaining from the sequence of FFT N/2 complex data samples Z 02 (k) a sequence of N/2 real data samples Y 01 (k) with O≤k≤N/2-1 which are the MDCT data samples. In accordance with a fourth aspect of the present invention there is provided an inverse transform method for carrying out an inverse modified discrete cosine transform on spectral coefficients in the frequency domain to provide a digital output signal in the time domain, the method comprising the steps of: a) inputting a sequence of blocks of input data wherein each block includes N/2 data samples y 1 (k) with O≤k≤N/2-1; b) preprocessing said sequence of input data samples y 1 (k) to obtain a sequence of N data samples y 11 (k) with O≤k≤N/2-1_wherein y 11 (k)= y 1 (2k) for O≤k≤N/4-1 y 11 (k)= -y 1 (N-1-2k) for N/4≤k≤N/2-1 c) further preprocessing said sequence of N/2 data samples y 11 (k) with O≤k≤N/2-1 to obtain a sequence of N/4 complex data samples Z 11 (k) with O≤k≤N/4-1 wherein Z 11 (k)= [y 11 (2k) + jy 11 (2k+I)]exp[-j2Πk/(N/2)] for O≤k≤N/4-1 d) computing the IFFT of said sequence of complex data samples Z ll (k) to obtain a sequence of N/2 IFFT complex data samples Z 12 (n) with O≤n≤N/2-1 wherein Z 12 (n)= ΣZ 11 (k) exp[-j2Πkn/(N/4)] for O≤k≤N/2-1 e) obtaining from the sequence of IFFT N/2 complex data samples Z 12 (n) a sequence of N/2 real data samples X 11 n) with O≤n≤N/2-1 wherein said obtaining step comprises: i. obtaining from said sequence of N/2 complex data Z 11 (n) a sequence of N/2 complex data Z 13 (n) with O≤n≤N/2-1 wherein Z 13 (n)= 1/2 [Z 12 (n) + Z 12 (N/4-1-n)] for O≤n≤N/2-1 ii. obtaining from said sequence of N/2 complex data Z 12 (n) a sequence of N/2 complex data Z 14 (n) with O≤n≤N/2-1 wherein Z 14 (n)= {1/2j exp [-j2Π(2n+I)/N] [Z 12 (n)- Z l2 (N/4-1 -k)]} for O≤n ≤ N/2-1 iii. obtaining from said sequences of N/2 complex data Z 13 (n) and Z 14 (n) a sequence of N/2 real data X 11 (n) with O≤n≤N/2-1 wherein X 11 (n)= Re{exp[-j2Π(2n+I)/(4N)] [Z 13 (n) + Z 14 (n)]} for O≤n≤N/2-1 and f) reordering and carrying out a multiplication by an inverse window function f(n) of said sequence of N/2 real sample data X 11 (n) to obtain a sequence of N real data samples X 12 (n) which are the IMDCT sequence of data samples and wherein X 12 (n)= f(n) X 11 (n+N/4) for O≤n≤N/4-1 X 12 (n)= -f(n) X 11 (3N/4-1-n) for N/4≤n≤3N/4-1 X 12 (n)= -f(n) X 11 (n-3N/4) for 3N/4≤n≤N-1. In the method and apparatus according to the invention, a linear forward transform for providing an MDCT of N samples of a digital input signal is realized by applying FFT processing to complex signals each having a length of N/4. This significantly reduces the number of processing operations and the work area required. Additionally, in the apparatus and method according to the invention, a linear inverse transform for providing an IMDCT of N/2 independent spectral coefficients is performed by applying FFT processing to complex signals each having a length of N/4. This also significantly reduces the number of processing operations and work area required. The term "Fast Fourier Transform" or "FFT" as used in the above aspects of the invention and in the claims includes transforms equivalent thereto and in particular variants of FFT processing as described hereinafter. The invention will now be described hereinafter, by way of example only, with reference to the accompanying drawings, in which: Figure 1 is a diagrammatic view showing the processing steps for performing a modified discrete cosine transform (MDCT) and an inverse modified discrete cosine transform (IMDCT). Figure 2 is a flow chart schematically showing the processing steps of a method of performing an MDCT according to the present invention. Figure 3 is a functional block diagram of an apparatus according to the invention for implementing the method of performing an MDCT shown in Figure 2. Figure 4 is a flow chart schematically showing the processing steps of a method of performing an IMDCT according to the present invention. Figure 5 is a functional block diagram of an apparatus according to the invention for implementing the method of performing an IMDCT shown in Figure 4. Figure 6 is a block diagram showing an example of a circuit arrangement of a high efficiency encoding apparatus to which an apparatus and method for performing an MDCT according to the invention is applied. Figure 7 is a block diagram showing an example of a circuit arrangement of a high efficiency decoding apparatus to which an apparatus and method for performing an IMDCT according to the invention is applied. The calculation principles employed in the present invention will be described before practical embodiments of the apparatus and the method according to the present invention are described. To calculate an MDCT using an apparatus and a method according to the present invention, a block of N /4 complex numbers Z 01 , given by the following equation (14), is derived from x 03 of equation (4), and a block of N /2 complex numbers Z 02 is calculated in accordance with the equation: From the block of complex numbers Z 02 of equation (15), a block of complex numbers Z 03 and a block of complex numbers Z 04 , each block having a length N /2, are calculated in the following manner: / Calculating a block of N/2 real numbers Y 01 from Z 03 and Z 04 , we obtain: This coincides with y 0 defined by equation (1). This may be seen from the following: by substituting equation (14) in equation (15), we get: and Substituting equations (19) and (20) in equations (16) and (17), we obtain for Z 03 and Z 04 : Subtituting the values of Z 03 and Z 04 into equation (18), we obtain for Y 01: / / From equations (1) through (4) we obtain: Equations (23) and (24) clarify that Y 01 coincides with y 0 and show that an MDCT may be performed using a method according to the present invention. Since Z 02 has a period of N /4, the calculating process may be performed for values of k from 0 to ( N /4) - 1. An FFT having a length of N /4 may be used for this. Additionally, as shown in equation (21), since Z 03 has a period of N /4, the process for calculating equation (16) may simply be carried out for values of k from 0 to ( N /4) - 1. Similarly, as shown in equation (22), since Z 04 has a period in which only the sign is changed at an interval of N /4, the process for calculating equation (17) may simply be carried out for values of k from 0 to ( N /4) - 1. These simplifications enable the calculating process to be carried out more efficiently. Further, when performing an IMDCT, the block of N /4 complex numbers Z 11 given by the following equation: is determined from y 11 of equation (9), and the block of N /2 complex numbers Z 12 is calculated in accordance with equation (26): From the block Z 12 , a block of N /2 complex numbers Z 13 and a block of N /2 complex numbers Z 14 are calculated using equations (27) and (28) as follows: The block of N /2 real numbers X 11 is calculated from Z 12 , and Z 14 in accordance with: The block of real numbers X 11 thus calculated is processed by sign exchange, re-ordering or re-arraying and inverse transform window application to calculate the block of N real numbers X 12 to obtain: Equation (30) shows that Y 12 coincides with x 1 defined by equation (8) by the following analysis. Substituting equation (25) in equation (26), we obtain the following equations: Substituting equations (31) and (32) in equations (27) and (28), we obtain for Z 13 and Z 14 : Substituting equations (33) and (34) into equation (29), and using equation (9), we obtain: Applying the relation defined by equation (30) to equation (35), we obtain equations (36), (37), and (38), depending on the value of n : Comparing equations (36), (37), and (38) with equation (8) shows that an IMDCT may be performed using the method of the present invention. Since Z 12 has a period of N /4, as shown in equation (26), the above calculating process may simply be performed for values of n from 0 to N /4 - 1. An FFT having a length of N /4 may be used for this. Additionally, as shown in equation (33), since Z 13 has a period of N /4, the process for calculating equation (27) may simply be carried out for values of n from 0 to N /4 - 1. Similarly, as shown in equation (34), since Z 14 has a period in which only the sign is changed at an interval of N /4, the process for calculating equation (28) may simply be carried out for values of n from 0 to N /4 - 1. These simplifications enable the calculating process to be carried out more efficiently. It can be seen that, with an apparatus and the method according to the present invention, the MDCT defined by the equation (1) and the IMDCT defined by the equation (3) may be calculated using an FFT having a length of N /4. Such an FFT may be executed by N /8 log( N /4) complex number multiplications, N /4 log( N /4) complex number additions, and a work area for storing N /4 complex numbers. This means that the number of the processing operations and the work area may be significantly reduced relative to the conventional method. In performing the MDCT, the operations for calculating equations (16) to (18) may be combined into equation (39): to find Y 01 directly from Z 02 . Additionally, if equation (40): is calculated for an inverse FFT instead of calculating equation (15) using a forward FFT, Y 01 may be found from Z 02 ', because Z 02 ' can be obtained by re-ordering or re-arraying Z 02 . A method according to the present invention provides the processing for performing an MDCT with an input of N samples using processing equivalent to an FFT having a length of N/4, together with pre-processing and post-processing. Performing the MDCT using equations (39) and (40) is therefore encompassed by the present invention. The same may be said of the processing operations for performing the IMDCT. Thus, the method of executing the processing operations for calculating equations (27) through (30), or of using an IFFT in place of the FFT of equation (26) is encompassed by the present invention. Referring to the drawings, a preferred embodiment of the method according to present invention will next be described. Figure 2 is a flow chart schematically illustrating the sequence of signal transform operations in a method for performing an MDCT according to the present invention. In the first step S01 of Figure 2, sample data in the time domain, such as PCM audio data, is divided into blocks. Each block consists of a predetermined number of samples. In the example shown in Figure 2, each block consists of N samples. The blocks are arranged such that there is a 50% overlap between adjacent blocks, i.e., adjacent blocks are overlapped by N /2 samples, as shown in Figure 1. The block of N samples x 0 is multiplied by the forward transform window Wh, as shown in Figure 1, to provide a block of N windowed samples x 01 . In the next step, S02, the block of N windowed samples x 01 is converted by the transform defined by equation (4) into a block of N /2 real numbers x 03 . In the next step S03, the even-numbered elements and the odd-numbered elements of x 03 are allocated to real and imaginary parts, respectively, of a block of N /4 complex numbers. The resulting complex numbers are then multiplied by the complex coefficient shown in equation (14) to convert them into the block of N /4 complex numbers Z 01 . In the next step S04, Z 01 is processed by an FFT to produce the block N /4 complex numbers Z 02 in the frequency domain. In the next step S05, the block of complex numbers Z 02 is processed in accordance with equations (16) through (18) to provide the block of N /2 spectral coefficients Y 01 , which are the output of the MDCT. Figure 3 shows a typical hardware arrangement for carrying out the method of performing an MDCT according to the invention. A block of sample data in the time domain stored in a time domain sample buffer is converted into spectral coefficients in the frequency domain by the MDCT processing circuit. The circuit shown in figure 3 can be realized using discrete circuitry, or multiple microprocessors. Preferably, however, the majority of the processing operations are performed using an appropriately programmed digital signal processor circuit and auxiliary memories. In Figure 3, samples in the time domain, such as a PCM audio signal, are supplied to the input terminal 11, whence they pass into the time domain sample buffer 12. In the time domain sample buffer, the samples are divided into blocks of a predetermined number of samples, for example, into blocks of N samples. The blocks of N samples are then supplied to the MDCT processing circuit 20. The MDCT processing circuit 20 includes an equation (2) calculating circuit 21, an equation (3) calculating circuit 22, an equation (4) calculating circuit 23, an equation (14) calculating circuit 24, and an equation (15) calculating circuit 25 for calculating the equations (2), (3), (4), (14), and (15), respectively. The calculated results from the equation (15) calculating circuit 25 are supplied to both the equation (16) calculating circuit 26 and to the equation (17) calculating circuit 27. Outputs Z 03 from the equation (16) calculating circuit 26 and Z 04 from the equation (17) calculating circuit 27 are supplied to the equation (18) calculating circuit 28, which calculates Y 01 , and provides Y 01 to the output terminal 13. Figure 4 is a flow chart schematically showing the sequence of signal processing for carrying out a method of performing an IMDCT according to the present invention. In the first step S11 in Figure 4, a block of N /2 spectral coefficients y 1 are processed by sign changing and re-ordering or re-arraying, as shown in equation (9), and are converted into the block of N /2 real numbers y 11 . In the next step S12, the even-numbered elements and the odd-numbered elements of y 11 are allocated to real and imaginary parts, respectively, of a block of N /4 complex numbers. The block of N /4 complex numbers is then multiplied by the complex coefficient shown in equation (25) to provide the block of N /4 complex numbers Z 11 . In the next step S13, Z 11 is processed by an FFT to produce the block of N /4 complex numbers Z 12 in the frequency domain. In the next step S14, Z 12 is processed in accordance with equations (27) through (29) to produce the block of N /2 real numbers X 11 . In the next step S15, the block of N /2 real numbers X 11 is processed by sign change, rearraying, and inverse transform window multiplication in accordance with equation (30) to produce the block of N real numbers X 12 , from which samples of an output signal in the time domain can be derived. Figure 5 shows a typical hardware arrangement for carrying out a method of performing an IMDCT transform according to the invention, and for constructing a digital output signal in the time domain. The circuit shown in Figure 5 can be realized using discrete circuitry, or multiple microprocessors. Preferably, however, the majority of the processing operations are performed using an appropriately programmed digital signal processor circuit and auxiliary memories. The digital signal processor used for the circuit shown in Figure 3 can be reprogrammed to provide the processing operations of the circuit shown in Figure 5. In the circuit shown in Figure 5, the block of N /2 spectral coefficients y 1 , resulting from an MDCT, is supplied to the input terminal 16. Normally, the block of spectral coefficients y 1 will have been derived from a compressed digital signal reproduced from a storage medium, such as a magneto-optical disk, or from a transmission medium. From the input terminal, the block of spectral coefficients y 1 is supplied to the equation (9) calculating circuit 31 of the IMDCT calculating circuit 30. The output of the equation (9) calculating circuit 31 is supplied via the equation (25) calculating circuit 32 to the equation (26) calculating circuit 33. The output Z 12 from the equation (26) calculating circuit 33 is supplied to both the equation (27) calculating circuit 34 and the equation (27) calculating circuit 35. The outputs from the equation (27) calculating circuit 34 and the equation (28) calculating circuit 35 are supplied to the equation (29) calculating circuit 36 which provides an output X 11 to the equation (30) calculating circuit 37. The output, X 12 , from the equation (30) calculating circuit 37 is provided as the output of the IMDCT calculating circuit 30. The output of the IMDCT calculating circuit 30, the block of N real numbers X 12 is supplied to the overlap and add circuit 18 via the time domain sample buffer 17. Adjacent blocks of samples in the time domain data are overlapped by N /2 samples, and are added together to provide an output signal consisting of samples in the time domain. Figure 6 shows a practical example of a high efficiency coding apparatus in which the method and apparatus for performing an MDCT is applied. The high efficiency coding apparatus shown in Figure 6 uses the techniques of sub-band coding, adaptive transform coding, and adaptive bit allocation. A digital input signal, such as a digital PCM audio signal, is divided in frequency into a frequency range signal in each of plural frequency ranges. The bandwidths of the frequency ranges broaden in the direction of increasing frequency. An MDCT is performed on the frequency range signal in each of the frequency ranges independently. The resulting spectral coefficients in the frequency domain are grouped into critical bands, and the spectral coefficients in each critical band are coded by adaptive bit allocation. In Figure 6, an audio PCM input signal in the frequency range of, e.g., 0 Hz to 20 kHz are supplied to the input terminal 51. The band dividing filter 52, which is preferably a Quadrature Mirror Filter (QMF), divides the input signal in frequency into a 0 Hz to 10 kHz frequency range, and a 10 to 20 kHz frequency range. A second QMF 53 divides the 0 Hz to 10 kHz frequency range in frequency into a 0 Hz to 5 kHz frequency range and a 5 to 10 kHz frequency range. The 10 to 20 kHz frequency range signal is transmitted from the QMF 52 to the modified discrete cosine transform circuit (MDCT circuit) 54. The 5 to 10 kHz frequency range signal from the QMF 53 is transmitted to the MDCT circuit 55, and the 0 Hz to 5 kHz frequency range signal from the QMF 53 is transmitted to the MDCT circuit 56. The MDCT circuits 54, 55, and 56 embody examples of a method and apparatus according to the invention. The spectral coefficients in the frequency domain, resulting from orthogonally transforming the three frequency range signals using the MDCT circuits 54, 55, and 56, are grouped into critical bands and supplied to the adaptive bit allocation circuit 57. Grouping the spectral coefficients into critical bands enables the masking characteristics of the human auditory sense to be taken into account. Bits are allocated to the spectral coefficients in a way that takes advantage of a psychoacoustic property of the human auditory sense called "masking." Masking is a psychoacoustic phenomenon in which a sound is rendered inaudible, or "masked," by other sounds occuring simultaneously with, or slightly earlier than, or later than, the sound. Masking effects may be classed into time domain masking effects, that is, masking by sounds occurring earlier or later than the masked sound, and concurrent masking effects, which is masking is by simultaneously-occurring sounds having a frequency different from the frequency of the masked sound. Masking enables a sound to render inaudible any noise within its time or frequency masking range. This means that, in the presence of a signal that, when reproduced, produces a sound, a digital coding system may produce a quantizing noise level that is high compared with the noise level that is allowable in the absence of the signal, provided that the quantizing noise lies within the masking range of the sound produced by the signal. Since relatively high levels of quantizing noise are allowable if masked by the sound resulting from the signal, the number of bits required to quantize the signal representing the sound, or parts of the signal, may be significantly reduced. A critical band is a frequency band that takes advantage of the masking characteristics of the human auditory sense. A critical band is the band of noise that can be masked by a pure sound that has the same intensity as the noise and has a frequency in the vicinity of the frequency of the noise. The width of the critical band increases with increasing frequency of the pure sound. The entire audio frequency range of 0 Hz to 20 kHz can be devided into, for example, 25 critical bands. In the adaptive bit allocation coding circuit 57, the spectral coefficients are first normalized by applying block floating to the spectral coefficients in each critical band. A block floating coefficient, e.g., the maximum of the absolute values of the spectral coefficients in the critical band, is determined for each critical band. The spectral coefficients in each critical band are then normalized using the block floating coefficient. The normalized spectral coefficients in each critical band are then re-quantized using a number of bits that is large enough to provide a quantizing noise level that is low enough to be masked by the signals in the critical band and neighbouring critical bands. The output signal provided to the output terminal 58 comprises the adaptively quantized spectral coefficients, together with the block floating coefficient for each critical band, and word length data indicating the number of bits used for coding the spectral coefficients in each critical band. The output signal can then be transmitted or recorded on a suitable recording medium for later reproduction and decoding. Examples of suitable recording media are magneto-optical disks, optical disks, magnetic tapes, and semiconductor memories. Figure 7 shows a decoding apparatus complementary to the high efficiency coding apparatus shown in Figure 6. The decoding apparatus includes IMDCT circuits to which the IMDCT apparatus and method according to the invention is applied. Compressed digital data, which is normally reproduced from a storage medium, such as a magneto-optical disk, an optical disk, a magnetic tape, or a semiconductor memory, or a transmission medium, is fed into the terminal 61. The compressed digital data includes a block floating coefficient for each critical band, word length data including the number of bits used for coding each critical band, and adaptively quantized spectral coefficients. Blocks of spectral coefficients are constructed from this data by a spectral coefficient decoding circuit 62. The spectral coefficients in each block are grouped into the spectral coefficients for the 10 to 20 kHz frequency range, the spectral coefficients for the 5 to 10 kHz frequency range, and the spectral coefficients for the 0 Hz to 5 kHz frequency range for feeding into the IMDCT circuits 63, 64 and 65, respectively. The IMDCT circuits 63, 64, and 65, which employ an IMDCT processing method and apparatus according to the invention, transform the groups of spectral coefficients in the frequency domain into three frequency range signals in the time domain. Of the frequency range signals obtained as just described, the 0 Hz to 5 kHz frequency range signal and the 5 to 10 kHz frequency range signal waveform are first combined by the band combining circuit 66 into a 0 Hz to 10 kHz frequency range signal. The 0 Hz to 10 kHz frequency range signal is combined with the 10 to 20 kHz frequency range signal in the band combining circuit 67. The resulting full frequency range signal is provided supplied to the output terminal 68. It is to be noted that the present invention is not limited to the above described embodiments. For example, the present invention is not limited to use in the high efficiency coding and decoding apparatus shown in Figures 6 and 7, but may be applied to a variety of transform coding apparatus or decoding devices. It is seen from above that the present invention can provide a high efficiency coding apparatus for audio signals in which a block of N time domain samples data overlapped 50% with a preceding and a subsequent block may be efficiently orthogonally transformed using a forward modified DCT (MDCT) which uses a Fast Fourier Transform (FFT) with a length of N /4. This significantly reduces the number of processing operations and the work area required. The present invention can also provide a decoding apparatus and method in which N /2 independent spectral coefficients are processed by an inverse modified DCT (MDCT) which uses a FFT with a length of N /4. This also significantly reduces the number of processing operations and the work area required. Thus, an embodiment of the invention provides a signal processing apparatus and method wherein the processing operations for performing an MDCT and an IMDCT are carried out using an FFT with a shorter length. This reduces the number of processing operations, such as the number of multiplications and the number of additions, reduces the work area required, and achieves a higher operating speed.

Claims: A forward transform processing apparatus for carrying out a modified discrete cosine transform on a digital input signal comprising plural samples in the time domain, the apparatus comprising: a) means (12) to input a sequence of blocks of input data wherein each block includes N data samples x 0 (n) with O≤n≤N-1; b) means (21) for multiplying said input data samples x 0 (n) by a forward window function h(n) to obtain a sequence of N windowed samples x 01 (n) wherein x 01 (n)= x 0 (n)h(n) c) first preprocessing means (22) to preprocess said sequence of windowed data samples x 01 (n) to obtain a sequence of N data samples x 02 (n) with O≤n≤N-1 wherein x 02 (n)= -x 01 (n+3N/4) for O≤n≤N/4-1 x 02 (n)= x 01 (n-N/4) for N/4≤n≤N-1 d) second preprocessing means (23) to further preprocess said sequence of N data samples X 02 (n) with O≤n≤N-1 to obtain a sequence of N/2 data samples x 03 (n) with O≤n≤N/2-1 wherein x 03 (n)= x 02 (2n)-x O2 (N-1-2n) for O≤n≤N/2-1 e) means (24) to compute from said sequence of data samples x 03 (n) a sequence of N/4 complex data samples Z 01 (n) with O≤n≤N/4-1 wherein Z 01 (n) = [x O3 (2n)+j x O3 .(2n+I)][exp (-j2Πn/(N/2)] for O≤n≤N/4-1 f) means (25) to compute the FFT of said sequence of complex data samples Z 01 (n) to obtain a sequence of N/2 FFT complex data samples Z 02 (k) with O≤k≤N/2-1 wherein Z 02 (k)= ΣZ 01 (n) exp[-j(2Πkn/(N/4))] for O≤k≤N/2-1 and g) post processing means (26, 27, 28) to obtain from the sequence of FFT N/2 complex data samples Z 02 (k) a sequence of N/2 real data samples Y 01 (k) with O≤k≤N/2-1 which are the MDCT data samples. Apparatus according to claim 1, wherein said postprocessing means comprise: i. means (26) to obtain from said sequence of N/2 complex data Z 02 (k) a sequence of N/2 complex data Z 03 (k) with O≤k≤N/2-1 wherein Z 03 (k)= 1/2 [Z 02 (k) + Z 02 (N/4-1-k)] for O≤k≤N/2-1 ii. means (27) to obtain from said sequence of N/2 complex data Z 02 (k) a sequence of N/2 complex data Z 04 (k) with O≤k≤N/2-1 wherein Z 04 (k)= {1/2j exp [-j2Π(2k+I)/N] [Z 02 (k)- Z 02 (N/4-1-k)]} for O≤k≤N/2-1 iii. means (28) to obtain from said sequences of N/2 complex data Z 03 (k) and Z 04 (k) a sequence of N/2 real data Y 01 (k) with O≤k≤N/2-1 which are the MDCT transformed data and wherein Y 01 (k)= Re{exp[-j2Π(2k+I)/(4N)](Z O3 (k) + Z 04 (k))} for 0 ≤ k ≤ N/2-1. Apparatus according to claim 1. wherein the said post processing means comprises means to compute A forward transform processing method for carrying out a modified discrete cosine transform on a digital input signal comprising plural samples in the time domain, the method comprising the steps of: a) inputting (12) a sequence of blocks of input data wherein each block includes N data samples x 0 (n) with O≤n≤N-1; b) multiplying (21) said input data samples x 0 (n) by a forward window function h(n) to obtain a sequence of N windowed samples x 01 (n) wherein x 01 (n)= x 0 (n)h(n) c) preprocessing (22) said sequence of windowed data samples x 01 (n) to obtain a sequence of N data samples x 02 (n) with O≤n≤N-1 wherein x 02 (n)= -x 01 (n+3N/4) for O≤n≤N/4-1 x 02 (n)= x 01 (n-N/4) for N/4≤n≤N-1 d) further preprocessing (23) said sequence of N data samples X 02 (n) with O≤n≤N-1 to obtain a sequence of N/2 data samples x 03 (n) with O≤n≤N/2-1 wherein x 03 (n)= x 02 (2n)-x O2 (N-1-2n) for O≤n≤N/2-1 e) computing (24) from said sequence of data samples x 03 (n) a sequence of N/4 complex data samples Z 01 (n) with O≤n≤N/4-1 wherein Z 01 (n) = [x O3 (2n)+j x 03 .(2n+I)][exp (-j2Πn/(N/2)] for O≤n≤N/4-1 f) computing (25) the FFT of said sequence of complex data samples Z 01 (n) to obtain a sequence of N/2 FFT complex data samples Z 02 (k) with O≤k≤N/2-1 wherein Z 02 (k)= ΣZ 01 (n) exp[-j(2Πkn/(N/4))] for O≤k≤N/2-1 and g) obtaining (26, 27, 28) from the sequence of FFT N/2 complex data samples Z 02 (k) a sequence of N/2 real data samples Y 01 (k) with O≤k≤N/2-1 which are the MDCT data samples. A method according to claim 4, wherein said obtaining step comprise: i. obtaining (26) from said sequence of N/2 complex data Z 02 (k) a sequence of N/2 complex data Z 03 (k) with O≤k≤N/2-1 wherein Z 03 (k)= 1/2 [Z 02 (k) + Z 0 2 (N/4-1-k)] for O≤k≤N/2-1 ii. obtaining(27) from said sequence of N/2 complex data Z 02 (k) a sequence of N/2 complex data Z 04 (k) with O≤k≤N/2-1 wherein Z 04 (k)= {1/2j exp [-j2Π(2k+I)/N] [Z 02 (k)- Z 02 (N/4-1-k)]} for O≤k≤N/2-1 and iii. obtaining(28) from said sequences of N/2 complex data Z 03 (k) and Z 04 (k) a sequence of N/2 real data Y 01 (k) with O≤k≤N/2-1 which are the MDCT transformed data and wherein Y 01 (k)= Re{exp[-j2Π(2k+I)/(4N)] (Z O3 (k) + Z 04 (k))} for 0 ≤ k ≤ N/2-1. A method according to claim 4, wherein the said obtaining step comprises: computing An inverse transform apparatus for carrying out an inverse modified discrete cosine transform on spectral coefficients in the frequency domain to provide a digital output signal in the time domain, the apparatus comprising: a) means (16) to input a sequence of blocks of input data wherein each block includes N/2 data samples y 1 (k) with O≤k≤N/2-1; b) first preprocessing means (31) to preprocess said sequence of input data samples yl(k) to obtain a sequence of N data samples y 11 (k) with O≤k≤N/2-1 wherein y 11 (k)= y 1 (2k) for O≤k≤N/4-1 y 11 (k)= -y 1 (N-1-2k) for N/4≤k≤N/2-1 c) second preprocessing means (32) to further preprocess said sequence of N/2 data samples y 11 (k) with O≤k≤N/2-1 to obtain a sequence of N/4 complex data samples Z 11 (k) with O≤k≤N/4-1 wherein Z 11 (k)= [y 11 (2k) + jy 11 (2k+l)]exp[-j2Πk/(N/2)] for O≤k≤N/4-1 d) means ( 33) to compute the IFFT of said sequence of complex data samples Z ll (k) to obtain a sequence of N/2 IFFT complex data samples Z 12 (n) with O≤n≤N/2-1 wherein Z 12 (n)= ΣZ 11 (k) exp[-j2Πkn/(N/4)] for O≤k≤N/2-1 e) postprocessing means (34, 35, 36) to obtain from the sequence of IFFT N/2 complex data samples Z 12 (n) a sequence of N/2 real data samples X 11 n) with O≤n≤N/2-1 wherein said postprocessing means comprise: i. means (34) to obtain from said sequence of N/2 complex data Z 11 (n) a sequence of N/2 complex data Z 13 (n) with O≤n≤N/2-1 wherein Z 13 (n)= 1/2 [Z 12 (n) + Z 12 (N/4-1-n)] for O≤n≤N/2-1 ii. means (35) to obtain from said sequence of N/2 complex data Z 12 (n) a sequence of N/2 complex data Z 14 (n) with O≤n≤N/2-1 wherein Z 14 (n)= {1/2j exp [-j2Π(2n+l)/N] [Z 12 (n)- Z 12 (N/4-1-k)]} for O≤n≤ N/2-1 iii. means (36) to obtain from said sequences of N/2 complex data Z 13 (n) and Z 14 (n) a sequence of N/2 real data X 11 (n) with O≤n≤N/2-1 wherein X 11 (n)= Re{exp[-j2Π(2n+I)/(4N)] [Z 13 (n) + Z 14 (n)]} for O≤n≤N/2-1 and f) means (37) to reorder and means to carry out a multiplication by an inverse window function f(n) of said sequence of N/2 real sample data X 11 (n) to obtain a sequence of N real data samples X 12 (n) which are the IMDCT sequence of data samples and wherein X 12 (n)= f(n) X 11 (n+N/4) for O≤n≤N/4-1 X 12 (n)= -f(n) X 11 (3N/4-1-n) for N/4≤n≤3N/4-1 X 12 (n)= -f(n) X 11 (n-3N/4) for 3N/4≤n≤N-1. An inverse transform method for carrying out an inverse modified discrete cosine transform on spectral coefficients in the frequency domain to provide a digital output signal in the time domain, the method comprising the steps of : a) inputting (16) a sequence of blocks of input data wherein each block includes N/2 data samples y 1 (k) with O≤k≤N/2-1; b) preprocessing (31) said sequence of input data samples y 1 (k) to obtain a sequence of N data samples y 11 (k) with O≤k≤N/2-1_wherein y 11 (k)= y 1 (2k) for O≤k≤N/4-1 y 11 (k)= -y 1 (N-1-2k) for N/4≤k≤N/2-1 c) further preprocessing (32) said sequence of N/2 data samples y 11 (k) with O≤k≤N/2-1 to obtain a sequence of N/4 complex data samples Z 11 (k) with O≤k≤N/4-1 wherein Z 11 (k)= [y 11 (2k) + jy 11 (2k+l)]exp[-j2Πk/(N/2)] for O≤k≤N/4-1 d) computing ( 33) the IFFT of said sequence of complex data samples Z ll (k) to obtain a sequence of N/2 IFFT complex data samples Z 12 (n) with O≤n≤N/2-1 wherein Z 12 (n)= ΣZ 11 (k) exp[-j2Πkn/(N/4)] for O≤k≤N/2-1 e) obtaining (34, 35, 36) from the sequence of IFFT N/2 complex data samples Z 12 (n) a sequence of N/2 real data samples X 11 n) with O≤n≤N/2-1 wherein said obtaining step comprises: i. obtaining (34) from said sequence of N/2 complex data Z 11 (n) a sequence of N/2 complex data Z 13 (n) with O≤n≤N/2-1 wherein Z 13 (n)= 1/2 [Z 12 (n) + Z 12 (N/4-1- n)] for O≤n≤N/2-1 ii. obtaining (35) from said sequence of N/2 complex data Z 12 (n) a sequence of N/2 complex data Z 14 (n) with O≤n≤N/2-1 wherein Z 14 (n)= {1/2j exp [-j2Π(2n+l)/N] [Z 12 (n)- Z l2 (N/4-1-k)]} for O≤n ≤N/2-1 iii. obtaining (36) from said sequences of N/2 complex data Z 13 (n) and Z 14 (n) a sequence of N/2 real data X 11 (n) with O≤n≤N/2-1 wherein X 11 (n)= Re{exp[-j2Π(2n+I)/(4N)] [Z 13 (n) + Z 14 (n)]} for O≤n≤N/2-1 and f) reordering (37) and carrying out a multiplication by an inverse window function f(n) of said sequence of N/2 real sample data X 11 (n) to obtain a sequence of N real data samples X 12 (n) which are the IMDCT sequence of data samples and wherein X 12 (n)= f(n) X 11 (n+N/4) for O≤n≤N/4-1 X 12 (n)= -f(n) X 11 (3N/4-1-n) for N/4≤n≤3N/4-1 X 12 (n)= -f(n) X 11 (n-3N/4) for 3N/4≤n≤N-1.

Inventors: TSUTSUI KYOYA, TSUTSUI, KYOYA, Tsutsui, Kyoya, c/o Patents Division
Applicants: SONY CORP, SONY CORPORATION
Application year: 1992
Main classification: G06F17
IPC codes: G06F17