Abstract: A method of compiling a sequence of program instructions, a method of parallel execution of a sequence of program instructions and apparatuses and software supporting such methods are disclosed. The sequence of program instructions is analyzed in terms of basic blocks forming a control flow graph and execution paths through that control flow graph are identified. When more than one execution path leads to a given basic block, or when a loop path is found leading from a given basic block back to the same basic block, a potential convergence point may be identified. A convergence marker is added to the computer program associated with the basic blocks identified in this way and then when the program is executed, the convergence markers found are used to trigger a determination of a subset of the multiple execution threads which are executed following that convergence marker.

Abstract: A method of compiling a sequence of program instructions, a method of parallel execution of a sequence of program instructions and apparatuses and software supporting such methods are disclosed. The sequence of program instructions is analysed in terms of basic blocks forming a control flow graph and execution paths through that control flow graph are identified. When more than one execution path leads to a given basic block, or when a loop path is found leading from a given basic block back to the same basic block, a potential convergence point may be identified. A convergence marker is added to the computer program associated with the basic blocks identified in this way and then when the program is executed, the convergence markers found are used to trigger a determination of a subset of the multiple execution threads which are executed following that convergence marker.

Abstract: A system, method and computer-readable medium are disclosed for improving the performance of a compiler. A set of source code instructions are processed to generate a plurality of source code instruction subsets, each of which is respectively associated with a mathematical operator. The source code subsets are then reordered to “hoist,” or place, a source code instruction subset associated with a product operator before a source code instruction subset associated with a summation operator. The plurality of source code instruction subsets are iteratively reordered until no source code instruction subset associated with a summation operator precedes a source code instruction subset associated with a product operator. A compiler is then used to compile the resulting reordered plurality of source code instruction subsets into a set of optimized object code instructions.

Abstract: A system, method and computer-readable medium are disclosed for improving the performance of a compiler. A set of source code instructions are processed to generate a plurality of source code instruction subsets, each of which is respectively associated with a mathematical operator. The source code subsets are then reordered to “hoist,” or place, a source code instruction subset associated with a product operator before a source code instruction subset associated with a summation operator. The plurality of source code instruction subsets are iteratively reordered until no source code instruction subset associated with a summation operator precedes a source code instruction subset associated with a product operator. A compiler is then used to compile the resulting reordered plurality of source code instruction subsets into a set of optimized object code instructions.

Abstract: AC-3 is a high quality audio compression format widely used in feature films and, more recently, on Digital Versatile Disks (DVD). For consumer applications the algorithm is usually coded into the firmware of a DSP Processor, which due to cost considerations may be capable of only fixed point arithmetic. It is generally assumed that 16-bit processing is incapable of delivering the high fidelity audio, expected from the AC-3 technology. Double precision computation can be utilized on such processors to provide the high quality; but the computational burden of such implementation will be beyond the capacity of the processor to enable real-time operation. Through extensive simulation study of a high quality AC-3 encoder implementation, a multi-precision technique for each processing block is presented whereby the quality of the encoder on a 16-bit processor matches the single precision 24-bit implementation very closely without excessive additional computational complexity.

Abstract: A method of searching for a best-match decimation vector of decimation factors for non-uniform filter bank, the best match vector allowing perfect or near-perfect reconstruction of an input signal of the non-uniform filter bank, the method including the steps of: a) selecting a partial decimation vector having a number, l, of decimation factors, where l does not exceed a maximum number, K, of decimation factors of said best-match decimation vector; b) testing said l decimation factors to determine whether said partial decimation vector satisfies a feasibility criterion; c) testing a least common multiplier value of said l decimation factors to determine whether said least common multiplier value is greater than a predetermined value; d) testing a maximum decimation value, Dmax, of said partial decimation vector to determine whether Dmax is less than one; e) testing a minimum decimation value, Dmin, of said partial decimation vector to determine whether Dmin is greater than one; and f) if said feasibility crit

Abstract: A unified filter bank for use in encoding and decoding MPEG-1 audio data, wherein input audio data is encoded into coded audio data and the coded audio data is subsequently decoded into output audio data. The unified filter bank includes a plurality of filters, with each filter of the plurality of filters being a cosine modulation of a prototype filter. The unified filter bank is operational as an analysis filter bank during audio data encoding and as a synthesis filter bank during audio data decoding, wherein the unified filter bank is effective to substantially eliminate the effects of aliasing, phase distortion and amplitude distortion in the output audio data.

Abstract: A method of parametrically encoding a transient audio signal, including the steps of: determining a set V of the N largest frequency components of the transient audio signal, where N is a predetermined number; determining an approximate envelope of the transient audio signal; and determining a predetermined number P of samples W of the approximate envelope for use in generating a spline approximation of the approximate envelope, whereby a parametric representation of the transient audio signal is given by parameters including V, N, P and W, such that a decoder receiving the parametric representation can reproduce a received approximation of the transient audio signal.

Abstract: A method for effecting aliasing cancellation in an audio effects algorithm using a delay modulated signal, derived from interpolation of a delay modulator at an instantaneous sampling frequency, including: determining the instantaneous sampling frequency 1/Tisf and band limiting an input signal, to which the audio effects algorithm is to be applied to ½ Tisf prior to interpolation.

