Results 241 to 250 of about 739,905 (293)

Adhesives in the packaging of planar lightwave circuits

International Journal of Adhesion and Adhesives, 2004
Planar lightwave circuits (PLCs) offer significant performance and cost saving advantages over other optical component technologies. However, the packaging of the PLCs has been a challenging task due to the stringent performance and reliability requirements posed by the telecommunication applications. In this paper, those requirements for the PLC-based
Xiao, George, Zhang, Zhiyi, Grover, C. P.   +2 more
openaire   +2 more sources

Planar Circuits for Microwaves and Lightwaves

1985
exaly   +2 more sources

Test for Planarity of a Circuit Given by an Expression

IEEE Transactions on Electronic Computers, 1966
In this paper a relationship among distinct Pn+1, cycles, distinct stable maximum transient feedback shift registers of order n+1, and stable feedback shift registers of order n will be presented. In the course of the discussion, two algorithms will be introduced.
Shimon Even, Albert R. Meyer
openaire   +1 more source

Ferrite Planar Circuits in Microwave Integrated Circuits

IEEE Transactions on Microwave Theory and Techniques, 1977
The ferrite planar circuit to be discussed in this paper is a general planar circuit using ferrite substrates magnetized perpendicular to the ground conductors. The main subject of this paper is the analysis of an arbitrarily shaped triplate ferrite planar circuit. In particular, the circuit parameters of the equivalent multiport are determined.
T. Miyoshi, S. Yamaguchi, S. Goto
openaire   +1 more source

Optical Planar Circuits

1985
The final two chapters are devoted to the theory of the optical planar circuit which is defined as a circuit having dimensions comparable to the wavelength in one direction but much greater than it in the other two directions. The technical significance of this circuit concept has increased throughout the 1970s because it plays an important role in ...
openaire   +1 more source

The Planar Hamiltonian Circuit Problem is NP-Complete

SIAM Journal on Computing, 1976
We consider the problem of determining whether a planar, cubic, triply-connected graph G has a Hamiltonian circuit. We show that this problem is NP-complete. Hence the Hamiltonian circuit problem for this class of graphs, or any larger class containing all such graphs, is probably computationally intractable.
M. R. Garey, David S. Johnson 0001, Robert Endre Tarjan   +2 more
openaire   +3 more sources

Optical Multiplexr for Planar Lightwave Circuits

2018 Photonics in Switching and Computing (PSC), 2018
An all optical multiplexer consists of a monolithic tri-wavelength LED integrated with flexible optical interconnect for chip to chip multiplexing is proposed. The LED is selectively intermixed to launch three independently controlled wavelengths into a single SU8 flexible optical interconnect.
openaire   +2 more sources

Planar circuits have short specifications

2005
A counting argument is used to establish a lower bound of Ω(2n) on the planar circuit size of almost all n-argument Boolean functions. The counting argument exploits the fact that planar circuits can be more concisely specified than general circuits.
openaire   +2 more sources

Preliminary Experimental Study of the Performances for a Print Circuit Board Based Planar PEMFC Stack

International Journal of Hydrogen Energy, 2022
Xiongwen Zhang, Xiaoteng Min, Dan Chai
exaly  

Planar Circuits, Waveguide Models, and Segmentation Method

IEEE Transactions on Microwave Theory and Techniques, 1985
R Sorrentino
exaly