检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]解放军理工大学通信工程学院,南京210007 [2]解放军理工大学指挥自动化学院,南京210007
出 处:《电子与信息学报》2011年第9期2062-2067,共6页Journal of Electronics & Information Technology
基 金:国家自然科学基金(61072042)资助课题
摘 要:用尽可能少的比特数实现线谱对(LSP)参数透明量化一直是语音编码领域的研究热点。该文基于压缩感知理论,研究了LSP参数在准KLT域的稀疏性,并设计了LSP参数先压缩感知再矢量量化的方案。编码端,利用压缩感知理论,在准KLT域将原始LSP参数投影到低维空间,得到低维测量值,而后采用分裂矢量量化算法对测量值进行量化;解码端,以量化后的测量值为已知条件,利用正交匹配追踪算法重构出原始LSP高维矢量,重构值作为最终量化值。实验结果表明,算法在适当的码本存储量和搜索复杂度下,达到透明量化效果所需的比特数最优时仅需5 bit/帧。For low bit rate speech coding applications,it is very important to quantize the Line Spectrum Pair(LSP) parameters accurately using as few bits as possible without sacrificing the speech quality.In this paper,the sparsity of LSP parameters on the approximated Karhunen-Loeve Transform(KLT) domain is researched,and then an efficient LSP parameters quantization scheme is proposed based on the Compressed Sensing(CS).In the encoder,the LSP parameters extracted from consecutive speech frames are compressed by CS on the approximate KLT domain to produce a low dimensional measurement vector,the measurements are quantized using the split vector quantizer.In the decoder,according to the quantized measurements,the original LSP vector is reconstructed by the orthogonal matching pursuit method,the reconstructed LSP vector is the ultimate quantization value of the original LSP parameters.Experimental results show that the scheme can obtain transparent quality at 5 bit/frame with realistic codebook storage and search complexity.
分 类 号:TN912.3[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.219.90.165