id3484781 pdfMachine by Broadgun Software - a great PDF writer! - a great PDF creator! - http://www.pdfmachine.com http://www.broadgun.com Audio Codec based on Discrete Fractional Cosine Transform Vijaya C a, J. S. Bhat Department of Physics, Karnatak University, Dharwad 580003, Karnataka,India. a SDM College of Engineering & Technology, Dharwad 580002, Karnataka,India. Mailing Address: Dr. J. S. Bhat Department of Physics Karnatak University Dharwad-580003 Karnataka, India. e-mail: [email protected], [email protected] Ph: 0836 2215316, a 0836 2447465 ABSTRACT: In this paper we present a method of coding audio signals using Discrete Fractional Cosine Transform (DFRCT) and Set Partitioning In Hierarchical Tree (SPIHT). FRCT, a generalization of ordinary Cosine Transform with an order parameter a , is a transform suitable for processing a nonstationary signal. The value of compact domain a is optimized with the criteria of minimum Percent Root mean square Difference (PRD). The compact domain DFRCT coefficients are encoded with SPIHT encoding technique. The average compression ratio achieved in the codec for Sound Quality Assessment Material (SQAM) signals is above the stipulated 3:1 with insignificant error, resulting in perceptually lossless audio signal compression. 1 Audio Codec based on Discrete Fractional Cosine Transform Vijaya C a, J. S. Bhat Department of Physics, Karnatak University, Dharwad 580003, Karnataka,India. a SDM College of Engineering & Technology, Dharwad 580002, Karnataka,India. continue to be important for Internet transmission of Abstract: We present a scheme of coding audio audio signals. Archiving and mixing of high fidelity audio signals using Discrete Fractional Cosine Transform recordings in professional environments also requires (DFRCT). The coefficients are encoded using Set lossless compression of audio signals. The new DVD Partitioning In Hierarchical Tree (SPIHT). The scheme standards for storage of audio signals at higher resolution results in high compression ratio with perceptually and sampling rates employ lossless audio coding [8]. lossless audio signal compression and avoids the Some of the lossless compression algorithms are necessity of coding the error signal, leading to reduced AudioPak, DVD, LTAC, MUSICompress, OggSquish, computational time and codec complexity. Test results are Philips, Shorten, Sonarc and WA [8]. Amongst these presented for Sound Quality Assessment Material techniques, Lossless Transform Audio Compression (SQAM) signals. (LTAC) is the only algorithm based on transform coding and it employs DCT. However, in this algorithm error Key words: Audio signal compression, DFRCT, signal is also transmitted along with the coded SPIHT. coefficients. Moreover, DCT can perform well only when the signal is stationary, and the energy is exclusively 1. Introduction concentrated in certain bands. The signal compression refers to the representation of For the processing nonstationary signal, which has the signal in a compact form so that it takes the least time time varying spectra, there is a need for a transform, for its transmission and the least space in storage device which is a joint function of time and frequency that with no loss of information of significant importance [2]. describes the energy density or signal intensity The signal compression methods are grouped into three simultaneously in the time and frequency plane [3,6,7]. categories – direct compression, parameter extraction The general principle of such transformation is to map a technique and transformation technique. In direct data signal of single independent variable, say, time, to a compression technique, high correlation among function of two independent variables- time and successive samples of the original signal is exploited [2]. frequency [6]. Short Time Fourier Transform (STFT) and The basic operation in parameter extraction involves Wavelet Transform (WT) are examples of linear TFRs extraction of significant parameters of the signal, such as [2,6] whereas Active Unterberger distribution (AUD) [6], amplitude and location of maxima and minima points, Wigner Distribution (WD) [1,6], Born-Jordan changes in slopes and zero crossing intervals. In Distribution (BJD), Page Distribution (PD) are examples transformation technique, the signal is transformed to of quadratic TFRs. Signal adaptive Radially Gaussian certain other domain where it is represented in terms of kernel Distribution (RGD) and Cohen’s nonnegative few highly de-correlated expansion coefficients. High de- Distribution (CND) [6] are nonlinear and non quadratic correlation among the coefficients reduces the redundancy TFRs. in the signal representation [2,5]. This fact enables independent quantization of each coefficient. [2,11]. Fractional Cosine Transform (FRCT) is a generalization of the ordinary cosine transform and it has Digital encoding of audio signal typically represents similar relationship with Fractional Fourier Transform each sample by 12-16 bits resulting in a rate of 96- (FRFT) as the ordinary cosine and sine transforms have 128kbps. There have been attempts to improve audio with the Fourier Transform (FT) [10]. Fractional domain coding techniques to increase the efficiency in is useful for solving some problems, which cannot be transmission and storage while maintaining the audio solved in the original domain [13]. Set Partitioning In signal quality. Audio coding is also essential for Hierarchical Tree (SPIHT) is a coding technique that achieving secure communication. Lossless audio coding better suits for the data to be coded having more zeros of CD quality stereo digital audio signals is very much than non-zeros [2]. In this paper we present coding essential for digital music distribution over the Internet. scheme, for audio signal compression, employing DFRCT Lossy compression techniques such as MPEG or MP3 as transform and SPIHT for binary coding the may not be acceptable for this application [8]. Because of coefficients. The scheme is tested on Sound Quality the limited Internet resources, lossless compression will Assessment Material (SQAM) [9]. We observe that the 2 compression ratio (CR) is significantly high with Hence to get the same kernel, when / 2 , sampling insignificant reconstruction error. should be such that S sin 2. Discrete FRCT tu , (7) N We discretize FRCT following the method described with S being sgn(sin()). Using equation (7) in (5), we get in [10]. With X (u) as the FRFT [1] of x(t) , FRCT is defined as 2 N 1 cot 2 2 2 (2 t) j (k n )t C (u) X (u) X ( u) , y(n) y(k)e 2 1 j cot 2 sin k 0 2 M 2 Smn Smk cos( N )cos( N ) . (8) j cot (u 2 t 2 ) / 2 e cos(ut csc)x(t)dt (1) m0 To reduce RHS of equation (8) to y(n) , F c (m, n) must The samples of is written as C (u) be normalized and the kernel becomes N 1 Y c (m) F c (m,n)y(n) , m (0, M ) , (2) n0 2(1 jcot ) sin c F (m,n) kmkn N where u m u , t n t . y(n) denotes the samples cot 2 2 2 2 j (m u n t ) 2 mn of input with n (0, N 1) . e cos( N ) , (9) c The kernel F (m, n) in equation (2) is defined as where k (1/ 2) for i 0 i = 1 otherwise. c 1 j cot F (m,n) 2 t 2 The kernel in equation (9) reduces to that of DCT-I j cot (m 2 u 2 n 2 t 2 ) / 2 e cos(mntucsc) (3) when / 2 . The other definitions [12] of DCT can Inverse DFRCT is defined as be considered in deriving the DFRCT. To compute M IDFRCT, DFRCT is evaluated with order -, sampling y(n) F c* (n, m)Y c (m) , (4) interval u at the input and t at the output. m0 with F c* (n, m) being complex conjugate of F c (m, n) . 3. SPIHT encoding SPIHT is a well-known algorithm for signal From equation (2) and (3), compression. In fact it can simply be applied to binary code the time domain signal. However, it better suits for 2 N 1 cot 2 2 2 j (k n )t the data to be coded having more zeros than non-zeros. (2t) 2 y(n) y(k)e We employ SPIHT to binary code the transform 2 sin k 0 coefficients. The algorithm pseudo sorts the transform M coefficients and codes them, along with sorting (cos(mntu csc) information, bit plane by bit plane. The bit rate for m0 transmission can thus be precisely defined so that only cos(mktu csc)) (5) some of the most significant bits of each coefficient are sent. Due to this feature, this coding technique allows the The kernel of conventional DCT-I is given by [12] partial but progressive type reconstruction of the required coefficients from a small section of the bit stream produced. No complex arithmetic is involved in this C (2/ N) k k cos(mn ) , m,n (0, N) (6) N 1 m m N encoding technique except for comparisons, bit level manipulations and a single search for the initial threshold. 3 4. New scheme for audio signal Compression Table 1: List of optimum a for SQAM signals. Lossless audio coding achieved typically by linear prediction of samples in time domain de-correlates the Test Test highly correlated time domain samples and reduces the Signal optimum a Signal optimum a signal energy that must be coded. Transform coding takes X1 1.2 X9 0.2 the advantage of the more harmonic nature of the audio X2 0.4 X10 0.8 signal. Application of DFRCT to a signal results in highly X3 1.2 X11 0.4 de-correlated coefficients in certain ath domain. The least X4 0.9 X12 1.1 valued coefficients are insignificant and hence are X5 1.9 X13 0.4 ignored. It is found that representation requires least X6 1.9 X14 0.3 number of nonzero significant coefficients.