Abstract: A method and apparatus for assigning an exponent coding strategy in a digital audio transform coder. Different coding strategies having different differential coding limits may be assigned to different set of transform exponents according to the frequency domain characteristics of the audio signal. A neural network processing system is utilised to perform an efficient mapping of each exponent set to an appropriate coding strategy.

Abstract: A technique for computationally efficient evaluation of the Modified Discrete Cosine Transform (MDCT) using the Fast Fourier Transform (FFT) method is presented in which the input of the FFT block consists of a sequence of N complex numbers, and this complex data is evaluated using an N/2-Point FFT only, thereby descreasing computation burden almost by two.

Abstract: A method for conversion of input audio frequency data, at an input sample frequency, to output audio frequency data, at an output sample frequency. The input data is subjected to expansion to produce expanded data at an output sample frequency. The expanded data is interpolated to produce output data. In one embodiment of the invention the interpolation is effected by a process that also filters the output data. In another embodiment, the input data is sampled by an integer factor to produce expanded data, the expanded data is then interpolated to produce the output data. Also disclosed is a method of transition of a signal output, at one frequency, to a signal output at another frequency. The signal output at said one frequency is faded out over a period, and the signal output at said other frequency is faded in over that period. Both signal outputs are combined to produce the signal output over said period. Apparatus for effecting the methods is also disclosed.

Abstract: AC-3 is a high quality audio compression format widely used in feature films and, more recently, on Digital Versatile Disks (DVD). For consumer applications the algorithm is usually coded into the firmware of a DSP Processor, which due to cost considerations may be capable of only fixed point arithmetic. Commercial AC-3 Encoders have been successfully implemented on 20-bit and 24-bit word-length processors. However, it is generally assumed that 16-bit processing is incapable of delivering the high fidelity audio, expected from the AC-3 technology. Double precision computation can be utilised on such processors to provide the high quality; but the computational burden of such implementation will be beyond the capacity of the processor to enable real-time operation.

Abstract: Channel coupling for an AC-3 encoder, using mixed precision computations and 16-bit coupling coefficient calculations for channels with 32-bit frequency coefficients.

Abstract: A method for encoding an audio signal, including providing a masking function, representative of psychoacoustic masking; setting a quality value for data of the encoded signal, adjusting the masking function dependent upon the quality value; and allocating bits for quantization of the encoded signal based on the incremental masking function.

Abstract: In a transform encoder for audio data, encoded data in the form of mantissas, exponents and coupling data is packed into fixed length frames in an output bitstream. The fields within the frame for carrying the different forms of data are variable in length, and apace within the frame must be allocated between them to fit all of the required information into the frame. The space required by the various data types depends on certain encoding parameters, which are calculated for a particular frame before the data is encoded, thus ensuring that the encoded data will fit into the frame before the computationally expensive encoding process is carried out. Information in relation to, for example, transform length, coupling parameters and exponent strategy are determined, which allows the space required for the coupling and exponent data to be calculated. The mantissa encoding parameters can then be iteratively determined so that the encoded mantissas will fit into the frame with the other encoded data.

Abstract: A method and apparatus for coding audio data in a frequency transform digital audio coder employing differential frequency coefficient exponent coding. Differential coding of exponents places constraints on possible values an exponent can take, which can lead to distortion in the decoded and reconstructed audio signal. The method and apparatus herein can overcome this restriction by mapping the input exponent set to a new set of values which satisfy the differential constraint as well as reducing information loss, thereby minimizing overall signal distortion due to coding restrictions.

Abstract: A unified filter bank for use in encoding and decoding MPEG-1 audio data, wherein input audio data is encoded into coded audio data and the coded audio data is subsequently decoded into output audio data. The unified filter bank includes a plurality of filters, with each filter of the plurality of filters being a cosine modulation of a prototype filter. The unified filter bank is operational as an analysis filter bank during audio data encoding and as a synthesis filter bank during audio data decoding, wherein the unified filter bank is effective to substantially eliminate the effects of aliasing, phase distortion and amplitude distortion in the output audio data.

Abstract: A method for encoding frequency coefficients in an AC-3 Encoder. The method includes: representing frequency coefficients in theform of a respective exponent and mantissa; coding the exponents; and shifting the mantissas to compensate for changes in the exponent values, wherein the exponents comprise an original exponent set (e0, e1, . . . en−1) which is mapped to a new exponent set (e0′, e1′, . . . , e′n−1) after coding, so as to satisfy: ∥e′i+1−e′i∥<D, where i=0, . . . , n−1 and D is a maximum allowed difference between two consecutive exponents, and e′i≦ei.

Abstract: A method of parametrically encoding a transient audio signal, including the steps of: determining a set V of the N largest frequency components of the transient audio signal, where N is a predetermined number; determining an approximate envelope of the transient audio signal; and determining a predetermined number P of samples W of the approximate envelope for use in generating a spline approximation of the approximate envelope, whereby a parametric representation of the transient audio signal is given by parameters including V, N, P and W, such that a decoder receiving the parametric representation can reproduce a received approximation of the transient audio signal.