On Reducing Computational Complexity of Codebook Search in CELP Coding
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | J.I.Lee | ko |
| dc.contributor.author | Un, Chong-Kwan | ko |
| dc.date.accessioned | 2013-02-24T11:43:20Z | - |
| dc.date.available | 2013-02-24T11:43:20Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 1990-11 | - |
| dc.identifier.citation | IEEE TRANSACTIONS ON COMMUNICATIONS, v.38, no.11, pp.1935 - 1937 | - |
| dc.identifier.issn | 0090-6778 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/56904 | - |
| dc.description.abstract | In this paper, we propose a computationally efficient code-book search method in code-excited linear prediction. The proposed method can reduce the computational complexity by almost one half as compared to the frequency-domain codebook search method that is currently regarded as the fastest search method. This reduction is possible as a result of the simultaneous use of frequency-domain search and code vector sparsity. | - |
| dc.language | English | - |
| dc.publisher | IEEE-Inst Electrical Electronics Engineers Inc | - |
| dc.title | On Reducing Computational Complexity of Codebook Search in CELP Coding | - |
| dc.type | Article | - |
| dc.identifier.wosid | A1990EP10900005 | - |
| dc.identifier.scopusid | 2-s2.0-0025519025 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 38 | - |
| dc.citation.issue | 11 | - |
| dc.citation.beginningpage | 1935 | - |
| dc.citation.endingpage | 1937 | - |
| dc.citation.publicationname | IEEE TRANSACTIONS ON COMMUNICATIONS | - |
| dc.contributor.localauthor | Un, Chong-Kwan | - |
| dc.contributor.nonIdAuthor | J.I.Lee | - |
| dc.type.journalArticle | Article | - |
- Appears in Collection
- EE-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 1 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.