Photo-Diode Array Partitioning Problem for a Rectangular Region

Kunihiro FUJIYOSHI; Takahisa IMANO

doi:10.1587/transfun.E100.A.2851

Photo-Diode Array Partitioning Problem for a Rectangular Region

Kunihiro FUJIYOSHI, Takahisa IMANO

Full Text Views

0

Share
Cite this

Summary :

Photo Diode Array (PDA) is the key semiconductor component expected to produce specified output voltage in photo couplers and photo sensors when the light is on. PDA partitioning problem, which is to design PDA, is: Given die area, anode and cathode points, divide the area into N cells, with identical areas, connected in series from anode to cathode. In this paper, we first make restrictions for the problem and reveal the underlying properties of necessary and sufficient conditions for the existence of solutions when the restrictions are satisfied. Then, we propose a method to solve the problem using recursive algorithm, which can be guaranteed to obtain a solution in polynomial time.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.12 pp.2851-2856

Publication Date: 2017/12/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E100.A.2851

Type of Manuscript: Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)

Category

Authors

Kunihiro FUJIYOSHI
the Tokyo University of Agriculture and Technology
Takahisa IMANO
the Tokyo University of Agriculture and Technology

Keyword

partitioning, photo diode array, Hamiltonian path, divide and conquer

Cite this

Copy

Kunihiro FUJIYOSHI, Takahisa IMANO, "Photo-Diode Array Partitioning Problem for a Rectangular Region" in IEICE TRANSACTIONS on Fundamentals, vol. E100-A, no. 12, pp. 2851-2856, December 2017, doi: 10.1587/transfun.E100.A.2851.
Abstract: Photo Diode Array (PDA) is the key semiconductor component expected to produce specified output voltage in photo couplers and photo sensors when the light is on. PDA partitioning problem, which is to design PDA, is: Given die area, anode and cathode points, divide the area into N cells, with identical areas, connected in series from anode to cathode. In this paper, we first make restrictions for the problem and reveal the underlying properties of necessary and sufficient conditions for the existence of solutions when the restrictions are satisfied. Then, we propose a method to solve the problem using recursive algorithm, which can be guaranteed to obtain a solution in polynomial time.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.2851/_p

Copy

@ARTICLE{e100-a_12_2851,
author={Kunihiro FUJIYOSHI, Takahisa IMANO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Photo-Diode Array Partitioning Problem for a Rectangular Region},
year={2017},
volume={E100-A},
number={12},
pages={2851-2856},
abstract={Photo Diode Array (PDA) is the key semiconductor component expected to produce specified output voltage in photo couplers and photo sensors when the light is on. PDA partitioning problem, which is to design PDA, is: Given die area, anode and cathode points, divide the area into N cells, with identical areas, connected in series from anode to cathode. In this paper, we first make restrictions for the problem and reveal the underlying properties of necessary and sufficient conditions for the existence of solutions when the restrictions are satisfied. Then, we propose a method to solve the problem using recursive algorithm, which can be guaranteed to obtain a solution in polynomial time.},
keywords={},
doi={10.1587/transfun.E100.A.2851},
ISSN={1745-1337},
month={December},}

Copy

TY - JOUR
TI - Photo-Diode Array Partitioning Problem for a Rectangular Region
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2851
EP - 2856
AU - Kunihiro FUJIYOSHI
AU - Takahisa IMANO
PY - 2017
DO - 10.1587/transfun.E100.A.2851
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2017
AB - Photo Diode Array (PDA) is the key semiconductor component expected to produce specified output voltage in photo couplers and photo sensors when the light is on. PDA partitioning problem, which is to design PDA, is: Given die area, anode and cathode points, divide the area into N cells, with identical areas, connected in series from anode to cathode. In this paper, we first make restrictions for the problem and reveal the underlying properties of necessary and sufficient conditions for the existence of solutions when the restrictions are satisfied. Then, we propose a method to solve the problem using recursive algorithm, which can be guaranteed to obtain a solution in polynomial time.
ER -