We investigate binary sequence pairs with two-level correlation in terms of their corresponding cyclic difference pairs (CDPs). We define multipliers of a cyclic difference pair and present an existence theorem for multipliers, which could be applied to check the existence/nonexistence of certain hypothetical cyclic difference pairs. Then, we focus on the ideal case where all the out-of-phase correlation coefficients are zero. It is known that such an ideal binary sequence pair exists for length υ = 4u for every u ≥ 1. Using the techniques developed here on the theory of multipliers of a CDP and some exhaustive search, we are able to determine that, for lengths υ ≤ 30, (1) there does not exist "any other" ideal/ binary sequence pair and (2) every example in this range is equivalent to the one of length υ = 4u above. We conjecture that if there is a binary sequence pair with an ideal two-level correlation then its in-phase correlation must be 4. This implies so called the circulant Hadamard matrix conjecture.
Suk Tae SEO In Keun LEE Seo Ho SON Hyong Gun LEE Soon Hak KWON
We propose a simple but effective image segmentation method not based on thresholding but on a merging strategy by evaluating joint probability of gray levels on co-occurrence matrix. The effectiveness of the proposed method is shown through a segmentation experiment.
A hot clutter mitigation algorithm based on Subbanding and Space Fast-time Adaptive Processing (Fast-time STAP) for Multi-channel Synthetic Aperture Radar (MSAR) is analyzed, and is compared with the method based on just fast-time STAP. Simulation results demonstrate that the method based on subbanding and fast-time STAP performs better than the method based on just fast-time STAP in hot clutter mitigation for MSAR.
Joontae KIM Seung-Ri JIN Dong-Jo PARK
A novel method is proposed that can estimate the tag population in Radio Frequency Identification (RFID) systems by using a Hadamard code for the tag response. We formulate the maximum likelihood estimator for the tag population using the number of observed footprints. The lookup table of the estimation algorithm has low complexity. Simulation results show that the proposed estimator performs considerably better than the conventional schemes.
The robust reduced order observer for a class of discrete-time Lipschitz nonlinear systems with external disturbance is proposed. It is shown that the proposed observer design can suppress the effect on the estimation error of external disturbance up to the prescribed level. Also, linear matrix inequalities are used to represent sufficient conditions on the existence of the proposed observer. Moreover, the maximum admissible Lipschitz constant of the proposed design is obtained for a given disturbance attenuation level. Finally, an illustrative example is given to verify the effectiveness of the proposed design.
The linear Piece In Hand (PH, for short) matrix method with random variables was proposed in our former work. It is a general prescription which can be applicable to any type of multivariate public-key cryptosystems for the purpose of enhancing their security. Actually, we showed, in an experimental manner, that the linear PH matrix method with random variables can certainly enhance the security of HFE against the Grobner basis attack, where HFE is one of the major variants of multivariate public-key cryptosystems. In 1998 Patarin, Goubin, and Courtois introduced the plus method as a general prescription which aims to enhance the security of any given MPKC, just like the linear PH matrix method with random variables. In this paper we prove the equivalence between the plus method and the primitive linear PH matrix method, which is introduced by our previous work to explain the notion of the PH matrix method in general in an illustrative manner and not for a practical use to enhance the security of any given MPKC. Based on this equivalence, we show that the linear PH matrix method with random variables has the substantial advantage over the plus method with respect to the security enhancement. In the linear PH matrix method with random variables, the three matrices, including the PH matrix, play a central role in the secret-key and public-key. In this paper, we clarify how to generate these matrices and thus present two probabilistic polynomial-time algorithms to generate these matrices. In particular, the second one has a concise form, and is obtained as a byproduct of the proof of the equivalence between the plus method and the primitive linear PH matrix method.
Yeong-Chul CHUNG Kyung-Won LEE Ic-Pyo HONG Kyung-Hyun OH Jong-Gwan YOOK
In this letter, a new CCM material, adding Ni powder to a conventional CCM, for X-band applications is designed and analyzed to improve the SE. To obtain the SE of the fabricated CCM accurately, material constants of the CCM of the permittivity and permeability were extracted using transmission/reflection measurements. Using the material constants derived from the measurement, the SE was calculated and the results were verified using a commercial full-wave three-dimensional electromagnetic wave simulator. The SE of the proposed the CCM was improved by approximately 4 dB in the X band compared to that of a conventional CCM. The CCM proposed in this paper can be applied as a shielding material as well as for housing of various communication systems and electrical instruments.
Lei WANG Baoyu ZHENG Qingmin MENG Chao CHEN
Free probability theory, which has become a main branch of random matrix theory, is a valuable tool for describing the asymptotic behavior of multiple systems, especially for large matrices. In this paper, using asymptotic free probability theory, a new cooperative scheme for spectrum sensing is proposed, which shows how the asymptotic free behavior of random matrices and the property of Wishart distribution can be used to assist spectrum sensing for cognitive radio. Simulations over Rayleigh fading and AWGN channels demonstrate the proposed scheme has better detection performance than the energy detection techniques and the Maximum-minimum eigenvalue (MME) scheme even for the case of a small sample of observations.
Kai-Jie ZHENG Ji-Gen PENG Ke-Xue LI
Graph matching is a NP-Hard problem. In this paper, we relax the admissible set of permutation matrices and meantime incorporate a barrier function into the objective function. The resulted model is equivalent to the original model. Alternate iteration algorithm is designed to solve it. It is proven that the algorithm proposed is locally convergent. Our experimental results reveal that the proposed algorithm outperforms the algorithm in .
Xuan ZHANG Qiaoyan WEN Jie ZHANG
In this paper, we propose four new general constructions of LCZ/ZCZ sequence sets based on interleaving technique and affine transformations. A larger family of LCZ/ZCZ sequence sets with longer period are generated by these constructions, which are more flexible among the selection of the alphabet size, the period of the sequences and the length of LCZ/ZCZ, compared with those generated by the known constructions. Especially, two families of the newly constructed sequences can achieve or almost achieve the theoretic bound.
Ching-Lin FAN Yu-Sheng LIN Yan-Wei LIU
A new pixel design and driving method for active matrix organic light emitting diode (AMOLED) displays that use low-temperature polycrystalline silicon thin-film transistors (LTPS-TFTs) with a voltage programming method are proposed and verified using the SPICE simulator. We had employed an appropriate TFT model in SPICE simulation to demonstrate the performance of the pixel circuit. The OLED anode voltage variation error rates are below 0.35% under driving TFT threshold voltage deviation (Δ Vth = 0.33 V). The OLED current non-uniformity caused by the OLED threshold voltage degradation (Δ VTO = +0.33 V) is significantly reduced (below 6%). The simulation results show that the pixel design can improve the display image non-uniformity by compensating for the threshold voltage deviation in the driving TFT and the OLED threshold voltage degradation at the same time.
In this paper, we propose a novel target acoustic signal detection approach which is based on non-negative matrix factorization (NMF). Target basis vectors are trained from the target signal database through NMF, and input vectors are projected onto the subspace spanned by these target basis vectors. By analyzing the distribution of time-varying normalized projection error, the optimal threshold can be calculated to detect the target signal intervals during the entire input signal. Experimental results show that the proposed algorithm can detect the target signal successfully under various signal environments.
Lei WANG Baoyu ZHENG Qingmin MENG Chao CHEN
Based on Free Probability Theory (FPT), which has become an important branch of Random Matrix Theory (RMT), a new scheme of frequency band sensing for Cognitive Radio (CR) in Direct-Sequence Code-Division Multiple-Access (DS-CDMA) multiuser network is proposed. Unlike previous studies in the field, the new scheme does not require the knowledge of the spreading sequences of users and is related to the behavior of the asymptotic free behavior of random matrices. Simulation results show that the asymptotic claims hold true even for a small number of observations (which makes it convenient for time-varying topologies) outperforming classical energy detection scheme and another scheme based on random matrix theory.
Koki WATANABE Yoshimasa NAKATAKE
The Fourier series expansion method is a useful tool to approach the problems of discontinuities in optical waveguides, and it can apply to analyze the Floquet-modes of photonic crystal waveguides. However, it has known that the Floquet-mode calculation with large truncation order is limited because of the roundoff errors. This paper proposes a novel formulation of the Floquet-modes propagating in two-dimensional photonic crystal waveguides formed by circular cylinders. We introduce a periodic boundary condition as same with the conventional method, and the fields are expressed in the Fourier series expansions. The present formulation also introduces the cylindrical-wave expansions and uses the recursive transition-matrix algorithm, which is used to analyze the scattering from cylinder array. This makes us possible to obtain very high accuracy without the use of large truncation order for Fourier series expansion. The presented formulation is validated by numerical experiments.
Cong-Nguyen BUI Hae-Yeoun LEE Jeong-Chun JOO Heung-Kyu LEE
A secure method for steganography is proposed. Pixel-value differencing (PVD) steganography and bit-plane complexity segmentation (BPCS) steganography have the weakness of generating blocky effects and noise in smooth areas and being detectable with steganalysis. To overcome these weaknesses, a secure bit-plane based steganography method on the spatial domain is presented, which uses a robust measure to select noisy blocks for embedding messages. A matrix embedding technique is also applied to reduce the change of cover images. Given that the statistical property of cover images is well preserved in stego-images, the proposed method is undetectable by steganalysis that uses RS analysis or histogram-based analysis. The proposed method is compared with the PVD and BPCS steganography methods. Experimental results confirm that the proposed method is secure against potential attacks.
Factorization of Hadamard matrices can provide fast algorithm and facilitate efficient hardware realization. In this letter, constructions of factorizable multilevel Hadamard matrices, which can be considered as special case of unitary matrices, are inverstigated. In particular, a class of ternary Hadamard matrices, together with its application, is presented.
A new deadbeat control scheme for linear systems with input constraints is presented. Input constraints exist in most control systems, but in conventional dead-beat control, logical strategy to handle it has not been studied enough. The proposed controller in this paper adjusts the number of steps for dead-beat tracking on-line, in order to achieve delayed deadbeat-tracking performance and satisfy any admissible input constraint. Increasing the number of steps for dead-beat tracking and formulating the corresponding degree of freedom into null-space vectors make it possible to obtain delayed dead-beat tracking, and minimize the inevitable delay, respectively. LMI feasibility problems are solved to numerically obtain the solution and minimize the unavoidable step-delay. As a result, calculation effort is reduced compared to LMI-optimization problem. The proposed schemes can be readily numerically implemented. Its practical usefulness is validated by simulation for 6-axis robot model and experimental results for DC-motor servoing.
Suhaila MOHD. SANIP Ahmad Fauzi ISMAIL Madzlan AZIZ Tetsuo SOGA
Carbon nanotubes (CNTs) have generated great interest within the many areas of nanotechnology due to their superior and outstanding physical properties. However effective dispersion in many solvents has imposed limitations upon the use of CNTs in a number of novel applications. Functionalization presents a solution for CNTs to be more soluble which make them integrate well into any organic, inorganic or biological systems. CNTs can be easily functionalized using cyclodextrin (CD) treatment. The CD modification of carbon nanotubes is both simple and effective. It requires no prolonged heating, filtration and washing which can severely damage the small diameter nanotubes. The formation of surface functional groups and changes of nanotubes structures of functionalized carbon nanotubes (f-CNTs) were monitored by Fourier transform infrared spectroscopy (FTIR), Thermo gravimetric analysis (TGA) and field emission scanning electron microscopy (FESEM), respectively. From the TGA results, the amount of weight loss of the f-CNTs in varying ratios indicated the amount of CD that was functionalized. It was also noted that the FTIR spectra showed the presence of functional groups associated with CD in the f-CNTs. As a result, the cyclodextrin groups were found to be possibly adsorbed at the surface of the nanotubes walls. The f-CNTs showed substantial solubility in N-methyl-2-pyrrolidone (NMP) which helps in a better distribution of the CNTs in the mixed matrix membrane (MMM) prepared. Hence, the influence of the f-CNTs in the polymer matrix will give rise to enhanced physical properties of the MMM suitable for applications in gas separations.
Hiroyuki GOTO Hirotaka TAKAHASHI
This research proposes efficient calculation methods for the transition matrices in discrete event systems, where the adjacency matrices are represented by directed acyclic graphs. The essence of the research focuses on obtaining the Kleene Star of an adjacency matrix. Previous studies have proposed methods for calculating the longest paths focusing on destination nodes. However, in these methods the chosen algorithm depends on whether the adjacency matrix is sparse or dense. In contrast, this research calculates the longest paths focusing on source nodes. The proposed methods are more efficient than the previous ones, and are attractive in that the efficiency is not affected by the density of the adjacency matrix.
Manabu HAGIWARA Marc P.C. FOSSORIER Takashi KITAGAWA Hideki IMAI
In this paper, we investigate the smallest value of p for which a (J,L,p)-QC LDPC code with girth 6 exists for J=3 and J=4. For J=3, we determine the smallest value of p for any L. For J=4, we determine the smallest value of p for L ≤ 301. Furthermore we provide examples of specific constructions meeting these smallest values of p.