Back-to-Back Butterfly Network, an Adaptive Permutation Network for New Communication Standards
Abstract
In this paper, we introduce an adaptive Back-to-Back Butterfly Network (B <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> BN) dedicated to next communication standards. It can perform any kind of permutation, and its architecture is based on a concatenation of basic networks. However for a set of permutations, the selection of non-conflicting paths is still a complex task. Hence, in our paper we rely on the properties of the proposed architecture, to introduce a formal model that efficiently solve such conflicts. From the collection of all possible paths in the targeted B <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> BN, the proposed method select the conflict-free paths to transfer data from the input to their permuted output (w.r.t., a ad hoc constraints model). Once the appropriate paths are selected, the control signals for B <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> BN are generated. This model has been experimented with 5G communication, showing how to process several frames in parallel with different permutation constraints.
BibTeX
@inproceedings{icassp2020_backtobackbutter,
title = {Back-to-Back Butterfly Network, an Adaptive Permutation Network for New Communication Standards},
author = {Hassan Harb and Cyrille Chavet},
booktitle = {ICASSP 2020},
year = {2020}
}