In this letter, we describe a four thin-film-transistor (TFT) pixel circuit based on hydrogenated amorphous silicon (a-Si:H) technology for the active-matrix organic light-emitting diode (AMOLED) display applications. The circuit uses current-writing mechanism and can automatically adjust the threshold-voltage shifts of both the organic light-emitting diodes (OLEDs) and the TFTs induced by the circuit aging or process variations. Experimental results indicate virtually no variation of the output driving current after long-term bias-temperature-stress (BTS).

This paper discusses factorization of bent function type complex Hadamard matrices of order pn with a prime p. It is shown that any bent function type complex Hadamard matrix has symmetrical factorization, which can be expressed by the product of n matrices of order pn with pn+1 non-zero elements, a matrix of order pn with pn non-zero ones, and the n matrices, at most. As its application, a correlator for M-ary spread spectrum communications is successfully given, which can be simply constructed by the same circuits with reduced multiplicators, before and behind.

The Matrix-Pencil (MP) method is applied to the estimation of the undesired radiation from the microstrip line discontinuities. The Q factors are obtained from the complex resonant frequencies estimated from FDTD transient field by using MP. The number of the damped oscillations is estimated by using MDL which is widely used as an information theoretic criterion for the model order estimation.

In general, when many functions and services are added to a system, verification and validation become difficult. In design and development in telecommunication services, conflicts that arise from combined telecommunication services have been discussed from various viewpoints. However, correctly and efficiently detecting all conflicts is still not possible and the resolution of conflicts primarily depends on expert designers, who are finding that these problems are beyond their ability. Thus, the burden on the designer must also be alleviated at the design stage. Service interference, which is discussed in this paper, is a kind of conflict. A problem of service interference is that during service, other services interfere with the ongoing service behavior. That is to say, a strange state arises, or an input event doesn't work, or a strange transition occurs, etc. The detection of service interference by only comparing states among services is not enough since the state transition must be considered in the service interference. This paper proposes how to automatically detect the service interference with a rule-based system and an extended adjacency matrix. The proposed method uses and combines features of both the adjacency matrix and rule-based system. The method first generates the extended adjacency matrix by the rule application, then extracts sequences of the state, the event, and the rule applications, and then detects the service interference with the extracted sequences.

This paper presents the generator polynomial matrices and the upper bound on the constraint length of punctured convolutional codes (PCCs), respectively. By virtue of these properties, we provide the puncturing realizations of the good known nonsystematic and systematic high rate CCs.

The onboard antenna beam forming network (BFN) of the next-generation communication satellites must offer multiple beam forming and beam steering. The conventional BFN, which directly controls the array elements, is not suitable for a large-scale array antenna because of the difficulty of BFN control. This paper proposes a new BFN configuration that consists of three/four-way variable power dividers and a Butler matrix (FFT circuit). This BFN can offer continuous beam steering with fewer variable components. By introducing new techniques based upon excluding FFT periods and power evaluations by definite integration, the deviation in beamwidth is reduced by 75% or more and the maximum sidelobe level is improved by 10 dB or more.

This paper discusses the classification of targets buried in the underground by radar polarimetry. The subsurface radar is used for the detection of objects buried beneath the ground surface, such as gas pipes, cables and cavities, or in archeological exploration operation. In addition to target echo, the subsurface radar receives various other echoes, because the underground is inhomogeneous medium. Therefore, the subsurface radar needs to distinguish these echoes. In order to enhance the discrimination capability, we first applied the polarization anisotropy coefficient to distinguish echoes from isotropic targets (plate, sphere) versus anisotropic targets (wire, pipe). It is straightforward to find the man-made target buried in the underground using the polarization anisotropy coefficient. Second, we tried to classify targets using the polarimetric signature approach, in which the characteristic polarization state provides the orientation angle of an anisotropic target. All of these values contribute to the classification of a target. Field experiments using an ultra-wideband (250 MHz to 1 GHz) FM-CW polarimetric radar system were carried out to show the usefulness of radar polarimetry. In this paper, several detection and classification results are demonstrated. It is shown that these techniques improve the detection capability of buried target considerably.

