A New Self-Routing Permutation Network

@article{Cheng1996ANS,
  title={A New Self-Routing Permutation Network},
  author={Wang-Jiunn Cheng and Wen-Tsuen Chen},
  journal={IEEE Trans. Computers},
  year={1996},
  volume={45},
  pages={630-636}
}
In this paper, a self-routing permutation network based on a binary radix sorting network has been proposed. It has O(log2 n) propagation delay and O(n log’ n) hardware complexity with bit-parallel input. The hardware complexity can be reduced to O(n log n) with bitserial input. The binary radix sorting network is recursively constructed by log n stages of bit sorting networks. The bit sorting network is then constructed by a proposed self-routing reverse banyan network. It has O(log n… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 10 extracted citations

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Oruc, ”A Self-Routing Permutation Network

  • A.Y.D.M. Koppelman
  • Parallel Distributed Computing,
  • 1990

Similar Papers

Loading similar papers…