This paper presents a method for blind identification of a system whose transfer matrix is non-invertible at infinity, based on independent component analysis. In the proposed scheme, the transfer matrix to be identified is pre-multiplied by an appropriate polynomial matrix, named interactor, in order to compensate the row relative degrees and obtain a biproper system. It is then pre-multiplied by a demixing matrix via an existing approximate method. Both of these matrices are estimated blindly, i.e. with the input signals being unknown. The identified system is thus obtained as the inverse of the multiplication of these matrices.
Sang Wook PARK Fengchao XIAO Dong Chul PARK Yoshio KAMI
We propose a method of crosstalk analysis for two bent transmission lines with vias at both ends on a PCB using a circuit-concept approach in the quasi-static condition. In this condition, the electromagnetic fields can be approximately estimated by the quasi-static terms of the accurate Green's function in an inhomogeneous medium. Thus we obtain a circuit model in an ABCD matrix by taking account of the fields generated by a longitudinal line and a vertical via on a PCB. To verify the proposed approach, we conducted some experiments and compared our approach's results with measured results and a commercial electromagnetic solver's results.
Hyundo PARK Heejo LEE Hyogon KIM
From the introduction of CodeRed and Slammer worms, it has been learned that the early detection of worm epidemics is important in order to reduce the damage resulting from outbreaks. A prominent characteristic of Internet worms is the random selection of subsequent targets. In this paper, we propose a new worm detection mechanism by checking the random distribution of destination addresses in network traffic. The proposed mechanism constructs a matrix from network traffic and checks the rank of the matrix in order to detect the spreading of Internet worms. From the fact that a random binary matrix holds a high rank value, ADUR (Anomaly Detection Using Randomness check) is proposed for detecting unknown worms based on the rank of the matrix. From experiments on various environments, it is demonstrated that the ADUR mechanism effectively detects the spread of new worms in the early stages, even when there is only a single host infected in a monitoring network. Also, we show that ADUR is highly sensitive so that the worm epidemic can be detectable quickly, e.g., three times earlier than the infection of 90% vulnerable hosts.
Due to its importance in engineering applications, the bilinear transformation has been studied in many literature. In this letter two new algorithms are presented to compute transformation matrix for the bilinear s-z transformation.
Akira TANAKA Hideyuki IMAI Masaaki MIYAKOSHI
In D.O.A. estimation, identification of the signal and the noise subspaces plays an essential role. This identification process was traditionally achieved by the eigenvalue decomposition (EVD) of the spatial correlation matrix of observations or the generalized eigenvalue decomposition (GEVD) of the spatial correlation matrix of observations with respect to that of an observation noise. The framework based on the GEVD is not always an extension of that based on the EVD, since the GEVD is not applicable to the noise-free case which can be resolved by the framework based on the EVD. Moreover, they are not applicable to the case in which the spatial correlation matrix of the noise is singular. Recently, a quotient-singular-value-decomposition-based framework, that can be applied to problems with singular noise correlation matrices, is introduced for noise reduction. However, this framework also can not treat the noise-free case. Thus, we do not have a unified framework of the identification of these subspaces. In this paper, we show that a unified framework of the identification of these subspaces is realized by the concept of proper and improper eigenspaces of the spatial correlation matrix of the noise with respect to that of observations.
Kenichi KANATANI Yasuyuki SUGAYA
We compare the convergence performance of different numerical schemes for computing the fundamental matrix from point correspondences over two images. First, we state the problem and the associated KCR lower bound. Then, we describe the algorithms of three well-known methods: FNS, HEIV, and renormalization. We also introduce Gauss-Newton iterations as a new method for fundamental matrix computation. For initial values, we test random choice, least squares, and Taubin's method. Experiments using simulated and real images reveal different characteristics of each method. Overall, FNS exhibits the best convergence properties.
Sang Wook PARK Fengchao XIAO Dong Chul PARK Yoshio KAMI
The crosstalk phenomenon, wich occurs between transmission lines, is caused by electromagnetic fields of currents flowing through the lines. Crosstalk between two bent lines is studied by using a set of solutions of modified telegrapher's equations. By expressing electromagnetic fields in terms of voltages and currents in the line ends, the resultant network function in the form of an ABCD matrix is obtained. Electromagnetic fields caused by currents flowing in risers at transmission line ends are taken into account in addition to those fields in line sections. The validity of the proposed approach was confirmed by comparing experimental results with computed results and those simulated by a commercial electromagnetic solver for some bent-line models.
Ryosuke OZAKI Tsuneki YAMASAKI Takashi HINATA
In this paper, we propose a new technique for the scattering problems of multilayered inhomogeneous columnar dielectric gratings loaded rectangular dielectric constant both TM and TE waves using the combination of improved Fourier series expansion method, the multilayer method, and the eigenvalue matrix method. Numerical results are given for the power transmission coefficients in the parameters ε 3 /ε 0 , c/p, and b/d of rectangular cylinders to obtain the basic characteristic of the power transmission coefficients and reflection coefficients switching or frequency selective devices for both TM and TE waves. The influence of the incident angle and frequency of the transmitted power are also discussed in the connection with the propagation constant β in the free mode.
Daisuke KOSAKA Makoto NAGATA Yoshitaka MURASAKA Atsushi IWATA
Substrate-coupling equivalent circuits can be derived for arbitrary isolation structures by F-matrix computation. The derived netlist represents a unified impedance network among multiple sites on a chip surface as well as internal nodes of isolation structures and can be applied with SPICE simulation to evaluate isolation strengths. Geometry dependency of isolation attributes to layout parameters such as area, width, and location distance. On the other hand, structural dependency arises from vertical impurity concentration specific to p+/n+ diffusion and deep n-well. Simulation-based prototyping of isolation structures can include all these dependences and strongly helps establish an isolation strategy against high-frequency substrate coupling in a given technology. The analysis of isolation strength provided by p+/n+ guard ring, deep n-well guard ring as well as deep n-well pocket well explains S21 measurements performed on high-frequency test structures targeting 5 GHz bandwidth, that was formed in a 0.25-µm CMOS high frequency.
Taiji SASAOKA Hideyuki KAWABATA Toshiaki KITAMURA
Parallel programs for distributed memory machines are not easy to create and maintain, especially when they involve sparse matrix computations. In this paper, we propose a program translation system for generating parallel sparse matrix computation codes utilizing PSBLAS. The purpose of the development of the system is to offer the user a convenient way to construct parallel sparse code based on PSBLAS. The system is build up on the idea of bridging the gap between the easy-to-read program representations and highly-tuned parallel executables based on existing parallel sparse matrix computation libraries. The system accepts a MATLAB program with annotations and generates subroutines for an SPMD-style parallel program which runs on distributed-memory machines. Experimental results on parallel machines show that the prototype of our system can generate fairly efficient PSBLAS codes for simple applications such as CG and Bi-CGSTAB programs.
This paper considers the optimal generator matrices of a given binary cyclic code over a binary symmetric channel with crossover probability p→0 when the goal is to minimize the probability of an information bit error. A given code has many encoder realizations and the information bit error probability is a function of this realization. Our goal here is to seek the optimal realization of encoding functions by taking advantage of the structure of the codes, and to derive the probability of information bit error when possible. We derive some sufficient conditions for a binary cyclic code to have systematic optimal generator matrices under bounded distance decoding and determine many cyclic codes with such properties. We also present some binary cyclic codes whose optimal generator matrices are non-systematic under complete decoding.
Shingo TAKAHASHI Shuji TSUKIYAMA Masanori HASHIMOTO Isao SHIRAKAWA
In the design of an active matrix LCD (Liquid Crystal Display), the ratio of the pixel voltage to the video voltage (RPV) of a pixel is an important factor of the performance of the LCD, since the pixel voltage of each pixel determines its transmitted luminance. Thus, of practical importance is the issue of how to maintain the admissible allowance of RPV of each pixel within a prescribed narrow range. This constraint on RPV is analyzed in terms of circuit parameters associated with the sampling switch and sampling pulse of a column driver in the LCD. With the use of a minimal set of such circuit parameters, a design procedure is described dedicatedly for the sampling switch, which intends to seek an optimal sampling switch as well as an optimal sampling pulse waveform. A number of experimental results show that an optimal sampling switch attained by the proposed procedure yields a source driver with almost 18% less power consumption than the one by manual design. Moreover, the percentage of the RPVs within 1001% among 270 cases of fluctuations is 88.1% for the optimal sampling switch, but 46.7% for the manual design.
Roberto ROJAS-CESSA Zhen GUO Nirwan ANSARI
Combined input-crosspoint buffered (CICB) packet switches have been of research interest in the last few years because of their high performance. These switches provide higher performance than input-buffered (IB) packet switches while requiring the crosspoint buffers run at the same speed as that of the input buffers in IB switches. Recently, it has been shown that CICB switches with one-cell crosspoint buffers, virtual output queues, and simple input and output arbitrations, provide 100% throughput under uniform traffic. However, it is of general interest to know the maximum throughput that a CICB switch, with no speedup, can provide under admissible traffic. This paper analyzes the throughput performance of a CICB switch beyond uniform traffic patterns and shows that a CICB switch with one-cell crosspoint buffers can provide 100% throughput under admissible traffic while using no speedup.
An algorithm for encoding low-density parity check (LDPC) codes is investigated. The algorithm computes parity check symbols by solving a set of sparse equations, and the triangular factorization is employed to solve the equations efficiently. It is shown analytically and experimentally that the proposed algorithm is more efficient than the Richardson's encoding algorithm if the code has a small gap.
Chen ZHENG Noriaki MIYAZAKI Toshinori SUZUKI
Effective and simply realizable rate compatible low-density parity-check (LDPC) codes are proposed. A parity check matrix is constructed with the progressively increased column weights (PICW) order and adopted to achieve a punctured LDPC coding scheme for a wide range of the code rates of the rate compatible systems. Using the proposed rate compatible punctured LDPC codes, low complex adaptive communication systems, such as wireless communication systems, can be achieved with the reliable transmissions.
Chia-Chi CHU Ming-Hong LAI Wu-Shiung FENG
The global Lanczos algorithm for solving the RLCG interconnect circuits is presented in this paper. This algorithm is an extension of the standard Lanczos algorithm for multiple-inputs multiple-outputs (MIMO) systems. A new matrix Krylov subspace will be developed first. By employing the congruence transformation with the matrix Krylov subspace, the two-side oblique projection-based method can be used to construct a reduced-order system. It will be shown that the system moments are still matched. The error of the 2q-th order system moment will be derived analytically. Furthermore, two novel model-order reduction techniques called the multiple point global Lanczos (MPGL) method and the adaptive-order global Lanczos (AOGL) method which are both based on the multiple point moment matching are proposed. The frequency responses using the multiple point moment matching method have higher coherence to the original system than those using the single point expansion method. Finally, simulation results on frequency domain will illustrate the feasibility and the efficiency of the proposed methods.
Efficient group rekeying is an important issue for secure group communications. Most of the proposed group rekeying methods require expensive encryption and decryption operations to rekey the group. However, in a model where a trusted server is used to distribute group keys, the trusted server may become a bottleneck because of the expensive computation operations, such as encryption, that it has to perform. In this paper, we propose a new stateless group rekeying scheme to solve the multicast group rekeying problem. In our proposed scheme, the trusted server combines mask-based key-location hiding with the simple XOR-encryption using secret hash values to rekey the group. Without affecting the system security, our approach reduces the processing cost of the trusted server by eliminating the need to encrypt the group key. Moreover, to acquire the group key, the computational cost of the group members is low and stable regardless of the rekeying message size.
ChoonKi AHN SooHee HAN WookHyun KWON
This letter presents parametric uncertainty bounds (PUBs) for stabilizing receding horizon H∞ control (RHHC). The proposed PUBs are obtained easily by solving convex optimization problems represented by linear matrix inequalities (LMIs). We show, by numerical example, that the RHHC can guarantee a H∞ norm bound for a larger class of uncertain systems than conventional infinite horizon H∞ control (IHHC).
Large sets of matrices with good auto and cross-correlation are rare. We present two such constructions, a method of extending family size by column multiplication and a method of extending physical size by interlacing. These matrices can be applied to digital watermarking of images.
Jiansong GAN Shidong ZHOU Jing WANG Kyung PARK
In this letter, we investigate the sum-rate capacity of a power-controlled multi-user distributed antenna system (DAS) with antennas deployed symmetrically on a circle. The sum-rate capacity, when divided by user number, is proved to converge to an explicit expression as user number and antenna number go to infinity with a constant ratio. We further show how this theoretical result can be used to optimize antenna deployment. Simulation results are also provided to demonstrate the validity of our analysis and the applicability of the asymptotic results to a small-scale system.