This paper presents an efficient algorithm to compute the characteristic polynomial of a polynomial matrix. We impose the following condition on given polynomial matrix M. Let M0 be the constant part of M, i. e. M0 M ( mod (y,,z)), where y,,z are indeterminates in M. Then, all eigenvalues of M0 must be distinct. In this case, the minimal polynomial of M and the characteristic polynomial of M agree, i. e. the characteristic polynomial f(x,y,,z) | x E M | is the minimal degree (w. r. t. x) polynomial satisfying f(M,y,,z) 0. We use this fact to compute f(x,y,,z). More concretely, we determine the coefficients of f(x,y,,z) little by little with basic matrix operations, which makes the algorithm quite efficient. Numerical experiments are given to compare the algorithm with conventional ones.

A compact new test structure using shift register circuits for extracting components of the capacitance matrix of the multi-layer interconnections has been proposed. An extraction method of the capacitance matrix is also presented. As a result of fabrication, capacitance values obtained by measurement are in good agreement with the numerical calculation. We also showed an estimation method of the measurement errors.

State of the arts on guided-wave optical switch arrays are reviewed. In this paper, electro-optic Ti:LiNbO3 devices are mainly described in comparison with crosspoint switch element structures and switch array architectures. Packaging technologies and stability problems are discussed for practical system applications. Recent development on other materials such as semiconductor waveguides, thermo-optic glass/polymer waveguides are also reviewed briefly.

A large scale optical switch array based on guided-wave technology using banyan network architecture is demonstrated. Banyan network architecture is the simplest NN network connecting a input port to all the output ports. A banyan network optical switch array serves as a base for constructing many classes of switch networks, as we propose in this report. We fabricated a 3232 switch and measured its characteristics. Drive voltage was about 12 V and extinction ratio was 18 dB, and the average insertion loss was 18 dB. Preliminary experiments were conducted on a 6464 device. The use of proton exchanged waveguides makes a 10 mm radius of curvature feasible.

By adopting a network architecture in which not only a calling but also a called terminal can select a wavelength, a novel WDM network becomes possible. This we call Wavelength Assignment Photonic Network (WAPN). In this network wavelengths are a kind of network resources and according to requests from terminals, wavelengths are allocated or assigned to calls. In the system a wavelength used for a call is to be used for another call after the call is terminated. By supplying wavelengths to the home, a bitrate-free, protocol free or even transmission method free network can be realized. In this paper, from a viewpoint of S/N or Q factor, WAPN is evaluated with special focus on the node architecture--i. e. , from the viewpoint of node size, number of switching stages, crosstalk level,and losses, because the allowable node size is the crucial issue to decide the whole network capacity. After brief explanations of this proposed system, the model for system evaluations will be established and a node system is to be evaluated for some practical parameter values considering especially traffic characteristics of a node. As a result of this study a node system with capacity more than 100 thousands erl (about 20 Tbps throughput) can be constructed using present available technologies, which will enable us to construct large WAPN network with radius of 2,000 km and subscribers of about 50 millions.

A large scale optical switch array based on guided-wave technology using banyan network architecture is demonstrated. Banyan network architecture is the simplest NN network connecting a input port to all the output ports. A banyan network optical switch array serves as a base for constructing many classes of switch networks, as we propose in this report. We fabricated a 3232 switch and measured its characteristics. Drive voltage was about 12 V and extinction ratio was 18 dB, and the average insertion loss was 18 dB. Preliminary experiments were conducted on a 6464 device. The use of proton exchanged waveguides makes a 10 mm radius of curvature feasible.

State of the arts on guided-wave optical switch arrays are reviewed. In this paper, electro-optic Ti:LiNbO3 devices are mainly described in comparison with crosspoint switch element structures and switch array architectures. Packaging technologies and stability problems are discussed for practical system applications. Recent development on other materials such as semiconductor waveguides, thermo-optic glass/polymer waveguides are also reviewed briefly.

