### 抄録

As seen in stream data processing, it is necessary to extract a particular data field from bulk data, where we can use a field-data extractor. Particularly, an (M; N)-field-data extractor reads out any consecutive N bytes from an M-byte register by connecting its input/output using multiplexers (MUXs). However, the number of required MUXs increases too much as the input/output byte widths increase. It is known that partitioning a MUX network leads to reducing the number of MUXs. In this paper, we firstly pick up a multi-layered MUX network, which is generated by repeatedly partitioning a MUX network into a collection of singlelayered MUX networks. We show that the multi-layered MUX network is equivalent to the barrel shifter from which redundant MUXs and wires are removed, and we prove that the number of required MUXs becomes the smallest among MUX-network-partitioning based field-data extractors. Next, we propose a rotator-based MUX network for a field-data extractor, which is based on reading out a particular data in an input register to a rotator. The byte width of the rotator is the same as its output register and hence we no longer require any extra wires nor MUXs. By rotating the input data appropriately, we can finally have a right-ordered data into an output register. Experimental results show that a multi-layered MUX network reduces the number of required gates to construct a field-data extractor by up to 97.0% compared with the one using a naive approach and its delay becomes 1.8 ns-2.3 ns. A rotator-based MUX network with a control circuit also reduces the number of required gates to construct a field-data extractor by up to 97.3% compared with the one using a naive approach and its delay becomes 2.1 ns-2.9 ns.

元の言語 | English |
---|---|

ページ（範囲） | 1015-1028 |

ページ数 | 14 |

ジャーナル | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |

巻 | E100A |

発行部数 | 4 |

DOI | |

出版物ステータス | Published - 2017 4 1 |

### Fingerprint

### ASJC Scopus subject areas

- Signal Processing
- Computer Graphics and Computer-Aided Design
- Applied Mathematics
- Electrical and Electronic Engineering

### これを引用

*IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences*,

*E100A*(4), 1015-1028. https://doi.org/10.1587/transfun.E100.A.1015

**Efficient multiplexer networks for field-data extractors and their evaluations.** / Ito, Koki; Kawamura, Kazushi; Tamiya, Yutaka; Yanagisawa, Masao; Togawa, Nozomu.

研究成果: Article

*IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences*, 巻. E100A, 番号 4, pp. 1015-1028. https://doi.org/10.1587/transfun.E100.A.1015

}

TY - JOUR

T1 - Efficient multiplexer networks for field-data extractors and their evaluations

AU - Ito, Koki

AU - Kawamura, Kazushi

AU - Tamiya, Yutaka

AU - Yanagisawa, Masao

AU - Togawa, Nozomu

PY - 2017/4/1

Y1 - 2017/4/1

N2 - As seen in stream data processing, it is necessary to extract a particular data field from bulk data, where we can use a field-data extractor. Particularly, an (M; N)-field-data extractor reads out any consecutive N bytes from an M-byte register by connecting its input/output using multiplexers (MUXs). However, the number of required MUXs increases too much as the input/output byte widths increase. It is known that partitioning a MUX network leads to reducing the number of MUXs. In this paper, we firstly pick up a multi-layered MUX network, which is generated by repeatedly partitioning a MUX network into a collection of singlelayered MUX networks. We show that the multi-layered MUX network is equivalent to the barrel shifter from which redundant MUXs and wires are removed, and we prove that the number of required MUXs becomes the smallest among MUX-network-partitioning based field-data extractors. Next, we propose a rotator-based MUX network for a field-data extractor, which is based on reading out a particular data in an input register to a rotator. The byte width of the rotator is the same as its output register and hence we no longer require any extra wires nor MUXs. By rotating the input data appropriately, we can finally have a right-ordered data into an output register. Experimental results show that a multi-layered MUX network reduces the number of required gates to construct a field-data extractor by up to 97.0% compared with the one using a naive approach and its delay becomes 1.8 ns-2.3 ns. A rotator-based MUX network with a control circuit also reduces the number of required gates to construct a field-data extractor by up to 97.3% compared with the one using a naive approach and its delay becomes 2.1 ns-2.9 ns.

AB - As seen in stream data processing, it is necessary to extract a particular data field from bulk data, where we can use a field-data extractor. Particularly, an (M; N)-field-data extractor reads out any consecutive N bytes from an M-byte register by connecting its input/output using multiplexers (MUXs). However, the number of required MUXs increases too much as the input/output byte widths increase. It is known that partitioning a MUX network leads to reducing the number of MUXs. In this paper, we firstly pick up a multi-layered MUX network, which is generated by repeatedly partitioning a MUX network into a collection of singlelayered MUX networks. We show that the multi-layered MUX network is equivalent to the barrel shifter from which redundant MUXs and wires are removed, and we prove that the number of required MUXs becomes the smallest among MUX-network-partitioning based field-data extractors. Next, we propose a rotator-based MUX network for a field-data extractor, which is based on reading out a particular data in an input register to a rotator. The byte width of the rotator is the same as its output register and hence we no longer require any extra wires nor MUXs. By rotating the input data appropriately, we can finally have a right-ordered data into an output register. Experimental results show that a multi-layered MUX network reduces the number of required gates to construct a field-data extractor by up to 97.0% compared with the one using a naive approach and its delay becomes 1.8 ns-2.3 ns. A rotator-based MUX network with a control circuit also reduces the number of required gates to construct a field-data extractor by up to 97.3% compared with the one using a naive approach and its delay becomes 2.1 ns-2.9 ns.

KW - Field-data extractor

KW - Multiplexer network

KW - Partitioning

KW - Rotator

UR - http://www.scopus.com/inward/record.url?scp=85017374788&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85017374788&partnerID=8YFLogxK

U2 - 10.1587/transfun.E100.A.1015

DO - 10.1587/transfun.E100.A.1015

M3 - Article

AN - SCOPUS:85017374788

VL - E100A

SP - 1015

EP - 1028

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 4

ER -