We propose SXmin: a self routing, group Knockout Principle 15] based ATM packet switch which provides comparable delay-throughput performance and packet loss probabilities at signi cantly reduced hardware requirements compared to earlier switches 6,12,13,15,17]. The N N SXmin consists of an N N Batcher sorter followed by log 2 N ?1 stages of sort-expander (SX) modules arranged in the form of a complete binary tree. Each SX module consists of a column of 2 2 switches with a wraparound-unshu e input-output interconnection. This enables the hierarchical utilization of the group Knockout Principle to expand the number of inputs by a small factor at each stage, resulting in a signi cant reduction in overall hardware complexity. Routing at each switch is controlled by a single bit. However, in case of contention, a dual bit resolution algorithm is used locally which drops excess packets in a predetermined manner while ensuring global randomness of packet loss over the entire switching network. There are no internal bu ers at the individual stages and therefore the internal delay is constant and proportional to the number of stages. The use of simple hardware components and regular interconnections in the SX modules makes the network suitable for optical implementation.