ACLEP codec with modified autocorrelation matrix storage and search

• US 5,924,062 A
• Filed: 07/01/1997
• Issued: 07/13/1999
• Est. Priority Date: 07/01/1997
• Status: Expired due to Term

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Nokia Mobile Phones Incorporated (Nokia Corporation)
• Inventors: Maung, Tin
• Primary Examiner(s): Hudspeth, David R.
• Assistant Examiner(s): Chawan, Vijay B.
• Application Number:
  US08/886,609
• Time in Patent Office: 742 Days
• Field of Search: 704/219, 704/217, 704/220, 704/229, 704/222, 704/223, 704/232, 704/230
• US Class Current: 704/219
• CPC Class Codes: G10L 19/12 the excitation function being a code excitation, e.g. in code excited linear prediction [CELP] vocoders
• CPC Class Codes: G10L 2019/0008 Algebraic codebooks

Abstract

A codebook correlation matrix comprises a Toeplitz-type (diagonally symmetric) matrix which is calculated from a forty sample subframe of a speech signal, forming a 40×40 matrix. The resulting correlation coefficients which constitute the codes are stored within a DSP'"'"'s local memory after calculation by dividing the matrix into five predefined x- and y- tracks, each track having a unique set of eight pulse positions. Using the eight pulse positions on each track, fifteen 8×8 sub-matrices are created which include all of the correlation coefficients in the original 40×40 matrix. The sub-matrices are distributed within a 5×5 mapping matrix which is correlated with a structure mapping matrix to determine the configuration of the resulting autocorrelation matrix for storage and searching. The sub-matrices within each column of correlated mapping matrices are searched by directing a multiplex pointer to that particular column.

Claims

1. A memory connected to a correlator in an ACELP codec for storage of an N×

N correlation matrix comprising a plurality of correlation coefficients calculated by the correlator, wherein the N×

N correlation matrix is a Toeplitz-type matrix having symmetry along a main diagonal and wherein the N×

N correlation matrix has an x-axis and a y-axis, the memory comprising;

a plurality of tracks having a quantity T corresponding to an integral fraction of N, each track of the plurality of tracks defining a unique sub-set of N;

a plurality of sub-matrices, each sub-matrix having N/T×

N/T positions for receiving a subset of the plurality of correlation coefficients, each sub-matrix being defined by an autocorrelation of two tracks of the plurality of tracks, the two tracks comprising one of an autocorrelation of each track of the plurality of tracks to itself and an autocorrelation of each track of the plurality of tracks to at least a portion of the other tracks of the plurality of tracks;

a plurality of mapping matrices, at least one mapping matrix containing the plurality of sub-matrices in an arrangement of T rows and T columns; and

a pointer for connecting one location selected from the T rows and T columns to the correlator whereby the sub-set of the plurality of correlation coefficients is stored in the sub-matrix corresponding to the one selected location.

2. The memory of claim 1, wherein the N×

N correlation matrix is a 40×

40 matrix computed by autocorrelation of a 40 sample weighted impulse response vector obtained from a 40 sample sub-frame from a speech signal, the 40 sample weighted impulse vector having a sign vector incorporated.

3. The memory of claim 2, wherein the quantity T is five and wherein each of the plurality of sub-matrices is an 8×

8 matrix.

4. The memory of claim 3, wherein the plurality of sub-matrices comprises fifteen sub-matrices.

5. The memory of claim 4, wherein the pointer is a five-position multiplex switch.

6. The memory of claim 5, wherein the five-position multiplex switch selects the T columns incrementally beginning at a first column of the T columns.

7. The memory of claim 3, wherein the plurality of sub-matrices contain 960 correlation coefficients.

8. The memory of claim 1, wherein at least one of the T columns includes a plurality of partially-filled sub-matrices.

9. The memory of claim 8, wherein the plurality of mapping matrices includes a structure matrix for correlation with the at least one mapping matrix for defining which of the T columns includes partially-filled sub-matrices.

10. The memory of claim 1, wherein the pointer includes a mapping function which causes the plurality of sub-matrices within a selected column to be filled in a reiterative incremental sequence.

