IEICE TRANSACTIONS on Fundamentals
Assignment of Intervals to Parallel Tracks with Minimum Total Cross-Talk
Summary :
The most basic cross-talk minimization problem is to assign given n intervals to n parallel tracks where the cross-talk is defined between two intervals assigned to the adjacent tracks with the amount linear to parallel running length. This paper solves the problem for the case when any pair of intervals intersects and the objective is to minimize the sum of cross-talks. We begin the discussion with the fact that twice the sum of lengths of
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.9 pp.1909-1915
- Publication Date
- 1998/09/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- VLSI Design Technology and CAD
Authors
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
Yasuhiro TAKASHIMA, Atsushi TAKAHASHI, Yoji KAJITANI, "Assignment of Intervals to Parallel Tracks with Minimum Total Cross-Talk" in IEICE TRANSACTIONS on Fundamentals,
vol. E81-A, no. 9, pp. 1909-1915, September 1998, doi: .
Abstract: The most basic cross-talk minimization problem is to assign given n intervals to n parallel tracks where the cross-talk is defined between two intervals assigned to the adjacent tracks with the amount linear to parallel running length. This paper solves the problem for the case when any pair of intervals intersects and the objective is to minimize the sum of cross-talks. We begin the discussion with the fact that twice the sum of lengths of
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_9_1909/_p
Copy
@ARTICLE{e81-a_9_1909,
author={Yasuhiro TAKASHIMA, Atsushi TAKAHASHI, Yoji KAJITANI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Assignment of Intervals to Parallel Tracks with Minimum Total Cross-Talk},
year={1998},
volume={E81-A},
number={9},
pages={1909-1915},
abstract={The most basic cross-talk minimization problem is to assign given n intervals to n parallel tracks where the cross-talk is defined between two intervals assigned to the adjacent tracks with the amount linear to parallel running length. This paper solves the problem for the case when any pair of intervals intersects and the objective is to minimize the sum of cross-talks. We begin the discussion with the fact that twice the sum of lengths of
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - Assignment of Intervals to Parallel Tracks with Minimum Total Cross-Talk
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1909
EP - 1915
AU - Yasuhiro TAKASHIMA
AU - Atsushi TAKAHASHI
AU - Yoji KAJITANI
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 1998
AB - The most basic cross-talk minimization problem is to assign given n intervals to n parallel tracks where the cross-talk is defined between two intervals assigned to the adjacent tracks with the amount linear to parallel running length. This paper solves the problem for the case when any pair of intervals intersects and the objective is to minimize the sum of cross-talks. We begin the discussion with the fact that twice the sum of lengths of
ER -
English
