A simplified signed powers-of-two conversion for multiplierless adaptive filters

A simplified binary to signed-powers-of-two (SPT) conversion circuit for multiplierless adaptive filters is presented. The proposed conversion algorithm does not have a carry propagate chain, which is inherent in conventional SPT conversion algorithms that give minimal representation. The proposed algorithm a therefore highly suitable for use in high-speed systems. The numbers representable by our proposed conversion algorithm are only slightly fewer than those representable by the optimal SPT conversion. For adaptive filtering applications, due to the adaptive nature of the coefficients, the performance of the filters employing our proposed and the optimal SPT conversion is comparable. This is verified with simulation results for two examples