Bi-partitioning based multiplexer network for field-data extractors

Koki Ito; Kazushi Kawamura; Yutaka Tamiya; Masao Yanagisawa; Nozomu Togawa

doi:10.1587/transfun.E99.A.1410

Bi-partitioning based multiplexer network for field-data extractors

Koki Ito, Kazushi Kawamura, Yutaka Tamiya, Masao Yanagisawa, Nozomu Togawa

School of Fundamental Science and Engineering

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

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.

Original language	English
Pages (from-to)	1410-1414
Number of pages	5
Journal	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume	E99A
Issue number	7
DOIs	https://doi.org/10.1587/transfun.E99.A.1410
Publication status	Published - 2016 Jul

Keywords

Field-data extractor
Multiplexer network
Partitioning

ASJC Scopus subject areas

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

Access to Document

10.1587/transfun.E99.A.1410

Cite this

@article{16839aecfe4a47548c8b7a3b1e39c7fe,

title = "Bi-partitioning based multiplexer network for field-data extractors",

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 = "Field-data extractor, Multiplexer network, Partitioning",

author = "Koki Ito and Kazushi Kawamura and Yutaka Tamiya and Masao Yanagisawa and Nozomu Togawa",

note = "Publisher Copyright: {\textcopyright} 2016 The Institute of Electronics, Information and Communication Engineers.",

year = "2016",

month = jul,

doi = "10.1587/transfun.E99.A.1410",

language = "English",

volume = "E99A",

pages = "1410--1414",

journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",

issn = "0916-8508",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "7",

}

TY - JOUR

T1 - Bi-partitioning based multiplexer network for field-data extractors

AU - Ito, Koki

AU - Kawamura, Kazushi

AU - Tamiya, Yutaka

AU - Yanagisawa, Masao

AU - Togawa, Nozomu

PY - 2016/7

Y1 - 2016/7

N2 - 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.

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.

KW - Field-data extractor

KW - Multiplexer network

KW - Partitioning

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

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

U2 - 10.1587/transfun.E99.A.1410

DO - 10.1587/transfun.E99.A.1410

M3 - Article

AN - SCOPUS:84976902543

SN - 0916-8508

VL - E99A

SP - 1410

EP - 1414

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

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

IS - 7

ER -

Bi-partitioning based multiplexer network for field-data extractors

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this