Sorting on a<cd02166.gif>2-D Multistage Architecture with Nearest-Neighbour Interconnection of Switches

Josef GIGLMAYR

Sorting on a2-D Multistage Architecture with Nearest-Neighbour Interconnection of Switches

Josef GIGLMAYR

Full Text Views

0

Share
Cite this

Summary :

The polymer matrix for the number of N in-puts/outputs, N stages and 2x2-switches is denoted as the 1-D Spanke-Benes (SB) network. Throughout the paper, the 1-D SB-network, which equals the diamond cellular array, is extended to arbitrary dimensions by a mathematical transformation (a 1-D network provides the interconnection of 1-D data). This transformation determines the multistage architecture completely by providing size, location, geometry and wiring of the switches as well as it preserves properties of the networks, e.g., the capability of sorting. The SB-networks of dimension 3 are analysed and sorting is applied.

Publication: IEICE TRANSACTIONS on Communications Vol.E79-B No.12 pp.1839-1851

Publication Date: 1996/12/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Switching and Communication Processing

Cite this

Copy

Josef GIGLMAYR, "Sorting on a2-D Multistage Architecture with Nearest-Neighbour Interconnection of Switches" in IEICE TRANSACTIONS on Communications, vol. E79-B, no. 12, pp. 1839-1851, December 1996, doi: .
Abstract: The polymer matrix for the number of N in-puts/outputs, N stages and 2x2-switches is denoted as the 1-D Spanke-Benes (SB) network. Throughout the paper, the 1-D SB-network, which equals the diamond cellular array, is extended to arbitrary dimensions by a mathematical transformation (a 1-D network provides the interconnection of 1-D data). This transformation determines the multistage architecture completely by providing size, location, geometry and wiring of the switches as well as it preserves properties of the networks, e.g., the capability of sorting. The SB-networks of dimension 3 are analysed and sorting is applied.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e79-b_12_1839/_p

Copy

@ARTICLE{e79-b_12_1839,
author={Josef GIGLMAYR, },
journal={IEICE TRANSACTIONS on Communications},
title={Sorting on a2-D Multistage Architecture with Nearest-Neighbour Interconnection of Switches},
year={1996},
volume={E79-B},
number={12},
pages={1839-1851},
abstract={The polymer matrix for the number of N in-puts/outputs, N stages and 2x2-switches is denoted as the 1-D Spanke-Benes (SB) network. Throughout the paper, the 1-D SB-network, which equals the diamond cellular array, is extended to arbitrary dimensions by a mathematical transformation (a 1-D network provides the interconnection of 1-D data). This transformation determines the multistage architecture completely by providing size, location, geometry and wiring of the switches as well as it preserves properties of the networks, e.g., the capability of sorting. The SB-networks of dimension 3 are analysed and sorting is applied.},
keywords={},
doi={},
ISSN={},
month={December},}

Copy

TY - JOUR
TI - Sorting on a2-D Multistage Architecture with Nearest-Neighbour Interconnection of Switches
T2 - IEICE TRANSACTIONS on Communications
SP - 1839
EP - 1851
AU - Josef GIGLMAYR
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E79-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 1996
AB - The polymer matrix for the number of N in-puts/outputs, N stages and 2x2-switches is denoted as the 1-D Spanke-Benes (SB) network. Throughout the paper, the 1-D SB-network, which equals the diamond cellular array, is extended to arbitrary dimensions by a mathematical transformation (a 1-D network provides the interconnection of 1-D data). This transformation determines the multistage architecture completely by providing size, location, geometry and wiring of the switches as well as it preserves properties of the networks, e.g., the capability of sorting. The SB-networks of dimension 3 are analysed and sorting is applied.
ER -