We define some important properties of the permutation matrices of t-shuffle type which can be used to synthesize omega and inverse omega multistage interconnection networks. We also address some features of these networks compared to other networks of delta type. Finally, we propose one modification of omega network which decreases the number of stages in the network.