检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:蒋俊正[1] 曹想 欧阳缮[1] JIANG Junzhen;CAO Xiang;OUYANG Shan(School of Information and Communication,Guilin Univ.of Electronic Technology,Guilin 54 1004,China)
机构地区:[1]桂林电子科技大学信息与通信学院,广西桂林541004
出 处:《西安电子科技大学学报》2018年第2期166-170,共5页Journal of Xidian University
基 金:国家自然科学基金资助项目(61261032;61371186;61761011);广西自然科学基金资助项目(2013GXNSFBA019264);桂林电子科技大学研究生教育创新计划资助项目(2017YJCX21)
摘 要:针对两通道正交图滤波器组频率特性差的问题,提出了一种基于二阶泰勒近似的迭代算法.首先,该算法将两通道正交图滤波器组的设计问题归结为一个带约束优化问题.将图滤波器组的重构误差作为目标函数,滤波器的阻带衰减作为约束函数;然后,通过泰勒近似将高度非线性非凸的目标函数转化为关于增量的凸的二次函数,将非凸优化问题近似为凸的优化问题;最后,采用迭代方法求解该优化问题.仿真结果表明,与伯恩斯坦多项式逼近的算法相比,新算法设计的两通道正交图滤波器组重构误差减小了约1个数量级,信噪比提高了约8dB.An iterative algorithm based on sccond-ordcr approximation of Taylor’s series is proposed to overcome the problem that the two channel orthogonal graph filter bank possesses poor frequency characteristic.First,the design problem is formulated into a constrained optimization problem,whose objective function is the reconstruction error of the two channel orthogonal graph filter bank,and the constraint function is the stopband attenuation.Then,by means of the Taylor approximation,the highly nonlinear nonconvcx objective function is approximately transformed into a convex quadratic function with respect to increments.Thus,the nonconvcx optimization problem is approximated to a convex optimization problem.Finally,an iterative technique is used to solve the optimization problem.Simulation results show that the reconstruction error of the two channel orthogonal graph filter bank obtained by the new method is approximately one order of magnitude lower than that by the Bernstein polynomial approximation algorithm and that the improvement on the reconstruction error is about 8dB.
分 类 号:TN911.7[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7