Bi-Partitioning Based Multiplexer Network for Field-Data Extractors
Summary :
An (M,N)-field-data extractor reads out any consecutive N bytes from an M-byte register by connecting its input/output using a multiplexer (MUX) network. It is used in packet analysis and/or stream data processing for video/audio data. In this letter, we propose an efficient MUX network for an (M,N)-field-data extractor. By bi-partitioning a simple MUX network into an upper one and a lower one, we can theoretically reduce the number of required MUXs without increasing the MUX network depth. Experimental results show that we can reduce the gate count by up to 92% compared to a naive approach.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E99-A No.7 pp.1410-1414
- Publication Date
- 2016/07/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E99.A.1410
- Type of Manuscript
- Special Section LETTER (Special Section on Design Methodologies for System on a Chip)
- Category
Authors
Koki ITO
Waseda University
Kazushi KAWAMURA
Waseda University
Yutaka TAMIYA
the Fijitsu Laboratories Ltd.
Masao YANAGISAWA
Waseda University
Nozomu TOGAWA
Waseda University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Koki ITO, Kazushi KAWAMURA, Yutaka TAMIYA, Masao YANAGISAWA, Nozomu TOGAWA, "Bi-Partitioning Based Multiplexer Network for Field-Data Extractors" in IEICE TRANSACTIONS on Fundamentals,
vol. E99-A, no. 7, pp. 1410-1414, July 2016, doi: 10.1587/transfun.E99.A.1410.
Abstract: An (M,N)-field-data extractor reads out any consecutive N bytes from an M-byte register by connecting its input/output using a multiplexer (MUX) network. It is used in packet analysis and/or stream data processing for video/audio data. In this letter, we propose an efficient MUX network for an (M,N)-field-data extractor. By bi-partitioning a simple MUX network into an upper one and a lower one, we can theoretically reduce the number of required MUXs without increasing the MUX network depth. Experimental results show that we can reduce the gate count by up to 92% compared to a naive approach.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.1410/_p
Copy
@ARTICLE{e99-a_7_1410,
author={Koki ITO, Kazushi KAWAMURA, Yutaka TAMIYA, Masao YANAGISAWA, Nozomu TOGAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Bi-Partitioning Based Multiplexer Network for Field-Data Extractors},
year={2016},
volume={E99-A},
number={7},
pages={1410-1414},
abstract={An (M,N)-field-data extractor reads out any consecutive N bytes from an M-byte register by connecting its input/output using a multiplexer (MUX) network. It is used in packet analysis and/or stream data processing for video/audio data. In this letter, we propose an efficient MUX network for an (M,N)-field-data extractor. By bi-partitioning a simple MUX network into an upper one and a lower one, we can theoretically reduce the number of required MUXs without increasing the MUX network depth. Experimental results show that we can reduce the gate count by up to 92% compared to a naive approach.},
keywords={},
doi={10.1587/transfun.E99.A.1410},
ISSN={1745-1337},
month={July},}
Copy
TY - JOUR
TI - Bi-Partitioning Based Multiplexer Network for Field-Data Extractors
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1410
EP - 1414
AU - Koki ITO
AU - Kazushi KAWAMURA
AU - Yutaka TAMIYA
AU - Masao YANAGISAWA
AU - Nozomu TOGAWA
PY - 2016
DO - 10.1587/transfun.E99.A.1410
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2016
AB - An (M,N)-field-data extractor reads out any consecutive N bytes from an M-byte register by connecting its input/output using a multiplexer (MUX) network. It is used in packet analysis and/or stream data processing for video/audio data. In this letter, we propose an efficient MUX network for an (M,N)-field-data extractor. By bi-partitioning a simple MUX network into an upper one and a lower one, we can theoretically reduce the number of required MUXs without increasing the MUX network depth. Experimental results show that we can reduce the gate count by up to 92% compared to a naive approach.
ER -
English
