EP1286331A1 - Verfahren für die algebraische Codebook-Suche eines Sprachsignalkodierers - Google Patents
Verfahren für die algebraische Codebook-Suche eines Sprachsignalkodierers Download PDFInfo
- Publication number
- EP1286331A1 EP1286331A1 EP02102146A EP02102146A EP1286331A1 EP 1286331 A1 EP1286331 A1 EP 1286331A1 EP 02102146 A EP02102146 A EP 02102146A EP 02102146 A EP02102146 A EP 02102146A EP 1286331 A1 EP1286331 A1 EP 1286331A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- coefficients
- tracks
- combinations
- group
- speech signal
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims description 47
- 239000011159 matrix material Substances 0.000 claims abstract description 35
- 238000004891 communication Methods 0.000 claims description 2
- 238000004364 calculation method Methods 0.000 description 15
- 238000000354 decomposition reaction Methods 0.000 description 6
- 230000003044 adaptive effect Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 238000005070 sampling Methods 0.000 description 2
- 238000010845 search algorithm Methods 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000006835 compression Effects 0.000 description 1
- 238000007906 compression Methods 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 230000003252 repetitive effect Effects 0.000 description 1
- 238000003786 synthesis reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
- G10L19/04—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis using predictive techniques
- G10L19/08—Determination or coding of the excitation function; Determination or coding of the long-term prediction parameters
- G10L19/12—Determination or coding of the excitation function; Determination or coding of the long-term prediction parameters the excitation function being a code excitation, e.g. in code excited linear prediction [CELP] vocoders
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
- G10L2019/0001—Codebooks
- G10L2019/0007—Codebook element generation
- G10L2019/0008—Algebraic codebooks
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
- G10L2019/0001—Codebooks
- G10L2019/0013—Codebook search algorithms
Definitions
- the invention relates to a method for the algebraic codebook search of a speech signal coder, preferably according to the Code Excited Linear Prediction method, in which for calculating coefficients of the triangular matrix of the autocorrelation matrix of Toeplitz type a period of time comprising n voice signal samples into an integer one Number of tracks t is decomposed with each p possible pulse positions.
- the invention relates also to a communication device, in particular a mobile telephone, with a Speech signal encoder.
- Such methods are used in digital voice transmission methods. Becomes converted an analogue speech signal with a certain sampling rate into a digital signal, This creates a very large amount of data that is limited in throughput Radio channel can not be completely transferred. For this reason, after the Digitization of the speech signal compression of the signals are made. On Signal is compressed by omitting non-relevant elements, repetitive ones Elements with a short name provides only these short terms as Encodings transfers. In the field of coding for mobile applications The CELP procedure (Code Excited Linear Prediction) has become particularly important. at This efficient coding method is used as a coefficient in an autocorrelation matrix detected sound elements detected and transmitted. The autocorrelation matrix can do this be compared with a notebook or codebook, of which only the notebook address The recipient will inevitably need the same notebook to the received digital signal in a similar to the original signal, analog To convert speech signal.
- a number of encoders / decoders are internationally standardized by the ITU, too these include the CS-ACELP and ACELP methods, with bitrates of up to 8 kbps work.
- the CELP method first an LPC analysis (linear prediction coefficient) performed. The remaining signal is then searched through in an adaptive codebook. In this way, periodic shares of the Speech signal in a LTP analysis (long term prediction) filtered out. The remaining one Signal is quantified in a second codebook, for this method there is already one Set of solutions.
- AMR adaptive multirate speech codec
- the principle of algebraic codebook search is based to search for a codevector that represents a certain period of time and where a limited number of pulses have an amplitude of +1 or -1.
- This Codevector is filtered by a synthesis filter, that is on the side of the transmitter the decoding process is carried out after the transmission of the signal on the Receiver side is made.
- a very large number of possible codevectors is systematically checked by nested search loops around that codevector determine that has the least error energy, i. the original signal as possible is similar.
- This iterative determination of the codevector claims most of the Computational capacity of a mobile phone, allowing an optimization of this search algorithm is particularly efficient.
- the aim is also to increase the required number of arithmetic operations of the search algorithm to decrease.
- the autocorrelation matrix is a Toeplitz matrix, that is it is symmetric with respect to its main diagonal and its upper or identical lower triangular matrix all coefficients. It has therefore already been proposed instead of the full one Autocorrelation matrix only one of the triangular matrices to save space save. However, this method leads to a more complicated addressing of the individual Coefficients, so saving storage space increases the computational burden faces.
- the invention is therefore based on the problem to provide a method in which the Storage space requirement and the calculation effort are reduced.
- the required coefficients of the autocorrelation matrix stored in a way that allows fast, sequential access.
- the otherwise additionally required, relatively complex calculation of the memory addresses
- the coefficients of the triangular matrix can be significantly simplified. Some coefficients are needed very often, others are very rare. This circumstance is at the Optimized grouping of the exploited, so that the frequently needed coefficients of the Autocorrelation matrix can be addressed more easily, resulting in a very fast Access results.
- the invention provides that for the groups of combinations of adjacent and not adjacent tracks each t records are stored with each p x p coefficients.
- a In practice very important mode of operation of the CELP or ACELP method provides that the Positions of two adjacent pulses are set simultaneously, so that at p possible Pulse positions per code vector p x p pass through the search loop.
- a horizontal or vertical vector of the autocorrelation matrix representing subgroup of a data set with p coefficients being read out by a program loop one being the memory location value indicative of the first coefficient and a constant increment up to be specified next storage location. Therefore, it is sufficient, a start or start value for the first memory address and the step size, i. the number of storage locations up to specify the next storage location. It can be provided that the starting values a look-up table stored in a non-volatile memory, alternatively they are each calculated.
- t triangular arrays are stored sequentially. Every combination the same tracks corresponds to a triangle matrix and all t triangular matrices are in stored in a block. Since these coefficients are relatively rarely needed It's no disadvantage if the access is a bit more expensive. To further increase the computational effort can also be accessed via a look-up table.
- the coefficients of the main diagonal are grouped together and stored sequentially.
- the autocorrelation matrix is preferably a 40x40 matrix, corresponding to FIG. 40 Speech signal samples in a time window.
- a period of time is decomposed into an integer number of tracks of the same length-preferred is the decomposition of a time period in 5 tracks with 8 pulse positions each or the decomposition into 4 tracks with 10 pulse positions each.
- a particularly fast access to the coefficients is made possible when the coefficient groups the combinations of adjacent and non-adjacent tracks from one Be formed of a plurality of 64 coefficients blocks. On these coefficient groups must be used very often during the iteration. This Groups are therefore stored in the order in which they are needed for the calculation so that they can be accessed quickly, resulting in a reduction of the Computing costs leads.
- a further increase in the calculation speed can be achieved if the Memory has a plurality of RAM memory banks and coefficient groups in different RAM memory banks are stored. Are coefficient groups in different RAM memory banks are stored, it can be accessed in parallel, i. two coefficients can be read simultaneously. The memory access time can be thereby approximately halve.
- the inventive method can with particular advantage in the operating system of a Mobile phones are integrated.
- the code vector to be determined with the true signal i. whose error energy is minimal.
- the pulses are set one after the other, so that the number of variables decreased in the course of the search.
- the table of Fig. 1 shows the decomposition of a 40 speech signal samples Time segment in four tracks with ten pulse positions each. Another decomposition, which in the Practice is significant, sees a decomposition in five tracks, each with eight possible pulse positions in front. For each pulse, it is determined in which track it can be set. Of the first pulse can therefore only be set to 10 (or 8) positions, instead of all 40 Positions. Iteratively, the one pulse position that has the lowest energy error is selected having. Subsequently, the next pulse position considering the already determined first pulse position iteratively determined. This procedure is for all pulses carried out.
- FIG. 2 shows a table of the track / pulse combinations to be tested for the operating mode the eight pulses are set.
- the first pulse Ip0 is placed in the track where the Maximum of the filtered-back target signal is located. This determination is made before actual search loop, it applies to the entire search loop. In the illustrated embodiment was the maximum of the filtered target signal in track 2. Therefore, this value for the pulse Ip0 is held for all iterations.
- the second pulse Ip1 is determined by determining all 8 possible pulse positions of a track. As can be seen in FIG. 2, the 8 positions of track 3 are shown in iteration 1 tested. The pulse position of track 3 with the lowest energy error is selected. After determining Ip0 and Ip1, the 64 possible combination of the Pulse Ip2 and Ip3 tested.
- Ip2 must be for the first Iteration can be found in Track 4 and Ip3 in Track 0.
- the pulse pairs Ip4-Ip5, Ip6-Ip7 and Ip8-Ip9 according to the same procedure.
- FIG. 3 shows a table of adjacent and non-adjacent tracks that are common being checked. From Fig. 2 it can be seen that certain combinations of tracks are common occur, eg. Tr0-Tr1, Tr1-Tr3, while others do not occur at all. From all conceivable codevectors only a small selection is checked.
- the left column of FIG. 3 contains the Neighboring Tracks required for the search process, which breaks down the search process into the actual search loop, in which a block of 64 values of the autocorrelation matrix for four iterations, each with four pulse pairs of 64 each Values total 1024 matrix accesses occur.
- Fig. 5 shows the coefficients of the main diagonals. Since a total of 40 signal samples in a period of time, the main diagonal contains 40 elements that are in stored sequentially in a block.
- 320 coefficients of the combinations of adjacent tracks are 320 coefficients the combinations of non-adjacent tracks, 140 coefficients of the combinations same tracks and 40 coefficients of the main diagonal, together 820 coefficients.
- Fig. 6 all the coefficients to be calculated are shown in groups.
- Each of the ellipsoidal symbols denotes a subgroup of a certain number of Coefficients.
- each subgroup has eight coefficients, Block 4 each five coefficients.
- the number of coefficients in block 3 is because of Diagonal matrix different.
- each of the blocks 1 to 4 can be calculated separately.
- the generation of blocks 1 and 2 is practically identical, they takes place in two steps. In Fig. 7, these steps are shown for block 1.
- the first Step begins at the value (38/39) of the autocorrelation matrix.
- the matrix will be there traverse diagonally until the diagonal drawn in FIG. 7 reaches the value (0/1).
- This final value is marked 'A' and is set to the value marked 'A' (33/39) on the right.
- FIG. 1 The storage order of block 1 after the first step is shown in FIG Arrows indicate in which order the coefficients from the autocorrelation matrix stored in the 8 x 8 value blocks.
- the second step starts at the value (35/39) as shown in FIG. This diagonal runs to the value (0/4), the second part starts at the value (30/39) etc.
- FIG. 9 shows the memory order of block 1 after the second sub-step. All values already stored in the first step are shown in FIG. 9 as black Marked points. These two steps fill the entire block.
- the first line contains the correlation values of Track0-Track1
- the second line contains the correlation values of Track1-Track2 etc., according to FIG. 7.
- Fig. 10 shows the calculation of the block 2 with the values of non-adjacent tracks, the can be generated in the same way. Analogous to block 1 are in Fig. 10, the required Diagonals drawn. The first part starts at the value (37/39). This diagonal runs to the value (0/2), the first part continues at the value (32/39).
- Fig. 11 illustrates the storage order of block 2 after this first step second part starts at the value (36/39). The diagonal runs up to the value (0/3), the second part continues at value (31/39).
- Fig. 12 the storage order of block 2 after the second step is shown. All values already saved in the first step are marked with dots.
- Fig. 13 shows the calculation of the block of the combinations of the same tracks. Analogously to The previous examples show the required diagonals. Block 3 can be in be calculated in a single pass. The storage order of block 3 is in Fig. 14 shown.
- the coefficients for block 4 are the values of the main diagonal of the Autocorrelation matrix.
- blocks 1 and 2 will be in separate RAM memory banks a memory stored so that two values are read out simultaneously can.
Landscapes
- Engineering & Computer Science (AREA)
- Computational Linguistics (AREA)
- Signal Processing (AREA)
- Health & Medical Sciences (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- Acoustics & Sound (AREA)
- Multimedia (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Transmission Systems Not Characterized By The Medium Used For Transmission (AREA)
- Reduction Or Emphasis Of Bandwidth Of Signals (AREA)
Abstract
Description
- Fig. 1
- die Zerlegung eines Zeitabschnitts in 4 Tracks mit je 10 möglichen Pulspositionen;
- Fig. 2
- eine Tabelle der zu testenden Track-/Pulskombinationen;
- Fig. 3
- eine Tabelle der benachbarten und nicht benachbarten Tracks;
- Fig. 4
- eine Dreieckmatrix mit Koeffizienten einer Kombination gleicher Tracks;
- Fig. 5
- die Koeffizienten der Hauptdiagonale;
- Fig. 6
- eine Gesamtübersicht aller zu berechnenden Koeffizienten;
- Fig. 7
- die Berechnung der Gruppe der Kombinationen benachbarter Tracks (Block 1);
- Fig. 8
- die Speicherreihenfolge von Block 1 nach dem eisten Schritt;
- Fig. 9
- die Speicherreihenfolge von Block 1 nach dem zweiten Schritt;
- Fig. 10
- die Berechnung der Gruppe der Kombinationen nicht benachbarter Tracks (Block 2);
- Fig. 11
- die Speicherreihenfolge von Block 2 nach dem ersten Schritt;
- Fig. 12
- die Speicherreihenfolge von Block 2 nach dem zweiten Schritt;
- Fig. 13
- die Berechnung des Blocks mit den Werten gleicher Tracks (Block 3); und
- Fig. 14
- die Speicherplatzreihenfolge von Block 3.
Claims (19)
- Verfahren für die algebraische Codebook-Suche eines Sprachsignalkodierers, vorzugsweise nach dem Code Excited Linear Prediction-Verfahren, bei dem zur Berechnung von Koeffizienten der Dreieckmatrix der Autokorrelationsmatrix vom Toeplitz-Typ ein n Sprachsignalabtastungen umfassender Zeitabschnitt in eine ganzzahlige Anzahl Tracks t mit je p möglichen Pulspositionen zerlegt wird,
dadurch gekennzeichnet, dass die Koeffizienten gruppiert nachKombinationen benachbarter Tracks;Kombinationen nicht benachbarter Tracks;Kombinationen gleicher Tracks; undKoeffizienten der Hauptdiagonale der Autokorrelationsmatrix in einem Speicher abgelegt werden. - Verfahren nach Anspruch 1,
dadurch gekennzeichnet, dass für die Gruppen der Kombinationen benachbarter und nicht benachbarter Tracks jeweils t Datensätze mit je p x p Koeffizienten gespeichert werden. - Verfahren nach Anspruch 1 oder 2,
dadurch gekennzeichnet, dass die Koeffizienten sequentiell in einem Speicher abgelegt werden. - Verfahren nach Anspruch 2 oder 3,
dadurch gekennzeichnet, dass eine einen horizontalen oder vertikalen Vektor der Autokorrelationsmatrix darstellende Untergruppe eines Datensatzes mit p Koeffizienten durch eine Programmschleife ausgelesen wird, wobei ein die Speicherstelle des ersten Koeffizienten bezeichnender Wert und eine konstante Schrittweite bis zur nächsten Speicherstelle vorgegeben werden. - Verfahren nach Anspruch 4,
dadurch gekennzeichnet, dass für die Datensätzen der Gruppe der Kombinationen benachbarter Tracks die Schrittweite eins gewählt wird. - Verfahren nach Anspruch 4,
dadurch gekennzeichnet, dass für die Datensätzen der Gruppe der Kombinationen nicht benachbarter Tracks die Schrittweite p gewählt wird. - Verfahren nach einem der vorangehenden Ansprüche,
dadurch gekennzeichnet, dass für die Gruppe der Kombinationen gleicher Tracks t Dreieckmatrizen sequentiell gespeichert werden. - Verfahren nach Anspruch 7,
dadurch gekennzeichnet, dass der Zugriff auf die Koeffizienten der Gruppe gleicher Tracks über eine Nachschlagetabelle erfolgt. - Verfahren nach einem der vorangehenden Ansprüche,
dadurch gekennzeichnet, dass die Koeffizienten der Hauptdiagonale sequentiell gespeichert werden. - Verfahren nach einem der vorangehenden Ansprüche,
dadurch gekennzeichnet, dass innerhalb eines Zeitabschnitts 40 Sprachsignalabtastungen erfasst werden. - Verfahren nach einem der vorangehenden Ansprüche,
dadurch gekennzeichnet, dass die Autokorrelationsmatrix eine 40 x 40-Matrix ist. - Verfahren nach einem der vorangehenden Ansprüche,
dadurch gekennzeichnet, dass ein Zeitabschnitt in fünf Tracks mit je acht möglichen Pulspositionen zerlegt wird. - Verfahren nach einem der Ansprüche 1 bis 11,
dadurch gekennzeichnet, dass ein Zeitabschnitt in vier Tracks mit je zehn möglichen Pulspositionen zerlegt wird. - Verfahren nach einem der vorangehenden Ansprüche,
dadurch gekennzeichnet, dass für die Gruppe der Kombinationen benachbarter Tracks 320 Koeffizienten ermittelt werden. - Verfahren nach einem der vorangehenden Ansprüche,
dadurch gekennzeichnet, dass für die Gruppe der Kombinationen nicht benachbarter Tracks 320 Koeffizienten ermittelt werden. - Verfahren nach einem der vorangehenden Ansprüche,
dadurch gekennzeichnet, dass für die Gruppe der Kombinationen gleicher Tracks 140 Koeffizienten ermittelt werden. - Verfahren nach einem der vorangehenden Ansprüche,
dadurch gekennzeichnet, dass insgesamt 820 Koeffizienten ermittelt werden. - Verfahren nach einem der vorangehenden Ansprüche,
dadurch gekennzeichnet, dass Koeffizientengruppen in verschiedenen RAM-Speicherbänken eines mehrere RAM Speicherbänke aufweisenden Speichers gespeichert werden. - Kommunikationseinrichtung mit einem Sprachsignalkodierer, insbesondere Mobiltelefon,
dadurch gekennzeichnet, dass es ein Betriebssystem mit einem Verfahren nach einem der Ansprüche 1 bis 18 aufweist.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE10140507A DE10140507A1 (de) | 2001-08-17 | 2001-08-17 | Verfahren für die algebraische Codebook-Suche eines Sprachsignalkodierers |
DE10140507 | 2001-08-17 |
Publications (2)
Publication Number | Publication Date |
---|---|
EP1286331A1 true EP1286331A1 (de) | 2003-02-26 |
EP1286331B1 EP1286331B1 (de) | 2004-11-24 |
Family
ID=7695835
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP02102146A Expired - Lifetime EP1286331B1 (de) | 2001-08-17 | 2002-08-16 | Verfahren für die algebraische Codebook-Suche eines Sprachsignalkodierers |
Country Status (5)
Country | Link |
---|---|
US (1) | US20030046067A1 (de) |
EP (1) | EP1286331B1 (de) |
JP (1) | JP4261142B2 (de) |
AT (1) | ATE283531T1 (de) |
DE (2) | DE10140507A1 (de) |
Families Citing this family (19)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7698132B2 (en) * | 2002-12-17 | 2010-04-13 | Qualcomm Incorporated | Sub-sampled excitation waveform codebooks |
US7249014B2 (en) * | 2003-03-13 | 2007-07-24 | Intel Corporation | Apparatus, methods and articles incorporating a fast algebraic codebook search technique |
JP3981399B1 (ja) | 2006-03-10 | 2007-09-26 | 松下電器産業株式会社 | 固定符号帳探索装置および固定符号帳探索方法 |
JP4353202B2 (ja) | 2006-05-25 | 2009-10-28 | ソニー株式会社 | 韻律識別装置及び方法、並びに音声認識装置及び方法 |
US20080120098A1 (en) * | 2006-11-21 | 2008-05-22 | Nokia Corporation | Complexity Adjustment for a Signal Encoder |
US20100086235A1 (en) * | 2007-05-03 | 2010-04-08 | Kevin Loughrey | Large Number ID Tagging System |
CN100530357C (zh) * | 2007-07-11 | 2009-08-19 | 华为技术有限公司 | 固定码书搜索方法及搜索器 |
CN100578619C (zh) * | 2007-11-05 | 2010-01-06 | 华为技术有限公司 | 编码方法和编码器 |
TWI384767B (zh) * | 2008-11-21 | 2013-02-01 | Univ Nat Chiao Tung | 用以分群一編碼簿以及自該編碼簿選取一預編碼字之方法、裝置及其電腦程式產品 |
US20100153100A1 (en) * | 2008-12-11 | 2010-06-17 | Electronics And Telecommunications Research Institute | Address generator for searching algebraic codebook |
ES2535609T3 (es) | 2011-02-14 | 2015-05-13 | Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. | Codificador de audio con estimación de ruido de fondo durante fases activas |
PL2676266T3 (pl) | 2011-02-14 | 2015-08-31 | Fraunhofer Ges Forschung | Układ kodowania na bazie predykcji liniowej wykorzystujący kształtowanie szumu w dziedzinie widmowej |
PL2676268T3 (pl) | 2011-02-14 | 2015-05-29 | Fraunhofer Ges Forschung | Urządzenie i sposób przetwarzania zdekodowanego sygnału audio w domenie widmowej |
AU2012217158B2 (en) | 2011-02-14 | 2014-02-27 | Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. | Information signal representation using lapped transform |
CN103493129B (zh) | 2011-02-14 | 2016-08-10 | 弗劳恩霍夫应用研究促进协会 | 用于使用瞬态检测及质量结果将音频信号的部分编码的装置与方法 |
PT2676267T (pt) * | 2011-02-14 | 2017-09-26 | Fraunhofer Ges Forschung | Codificação e descodificação de posições de pulso de faixas de um sinal de áudio |
BR112013020324B8 (pt) | 2011-02-14 | 2022-02-08 | Fraunhofer Ges Forschung | Aparelho e método para supressão de erro em fala unificada de baixo atraso e codificação de áudio |
WO2014053261A1 (en) * | 2012-10-05 | 2014-04-10 | Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. | An apparatus for encoding a speech signal employing acelp in the autocorrelation domain |
US11016844B2 (en) * | 2019-03-15 | 2021-05-25 | Toshiba Memory Corporation | Error correction code structure |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5717825A (en) * | 1995-01-06 | 1998-02-10 | France Telecom | Algebraic code-excited linear prediction speech coding method |
US5924062A (en) * | 1997-07-01 | 1999-07-13 | Nokia Mobile Phones | ACLEP codec with modified autocorrelation matrix storage and search |
Family Cites Families (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0563229B1 (de) * | 1990-12-21 | 1999-11-10 | BRITISH TELECOMMUNICATIONS public limited company | Sprachcodierung |
US5956757A (en) * | 1996-03-22 | 1999-09-21 | Adaptec, Inc. | Method and apparatus for generating addresses |
US5751901A (en) * | 1996-07-31 | 1998-05-12 | Qualcomm Incorporated | Method for searching an excitation codebook in a code excited linear prediction (CELP) coder |
US6807527B1 (en) * | 1998-02-17 | 2004-10-19 | Motorola, Inc. | Method and apparatus for determination of an optimum fixed codebook vector |
US6556966B1 (en) * | 1998-08-24 | 2003-04-29 | Conexant Systems, Inc. | Codebook structure for changeable pulse multimode speech coding |
US6545833B1 (en) * | 1999-05-07 | 2003-04-08 | Seagate Technology Llc | Method to eliminate reassignments |
US6415255B1 (en) * | 1999-06-10 | 2002-07-02 | Nec Electronics, Inc. | Apparatus and method for an array processing accelerator for a digital signal processor |
US6847929B2 (en) * | 2000-10-12 | 2005-01-25 | Texas Instruments Incorporated | Algebraic codebook system and method |
-
2001
- 2001-08-17 DE DE10140507A patent/DE10140507A1/de not_active Withdrawn
-
2002
- 2002-08-13 US US10/218,219 patent/US20030046067A1/en not_active Abandoned
- 2002-08-16 AT AT02102146T patent/ATE283531T1/de not_active IP Right Cessation
- 2002-08-16 DE DE50201604T patent/DE50201604D1/de not_active Expired - Lifetime
- 2002-08-16 EP EP02102146A patent/EP1286331B1/de not_active Expired - Lifetime
- 2002-08-19 JP JP2002237901A patent/JP4261142B2/ja not_active Expired - Fee Related
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5717825A (en) * | 1995-01-06 | 1998-02-10 | France Telecom | Algebraic code-excited linear prediction speech coding method |
US5924062A (en) * | 1997-07-01 | 1999-07-13 | Nokia Mobile Phones | ACLEP codec with modified autocorrelation matrix storage and search |
Non-Patent Citations (2)
Title |
---|
GUYADER LE A ET AL: "ROBUST AND FAST CODE-EXCITED LINEAR PREDICTIVE CODING OF SPEECH SIGNALS", SPEECH PROCESSING 1. GLASGOW, MAY 23 - 26, 1989, INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH & SIGNAL PROCESSING. ICASSP, NEW YORK, IEEE, US, vol. 1 CONF. 14, 23 May 1989 (1989-05-23), pages 120 - 123, XP000089686 * |
SALAMI R ET AL: "ITU-T G.729 ANNEX A: REDUCED COMPLEXITY 8 KB/S CS-ACELP CODES FOR DIGITAL SIMULTANEOUS VOICE AND DATA", IEEE COMMUNICATIONS MAGAZINE, IEEE SERVICE CENTER. PISCATAWAY, N.J, US, vol. 35, no. 9, 1 September 1997 (1997-09-01), pages 56 - 63, XP000704424, ISSN: 0163-6804 * |
Also Published As
Publication number | Publication date |
---|---|
EP1286331B1 (de) | 2004-11-24 |
US20030046067A1 (en) | 2003-03-06 |
DE50201604D1 (de) | 2004-12-30 |
JP2003108199A (ja) | 2003-04-11 |
ATE283531T1 (de) | 2004-12-15 |
JP4261142B2 (ja) | 2009-04-30 |
DE10140507A1 (de) | 2003-02-27 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1286331B1 (de) | Verfahren für die algebraische Codebook-Suche eines Sprachsignalkodierers | |
DE19604273C2 (de) | Verfahren und Vorrichtung zum Durchführen einer Suche in einem Kodebuch im Hinblick auf das Kodieren eines Klangsignales, Zellkommunikationssystem, Zellnetzwerkelement und mobile Zell-Sender-/Empfänger-Einheit | |
DE69838305T2 (de) | Orthogonalisierungssuche für die CELP basierte Sprachkodierung | |
DE69828725T2 (de) | Sprachcodier- und -decodiersystem | |
DE19609170B4 (de) | Verfahren zur Durchführung einer "Tiefe-Zuerst"-Suche in einem Codebuch zur Codierung eines Geräusch- bzw. Klangsignales, Vorrichtung zur Durchführung dieses Verfahrens sowie zellulares Kommunikationssystem mit einer derartigen Vorrichtung | |
DE69531471T2 (de) | Mehrkanalsignalkodierung unter Verwendung gewichteter Vektorquantisierung | |
DE69837822T2 (de) | Verfahren und Vorrichtung zur Dekodierung von Sprachsignalen | |
DE60120766T2 (de) | Indizieren von impulspositionen und vorzeichen in algebraischen codebüchern zur codierung von breitbandsignalen | |
DE69932460T2 (de) | Sprachkodierer/dekodierer | |
DE60124274T2 (de) | Codebuchstruktur und suchverfahren für die sprachkodierung | |
DE4135070C1 (de) | ||
DE69734837T2 (de) | Sprachkodierer, sprachdekodierer, sprachkodierungsmethode und sprachdekodierungsmethode | |
EP1080464B1 (de) | Verfahren und anordnung zur sprachcodierung | |
DE3711348A1 (de) | Verfahren zum erkennen kontinuierlich gesprochener woerter | |
DE60016305T2 (de) | Verfahren zum Betrieb eines Sprachkodierers | |
DE69827313T2 (de) | Verfahren zur Kodierung des Zufallskomponenten-Vektors in einem ACELP-Kodierer | |
DE69835948T2 (de) | Verfahren und einrichtung zur übertragung von zusammengesetzten trägersignalen | |
DE60109111T2 (de) | Sprachdekoder zum hochqualitativen Dekodieren von Signalen mit Hintergrundrauschen | |
DE69131779T2 (de) | Sprachcodierung | |
DE10010238A1 (de) | Verfahren zum Speichern von Pfadmetriken in einem Viterbi-Decodierer | |
DE69820515T2 (de) | Vorrichtung zur Sprachcodierung unter Verwendung eines Mehrimpulsanregungssignals | |
DE4315313C2 (de) | Vektorcodierverfahren insbesondere für Sprachsignale | |
EP0697125B1 (de) | Verfahren zur vektorquantisierung, insbesondere von sprachsignalen | |
DE69931642T2 (de) | Sprachkodier/dekodiervorrichtung | |
DE69937477T2 (de) | Pulspositions- Kontrolle für einen algebraischen Sprachkodierer |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR IE IT LI LU MC NL PT SE SK TR Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR IE IT LI LU MC NL PT SE SK TR |
|
AX | Request for extension of the european patent |
Extension state: AL LT LV MK RO SI |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: KONINKLIJKE PHILIPS ELECTRONICS N.V. Owner name: PHILIPS INTELLECTUAL PROPERTY & STANDARDS GMBH |
|
17P | Request for examination filed |
Effective date: 20030826 |
|
AKX | Designation fees paid |
Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR IE IT LI LU MC NL PT SE SK TR |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR IE IT LI LU MC NL PT SE SK TR |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: TR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20041124 Ref country code: SK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20041124 Ref country code: NL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20041124 Ref country code: IT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED. Effective date: 20041124 Ref country code: IE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20041124 Ref country code: FI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20041124 Ref country code: EE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20041124 Ref country code: CZ Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20041124 Ref country code: BG Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20041124 |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D Free format text: NOT ENGLISH |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP |
|
REF | Corresponds to: |
Ref document number: 50201604 Country of ref document: DE Date of ref document: 20041230 Kind code of ref document: P |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D Free format text: GERMAN |
|
GBT | Gb: translation of ep patent filed (gb section 77(6)(a)/1977) |
Effective date: 20050117 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20050224 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20050224 Ref country code: DK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20050224 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: ES Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20050306 |
|
NLV1 | Nl: lapsed or annulled due to failure to fulfill the requirements of art. 29p and 29m of the patents act | ||
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FD4D |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20050816 Ref country code: CY Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20050816 Ref country code: AT Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20050816 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MC Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20050831 Ref country code: BE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20050831 |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
ET | Fr: translation filed | ||
26N | No opposition filed |
Effective date: 20050825 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20060831 Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20060831 |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: 732E |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: TP |
|
BERE | Be: lapsed |
Owner name: KONINKLIJKE *PHILIPS ELECTRONICS N.V. Effective date: 20050831 Owner name: *PHILIPS INTELLECTUAL PROPERTY & STANDARDS G.M.B.H Effective date: 20050831 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: PT Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20050424 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20090814 Year of fee payment: 8 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20100824 Year of fee payment: 9 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20100811 Year of fee payment: 9 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R119 Ref document number: 50201604 Country of ref document: DE Effective date: 20110301 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20110301 |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20110816 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: ST Effective date: 20120430 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20110831 Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20110816 |