Hao Chongyang. TWO NEW METHODS FOR COMPUTATION OF THE SEGMENTATION CONVOLUTION[J]. Journal of Electronics & Information Technology, 1991, 13(5): 538-543.
Citation:
Hao Chongyang. TWO NEW METHODS FOR COMPUTATION OF THE SEGMENTATION CONVOLUTION[J]. Journal of Electronics & Information Technology, 1991, 13(5): 538-543.
Hao Chongyang. TWO NEW METHODS FOR COMPUTATION OF THE SEGMENTATION CONVOLUTION[J]. Journal of Electronics & Information Technology, 1991, 13(5): 538-543.
Citation:
Hao Chongyang. TWO NEW METHODS FOR COMPUTATION OF THE SEGMENTATION CONVOLUTION[J]. Journal of Electronics & Information Technology, 1991, 13(5): 538-543.
The two new methods presented in this paper is primarily concerned with a new procedure for computation of two sequences, both are scgmented. For long signal and long unit-impulse response filter (high-order filter), they will reduce the waiting time greatly, so that the fikered points will be quickly obtained and total operating time will be saved. Furthermore, they can also save the memory space. So the new methods have the ad-vantage of higher efficiency. Compared with using the traditional overlap-save method, the
processing error due to cutting tail will no longer exist by using the new methods.
A. V. Oppenheim, R. W. Schafer著,董士嘉等译,数字信号处理,1975年,科学出版社,北京,郝重阳编,数学信号处理,西北工业大学,1989年.[2]邹理和,数字滤波器,国防工业出版社,1979年,北京.[3]尹述炎,长序列分段线性卷积重叠保留法的进一步完善,第一届全国信号处理学术会议论文集,1964年,承德,pp. 543-545.