By adopting a network architecture in which not only a calling but also a called terminal can select a wavelength, a novel WDM network becomes possible. This we call Wavelength Assignment Photonic Network (WAPN). In this network wavelengths are a kind of network resources and according to requests from terminals, wavelengths are allocated or assigned to calls. In the system a wavelength used for a call is to be used for another call after the call is terminated. By supplying wavelengths to the home, a bitrate-free, protocol free or even transmission method free network can be realized. In this paper, from a viewpoint of S/N or Q factor, WAPN is evaluated with special focus on the node architecture--i. e. , from the viewpoint of node size, number of switching stages, crosstalk level,and losses, because the allowable node size is the crucial issue to decide the whole network capacity. After brief explanations of this proposed system, the model for system evaluations will be established and a node system is to be evaluated for some practical parameter values considering especially traffic characteristics of a node. As a result of this study a node system with capacity more than 100 thousands erl (about 20 Tbps throughput) can be constructed using present available technologies, which will enable us to construct large WAPN network with radius of 2,000 km and subscribers of about 50 millions.

This paper proposes two numerical methods to solve the optimal problem of contrast enhancement in the cross-pol and co-pol channels. For the cross-pol channel case, the contrast (power ratio) is expressed in a homogeneous form, which leads the polarimetric contrast optimization to a distinctive eigenvalue problem. For the co-pol channel case, this paper proposes a cross iterative method for optimization, based on the formula used in the matched-pol channel. Both these numerical methods can be proved as convergent algorithms, and they are effective for obtaining the optimum polarization state. Besides, one of the proposed methods is applied to solve the optimal problem of contrast enhancement for the time-independent targets case. To verify the proposed methods, this paper provides two numerical examples. The results of calculation are completely identical with other authors', showing the validity of the proposed methods.

A factorization, which provides a factored form, is an extremely important part of multi-level logic synthesis. The number of literals in a factored form is a good estimate of the complexity of a logic function, and can be translated directly into the number of transistors required for implementation. Factored forms are described as either algebraic or Boolean, according to the trade-off between run-time and optimization. A Boolean factored form contains fewer number of literals than an algebraic factored form. In this paper, we present a new method for a Boolean factorization. The key idea is to build an extended Boolean matrix using cokernel/kernel pairs and kernel/kernel pairs together. The extended Boolean matrix makes it possible to yield a Boolean factored form. We also propose a heuristic method for covering of the extended Boolean matrix. Experimental results on various benchmark circuits show the improvements in literal counts over the algebraic factorization based on Brayton's Boolean matrix.

In this paper, an algorithm for Boolean factoring is presented. The algorithm is based on a technique of rectangle covering. A distinctive feature of the algorithm is that no minimization step is required to achieve Boolean factoring. The method for computing Boolean products rests on the concepts of super-product, extended kernel and extended co-kernel-cube matrix. Results of a comparison with the algorithms GOOD_FACTOR and QUICK_FACTOR implemented in SIS are presented. SIS is a program for logic synthesis developed at the University of Berkeley. All performed tests indicate that the proposed algorithm realizes a good tradeoff between factoring quality and computing time.

One-dimensional Cellular Automata (CA's) are considered as potential pseudorandom pattern generators to generate highly random parallel patterns with simple hardware configurations. A class of linear, binary, and of nearest neighbor (radius = 1) CA's is referred to here as elementary ones. This paper investigates operations of such CA's with fixed boundary conditions when non-null boundary values are applied to them. By modifying transition matrices of elementary CA's to include the influence of boundary values, structures of state transition diagrams are determined.

Huynen has already provided a method to decompose a Mueller matrix in order to retrieve detailed target information in a polarimetric radar system. However, this decomposition sometimes fails in the presence of small error or noise in the elements of a Mueller matrix. This paper attempts to improve Huynen's decomposition method. First, we give the definition of stable decomposition and present an example, showing a problem of Huynen's approach. Then two methods are proposed to carry out stable decompositions, based on the nonlinear least square method and the Newton's method. Stability means the decomposition is not sensitive to noise. The proposed methods overcomes the problems on the unstable decomposition of Mueller matrix, and provides correct information of a target.