In VLSI, crossings occupy space and cause delay. Therefore, there is significant benefit to planar circuits. We propose the use of planar multiple-valued decision diagrams to produce planar multiple-valued circuits. Specifically, we show conditions on 1) threshold functions, 2 symmetric functions, and 3) monodiagrams. Our results apply to binary functions, as well. For example, we show that all...

This paper studies the choosability of signed planar graphs. We prove that every signed planar graph is 5-choosable and that there is a signed planar graph which is not 4-choosable while the unsigned graph is 4-choosable. For each k ∈ {3, 4, 5, 6}, every signed planar graph without circuits of length k is 4-choosable. Furthermore, every signed planar graph without circuits of length 3 and of le...

The spectral-domain method is a very fast and powerful technique to analyze planar microwave circuits. However, available techniques for simulating the excitation of open planar microwave circuits are not very effective at relatively low frequencies. In this paper, new compensation functions are introduced, which correctly model the excitation over the whole microwave frequency region.

Timing Resistive Plate Chambers (RPCs) are planar gaseous detectors made with a combination of metallic and resistive electrodes, delivering time resolutions around 50 ps σ and efficiency up to 99% for MIPs. In this work we describe the development and test of an electrically shielded timing RPC array for crosstalk-free time measurements in high granularity time-of-fight (TOF) systems, as the I...

The P-complete Circuit Value Problem CVP, when restricted to monotone planar circuits MPCVP, is known to be in NC, and for the special case of upward stratified circuits, it is known to be in LogDCFL. In this paper we re-examine the complexity of MPCVP, with special attention to circuits with cylindrical embeddings. We characterize cylindricality, which is stronger than planarity but strictly g...