Optimization in the fast knockout algorithm for self-route concentration

The fast knockout (FKO) algorithm constructs self-route concentrators from multi-stage cascades of 2×2 sorters. It is an especially efficient technique for m-to-n concentration when m and n are within the practical range. The algorithm calls a sub-algorithm for pairing, where different choices of the sub-algorithm yield FKO concentrators of different efficiencies. The present paper provides a new sub-algorithm for pairing. The result complements the existing technique of “k-sorting” in generating a best-known m-to-n concentrator for all m and n within the range of ail practical purposes