SBNR processor for stack filters

The signed binary number representation (SBNR) is used to reduce the number of PBF calculation stages in stack filters. The approach is based on the possibility of minimization of signed power-of-two terms in the SBNR representation of input data. A coder and a decoder for the mutual transformation of binary-weighted code and the minimal SBNR are proposed. An efficient algorithm and a processor structure for stack filtering based on the minimal SBNR are presented. The time complexity of the proposed filter is of order kT_PBF, where k is the number of bits in the input signals and T_PBF is the delay in the incorporated circuit for the positive Boolean function (PBF). A stack filtering algorithm for the generalized nonadjacent form (GNAF) of signed digit number representation (SDNR) is also presented