n1 = length(Bhq) + length(Xi) - 1;%Bhq 1
out = zeros(1,n1);
for k = 1:n1
for j = max(1,k-length(Xi)):min(k,length(Bhq))
if k-j+1 > length(Xi)
continue;
else
out(k) = out(k) + Bhq(j)*Xi(k-j+1);
end
end
end
XiBhq = out(1:length(Xi));
其中,Bhq类似于信道,Xi类似于要过信道的数据
我实际对比了和conv的结果,完全一样
参考:
[https://blog.csdn.net/sinat_21026543/article/details/79880125]