{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T19:23:33Z","timestamp":1648754613008},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,8,2]],"date-time":"2014-08-02T00:00:00Z","timestamp":1406937600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J AUDIO SPEECH MUSIC PROC."],"published-print":{"date-parts":[[2014,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In a bid to enhance the search performance, this paper presents an improved version of reduced candidate mechanism (RCM), an algebraic codebook search conducted on an algebraic code-excited linear prediction (ACELP) speech coder. This improvement is made based on two findings in a piece of our prior work. The first finding is that a pulse with a high contribution in the associated track is more likely to serve as an optimal pulse in the optimal codevector and the second is that the speech quality can be well maintained at a search accuracy above 50% approximately. Subsequently, a new finding in this study concerning a structured algebraic codebook in G.729 indicates that there is a 0.8321 probability that the number 1 ranked pulse in a global sorting by pulse contribution is indeed one of the optimal pulses. Hence, the number 1 pulse in the global sorting is labeled as one of the optimal pulses, following which a sequence of search tasks are fulfilled through RCM. This proposed complexity reduction algorithm, implemented on a G.729A speech codec, takes as few as eight searches, a search load tantamount to 2.5% of G.729A, 12.5% of global pulse replacement method (iteration = 2), 16.7% of iteration-free pulse replacement method, and 50% of RCM (<jats:italic>N<\/jats:italic> = 2). This proposal is thus found to successfully reduce the required computational complexity to a great extent as intended.<\/jats:p>","DOI":"10.1186\/s13636-014-0030-9","type":"journal-article","created":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T21:02:08Z","timestamp":1406926928000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An efficient algebraic codebook search for ACELP speech coder"],"prefix":"10.1186","volume":"2014","author":[{"given":"Ning-Yun","family":"Ku","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng-Yu","family":"Yeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaw-Hwa","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,2]]},"reference":[{"key":"30_CR1","first-page":"1957","volume-title":"Fast CELP coding based onalgebraic codes","author":"JP Adoul","year":"1987","unstructured":"JP Adoul, P Mabilleau, M Delprat, S Morissette, Fast CELP coding based on algebraic codes, in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (Dallas, Texas, USA, 1987), pp. 1957\u20131960"},{"key":"30_CR2","first-page":"13","volume-title":"16 kbpswideband speech coding technique based on algebraic CELP","author":"C Laflamme","year":"1991","unstructured":"C Laflamme, JP Adoul, R Salami, S Morissette, P Mabilleau, 16 kbps wideband speech coding technique based on algebraic CELP, in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (Toronto, Canada, 1991), pp. 13\u201316"},{"issue":"2","key":"30_CR3","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/89.661471","volume":"6","author":"R Salami","year":"1998","unstructured":"Salami R, Laflamme C, Adoul JP, Kataoka A, Hayashi S, Moriya T, Lamblin C, Massaloux D, Proust S, Kroon P, Shoham Y: Design and description of CS-ACELP: a toll quality 8\u00a0kb\/s speech coder. IEEE Trans. Speech Audio Process. 1998, 6(2):116-130.","journal-title":"IEEE Trans. Speech Audio Process"},{"issue":"6","key":"30_CR4","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1049\/ip-vis:20060123","volume":"153","author":"SM Tsai","year":"2006","unstructured":"Tsai SM, Yang JF: Efficient algebraic code-excited linear predictive codebook search. IEE Proc. Vis. Image Signal Process. 2006, 153(6):761-768.","journal-title":"IEE Proc. Vis. Image Signal Process"},{"issue":"9","key":"30_CR5","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/35.620526","volume":"35","author":"R Salami","year":"1997","unstructured":"Salami R, Laflamme C, Bessette B, Adoul JP: ITU-T\u00a0G.729 Annex A: reduced complexity 8\u00a0kb\/s CS-ACELP codec for digital simultaneous voice and data. IEEE Commun. Mag. 1997, 35(9):56-63.","journal-title":"IEEE Commun. Mag"},{"issue":"1","key":"30_CR6","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1049\/ip-vis:20020151","volume":"149","author":"FK Chen","year":"2002","unstructured":"Chen FK, Yang JF, Yan YL: Candidate scheme for fast ACELP search. IEE Proc. Vis. Image Signal Process. 2002, 149(1):10-16.","journal-title":"IEE Proc. Vis. Image Signal Process"},{"key":"30_CR7","first-page":"17","volume-title":"Proceedings of the IEEE Speech Coding Workshop","author":"H Park","year":"2002","unstructured":"Park H, Choi Y, Lee D: Efficient codebook search method for ACELP speech codecs. In Proceedings of the IEEE Speech Coding Workshop. Tsukuba, Ibaraki, Japan, Tsukuba, Ibaraki, Japan; 2002:17-19."},{"key":"30_CR8","first-page":"372","volume-title":"Global pulse replacement method for fixedcodebook search of ACELP speech codec","author":"ED Lee","year":"2003","unstructured":"ED Lee, MS Lee, DY Kim, Global pulse replacement method for fixed codebook search of ACELP speech codec, in Proceedings of the 2nd IASTED International Conference on Communications, Internet and Information Technology (Scottsdale, Arizona, USA, 2003), pp. 372\u2013375"},{"issue":"8","key":"30_CR9","doi-asserted-by":"publisher","first-page":"2496","DOI":"10.1109\/TASL.2007.907330","volume":"15","author":"B Geiser","year":"2007","unstructured":"Geiser B, Jax P, Vary P, Taddei H, Schandl S, Gartner M, Guillaume C, Ragot S: Bandwidth extension for hierarchical speech and audio coding in ITU-T Rec. G.729.1. IEEE Trans. Audio Speech Lang. Process. 2007, 15(8):2496-2509.","journal-title":"IEEE Trans. Audio Speech Lang. Process"},{"issue":"1","key":"30_CR10","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1049\/el:20073320","volume":"43","author":"ED Lee","year":"2007","unstructured":"Lee ED, Yun SH, Lee SI, Ahn JM: Iteration-free pulse replacement method for algebraic codebook search. Electron. Lett. 2007, 43(1):59-60.","journal-title":"Electron. Lett"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-540-77368-9_18","volume":"4413","author":"ED Lee","year":"2007","unstructured":"Lee ED, Ahn JM: Efficient fixed codebook search method for ACELP speech codecs. Lect. Notes Comput. Sci. 2007, 4413: 178-187.","journal-title":"Lect. Notes Comput. Sci"},{"issue":"17","key":"30_CR12","doi-asserted-by":"publisher","first-page":"2864","DOI":"10.1049\/iet-com.2012.0277","volume":"6","author":"CY Yeh","year":"2012","unstructured":"Yeh CY, Su YJ: Reduced candidate mechanism for an algebraic code-excited linear-prediction codebook search. IET Commun. 2012, 6(17):2864-2869.","journal-title":"IET Commun"},{"issue":"6","key":"30_CR13","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1049\/iet-spr.2009.0216","volume":"4","author":"FK Chen","year":"2010","unstructured":"Chen FK, Chen GM, Su BK, Tsai YR: Unified pulse-replacement search algorithms for algebra codebooks of speech coders. IET Signal Process. 2010, 4(6):658-665.","journal-title":"IET Signal Process"},{"issue":"5","key":"30_CR14","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1016\/j.camwa.2012.01.048","volume":"64","author":"CY Yeh","year":"2012","unstructured":"Yeh CY, Zhuo CZ: An efficient complexity reduction algorithm for G.729 speech codec. Comput. Math. Appl. 2012, 64(5):887-896.","journal-title":"Comput. Math. Appl"},{"key":"30_CR15","unstructured":"Perceptual evaluation of speech quality (PESQ): an objective method for end-to-end speech quality assessment of narrow-band telephone networks and speech codecs. 2001."},{"key":"30_CR16","unstructured":"Mapping Function for Transforming P.862 raw Result Scores to MOS-LQO. 2003."}],"container-title":["EURASIP Journal on Audio, Speech, and Music Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13636-014-0030-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13636-014-0030-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13636-014-0030-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13636-014-0030-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,2]],"date-time":"2021-09-02T04:57:56Z","timestamp":1630558676000},"score":1,"resource":{"primary":{"URL":"https:\/\/asmp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13636-014-0030-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,2]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["30"],"URL":"https:\/\/doi.org\/10.1186\/s13636-014-0030-9","relation":{},"ISSN":["1687-4722"],"issn-type":[{"value":"1687-4722","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,2]]},"assertion":[{"value":"3 January 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2014","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2014","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"30"}}