11. The memory of claim 10, wherein the pointer causes each of the plurality of sub-matrices within the selected column to be filled beginning at position 7,7! and proceeds to position 6,6! after position 7,7! of each of the sub-matrices within the selected column has been filled.

12. The memory of claim 1, wherein the pointer comprises a mapping function.

13. In an ACELP codec for implementation in a digital signal processor for storage of an N×

N correlation matrix within a digital signal processor memory, the N×

N correlation matrix comprising a plurality of correlation coefficients calculated by a correlator, wherein the N×

N correlation matrix is a Toeplitz-type matrix having symmetry along a main diagonal and wherein the N×

N correlation matrix has an x-axis and a y-axis, a memory comprising;

a plurality of sub-matrices, each sub-matrix being an N/T×

N/T matrix, where T is a number of tracks defined in the N×

N correlation matrix for each of the x-axis and the y-axis, wherein each sub-matrix contains a subset of the plurality of correlation coefficients; and

at least one mapping function for operation on the plurality of sub-matrices, the at least one mapping function designating a configuration of each sub-matrix, wherein the operation of the mapping function on the plurality of sub-matrices provides means for analyzing each correlation coefficient of the plurality of correlation coefficients while storing fewer than N×

N correlation coefficients in the digital signal processor memory.

14. The memory of claim 13, wherein the at least one mapping function provides means for selecting one of an upper portion and a lower portion of a sub-matrix for storage of the correlation coefficients in the digital signal processor memory.

15. The memory of claim 13, wherein the at least one mapping function provides means for transposing selected sub-matrices from the plurality of sub-matrices for searching of the correlation coefficients in the digital signal processor memory.

16. The memory of claim 13, wherein the plurality of sub-matrices are arranged within a mapping matrix having T×

T elements.

17. The memory of claim 16, further comprising a pointer for selectively addressing each of the T×

T elements of the mapping matrix.

18. A method performed in a digital signal processor having a memory and correlator, the method for storing and searching an autocorrelation matrix in an EFR-ACELP codec implemented in the digital signal processor, the correlator for computing a plurality of correlation coefficients for generating the autocorrelation matrix from a 40 sample weighted impulse response signal obtained from a 40 sample subframe, the method comprising:

dividing the 40 sample subframe into five tracks, each track comprising a set of eight pulse positions spaced five pulse positions apart from a preceding pulse position, each track having a unique set of eight pulse positions;

defining a set of fifteen sub-matrices based on an autocorrelation of each track of the five tracks to itself and on an autocorrelation of each track to at least a portion of the other tracks, each sub-matrix being an 8×

8 matrix;

defining a first mapping matrix having five columns and five rows, each column comprising five at least partially filled sub-matrices of the set of fifteen sub-matrices;

defining a second mapping matrix containing structure information for correlating with the first mapping matrix for determining a configuration of the at least partially filled sub-matrices; and

addressing a location corresponding to a column and row combination, each location corresponding to one of the at least partially filled sub-matrices, for connecting the correlator to a position within each at least partial sub-matrix.

19. A method of claim 18, wherein the five at least partially filled sub-matrices within the first column of the five columns are completely filled with correlation coefficients and each subsequent column contains fewer correlation coefficients than in the first column.

20. The method of claim 18, wherein the step of addressing includes filling each of the at least partially filled sub-matrices within the selected column beginning at a position 7,7! and proceeding to a position 6,6! after the position 7,7! of each of the at least partially filled sub-matrices within the selected column has been filled.

21. The method of claim 18, wherein the fifteen sub-matrices contain 960 correlation coefficients.

22. The method of claim 18, wherein the second mapping matrix contains a plurality of designators for selecting a pre-determined portion of each sub-matrix.

23. The method of claim 22, wherein the plurality of designators select one of an upper portion or a lower portion of each sub-matrix.

24. The method of claim 18, wherein the second mapping matrix contains a plurality of ones and zeroes for indicating transposition or not of a selected sub-matrix.