Optimizing interconnection complexity for realizing fixed permutation in data and signal processing algorithms

Ren Chen, Viktor K. Prasanna. Optimizing interconnection complexity for realizing fixed permutation in data and signal processing algorithms. In Paolo Ienne, Walid A. Najjar, Jason Anderson, Philip Brisk, Walter Stechele, editors, 26th International Conference on Field Programmable Logic and Applications, FPL 2016, Lausanne, Switzerland, August 29 - September 2, 2016. pages 1-9, IEEE, 2016. [doi]

@inproceedings{ChenP16-11,
  title = {Optimizing interconnection complexity for realizing fixed permutation in data and signal processing algorithms},
  author = {Ren Chen and Viktor K. Prasanna},
  year = {2016},
  doi = {10.1109/FPL.2016.7577333},
  url = {http://dx.doi.org/10.1109/FPL.2016.7577333},
  researchr = {https://researchr.org/publication/ChenP16-11},
  cites = {0},
  citedby = {0},
  pages = {1-9},
  booktitle = {26th International Conference on Field Programmable Logic and Applications, FPL 2016, Lausanne, Switzerland, August 29 - September 2, 2016},
  editor = {Paolo Ienne and Walid A. Najjar and Jason Anderson and Philip Brisk and Walter Stechele},
  publisher = {IEEE},
  isbn = {978-2-8399-1844-2},
}