Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Garcia, V.M.S. Ramirez, A.A.A. |
| Copyright Year | 2006 |
| Description | Author affiliation: CITEDI-IPN, Tijuana (Garcia, V.M.S.) |
| Abstract | A new algorithm of two stage vector quantization for joint source-channel speech coding for any transmission channels is presented. The computational complexity is only slightly higher than the most widely used multi stage vector quantization algorithm (MSVQ). This new algorithm improves the characteristics and the results of a sequential quantizer of two stages. The base of this algorithm is the modification of the well-known GS-RGSKAepsiv algorithm (reduced complexity generalized stochastic K-means algorithm of great speed) for a non-stationary channel. This new algorithm is optimal for the joint construction of two stages. The main features of the proposed algorithm are as follows: 1) Due to its stochastic nature it avoids being trapped in poor local minimums. 2) Initial codebooks are not needed; the codevectors move away from the gravity center of the training vectors towards their final position. 3) Source coding and channel coding are jointly optimized to obtain robust codebooks for different levels of noise in transmission channels. 4) The reduction of calculation time is based on geometric considerations and memory management. This algorithm allows to design the codebook orderly due to its advantageous convergence properties. The results showed that the algorithm needs only 8 to 16% of the number of mathematical operations in comparison with the operations required by others propositions for full search of MSQV, either stationary or non-stationary channels |
| Starting Page | 215 |
| Ending Page | 219 |
| File Size | 146938 |
| Page Count | 5 |
| File Format | |
| ISBN | 0769525695 |
| DOI | 10.1109/CERMA.2006.117 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 2006-09-26 |
| Publisher Place | Mexico |
| Access Restriction | Subscribed |
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subject Keyword | Speech coding Vector quantization Stochastic resonance Source coding Stochastic processes Robustness Management training Computational complexity Channel coding Gravity |
| Content Type | Text |
| Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|