Efficient implementation of FIR comb/decimating filter
"Is there a computationally efficient way to take advantage of the fact that most of the taps are zero?"


is there a pattern to those taps (or to the taps that are potentially non-zero)?  can you skip over those taps that are known in advance to have zero coefficient?