In this letter we first introduce a new generalized cyclotomic sequence of order four with respect to pq, then we calculate the linear complexity and minimal polynomial of this sequence. Our results show that the new binary sequence is quite good from the linear complexity viewpoint.

In this letter, a method to construct good binary and quaternary error correcting codes, called complex Hadamard codes, based on a complex Hadamard matrix is presented. The related properties of the codes are analyzed. In addition, through the operation in Z4 domain, a new simplex soft-decision decoding algorithm for the complex Hadamard codes is also proposed.

We discuss a typical profile of the k-error linear complexity for balanced binary exponent periodic sequences and the number of periodic distinct sequences by their profiles. A numerical example with period 16 is also shown.

A low-complexity step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri-Hocquenghem (BCH) codes is proposed. Using logical analysis, we obtained a simple rule which can directly determine whether a bit in the received word is correct. The computational complexity of this decoder is less than the conventional step-by-step decoding algorithm, since it reduces at least half of the matrix computations and the most complex element in the conventional step-by-step decoder is the "matrix-computing" element.

In this letter, we discuss the measurement error due to the exclusion of the higher modes when a waveguide with a flange is inserted with lossy dielectric material. The reflection coefficient is calculated by a spectrum-domain approach (SDA), which uses only the dominant (TE10) mode to realize a simplified nondestructive measurement of complex permittivity of lossy dielectric sheets. The analysis shows that the error due to the exclusion of the higher modes decreases as complex permittivity increases. Consequently, we have confirmed that a simplified measurement of complex permittivity is possible by a coverage limitation with the SDA, which excludes the higher modes.

We regard the events of a Markov decision process as the outputs from a Markov information source in order to analyze the randomness of an empirical sequence by the codeword length of the sequence. The randomness is an important viewpoint in reinforcement learning since the learning is to eliminate the randomness and to find an optimal policy. The occurrence of optimal empirical sequence also depends on the randomness. We then introduce the Lempel-Ziv coding for measuring the randomness which consists of the domain size and the stochastic complexity. In experimental results, we confirm that the learning and the occurrence of optimal empirical sequence depend on the randomness and show the fact that in early stages the randomness is mainly characterized by the domain size and as the number of time steps increases the randomness depends greatly on the complexity of Markov decision processes.

We propose a practical blind channel identification algorithm based on the principal component analysis. The algorithm estimates (1) the channel order, (2) the noise variance, and then identifies (3) the channel impulse response, from the autocorrelation of the channel output signal without using the eigenvalue and singular-value decomposition. The special features of the proposed algorithm are (1) practical method to find the channel order and (2) reduction of computational complexity. Numerical examples show the effectiveness of the proposed algorithm.

Organic field-effect transistors (FETs) which employ (BEDT-TTF)(TCNQ) films for active layer have been fabricated and characterized. Their FET characteristics exhibited both p-channel and n-channel operation by changing the gate and drain voltages. For a particular bias condition, the I-V curves revealed behavior where both electrons and holes simultaneously are injected from source and drain electrodes. These bipolar type characteristics are strongly related to the structure of donor and acceptor molecular layers. The degree of charge transfer of approximately 0.2 was estimated by Raman spectroscopy.

In this paper, we present a new numerical method for the complex approximation of FIR digital filters. Our objective is to design FIR filters with equiripple magnitude and phase errors. The proposed method solves the least squares (LS) problem iteratively. At each iteration, the desired response is updated so as to have an equiripple error. The proposed methods do not require any time-consuming optimization procedure such as the quasi-Newton methods and converge to equiripple solutions quickly. We show some examples to illustrate the advantages of our proposed methods.

Propagation modeling and advanced channel characterization techniques represent integral parts of significant impact in advancing progress in enabling next generation wireless communication technology and realizing its much anticipated broader application and economic benefits. In this paper we describe advances in developing computationally efficient ray-tracing channel modeling procedures, and also describe recent results in characterizing challenging propagation environments including transmission through windows and propagation through walls of complex structures. The impact of these realistic propagation environments as well as the antenna mutual coupling effects on the estimation of channel capacity in a MIMO-based communication system is also evaluated. Significant difference between realistic and statistical channel models are identified and quantified for the special cases of the channels modeled in this study.

Scattering of the two dimensional electromagnetic waves is studied by the infinite sequences of zeros arising on the complex plane, which just correspond to the null points of the far field pattern given as a function of the azimuthal angle θ. The convergent sequences of zeros around the point of infinity are evaluated when the scattering objects are assumed to be N-polygonal cylinders. Every edge condition can be satisfied if the locations of zeros are determined appropriately. The parameters, which allow us to calculate the exact positions of zeros, are given by the asymptotic analysis. It is also shown that there are N-directions of convergence, which tend to infinity. An illustrative example is presented.

The AMR wideband speech codec was recently developed for high-quality wideband speech communications. Although it has an excellent performance due to expanded bandwidth of speech signal, it requires a huge amount of computation especially in codebook search. To solve this problem, this paper proposes an efficient codebook search method for AMR wideband codec. Starting from a poorly performing initial codevector, the proposed method enhances the performance of the codevector iteratively by exchanging the worst pulse in the codevector with a better one after evaluating the role of each pulse. Simulations show that the AMR wideband codec adopting the proposed codebook search method provides better performance with much less computational load than that using the standard method.

In this article, it is shown that Unified Complex Hadamard Transform (UCHT) can be derived from Walsh functions and through direct matrix operation. Unique properties of UCHT are analyzed. Recursive relations through Kronecker product can be applied to the basic matrices to obtain higher dimensions. These relations are the basis for the flow diagram of a constant-geometry iterative VLSI hardware architecture. New Normalized Complex Hadamard Transform (NCHT) matrices are introduced which are another class of complex Hadamard matrices. Relations of UCHT and NCHT with other discrete transforms are discussed.

Graph data in large scientific/engineering applications are often too massive to fit inside the computer's main memory. The resulting input/output (I/O) costs could be a major performance bottleneck. This paper proposes an extension to extant multilevel graph partitioning algorithms with improved I/O-efficiency. The input graph is envisioned as the union of disjoint blocks (subgraphs) of almost the same size. Each block is coarsened in turn. Recursive matching and contraction are the operations in this phase. All the coarsened blocks are then merged in an iterative manner in order to ensure that the resulting graph fits in the main memory. This graph is then treated with an in-core multilevel graph partitioning algorithm in the usual way. Our experimental results show that the larger graph size is, the more dependent on the I/O-efficiency the performance is. And our modification can easily partition very large graphs. It also exhibits considerable improvement in I/O-complexity.

We consider a blind estimation of the vector channel for systems with receive diversity. The objective of this paper is to reduce the complexity of the conventional subspace-based method in vector channel estimation. A reduced-complexity estimation scheme is proposed, which is based on selecting a column of the covariance matrix of the received signal vectors. The complexity and performance of the proposed scheme is investigated via computer simulations.

This paper describes a 2.4-GHz downconverter that runs on a 1-V supply. The downconverter integrates an LNA, a quadrature mixer, a complex channel-select band-pass filter (BPF), a limiting amplifier, and a frequency doubler using 0.2-µm CMOS/SOI technology. The frequency doubler doubles the frequency deviation of FM signals as well as the frequency itself, which in turn doubles the modulation index. This improves the sensitivity of FM demodulation. The power consumption of the downconverter is 23 mW with a 1-V power supply. A bit-error-rate (BER) measurement using the downconverter and a demodulation IC shows -76.5-dBm sensitivity at a 0.1% BER.

This paper considers Quasi-Reduced ordered Multi-valued Decision Diagrams with k bits (QRMDD(k)s) to represent binary logic functions. Experimental results show relations between the values of k and the numbers of nodes, the memory sizes, the numbers of memory accesses, and area-time complexity for QRMDD(k). For many benchmark functions, the numbers of nodes and memory accesses for QRMDD(k)s are nearly equal to of the corresponding Quasi-Reduced ordered Binary Decision Diagrams (QRBDDs), and the memory sizes and the area-time complexities for QRMDD(k)s are minimum when k = 2 and k = 3-6, respectively.

This paper investigates some fundamental properties of one-way alternating pushdown automata with sublinear space. We first show that one-way nondeterministic pushdown automata are incomparale with one-way alternating pushdown automata with only universal states, for spaces between log log n and log n, and also for spaces between log n and n/log n. We then show that there exists an infinite space hierarchy among one-way alternating pushdown automata with only universal states which have sublinear space.

The complex dielectric image Green's function for metal-insulator-semiconductor (MIS) technology is proposed in this paper through dielectric image method. Then the Epsilon algorithm for Pade approximation is used to accelerate the convergence of the infinite series summation resulted from the complex dielectric image Green's function. Because of the complex dielectric permittivity of semiconducting substrate, the real and imaginary part of the resulted Green's function is accelerated by Epsilon algorithm, respectively. Combined with the complex dielectric image Green's function, the frequency-dependent capacitance and conductance of the transmission lines and interconnects based on MIS technology are investigated through the method of moments (MoM). The computational results of our method for 2-D and 3-D extraction examples are well agreement with experimental data gained from chip measurement and other methods such as full-wave analysis and FastCap.

This paper is focused on the measurement of the complex permittivity of a liquid phantom by the transmission line method using a coaxial line for measuring high-permittivity and high-loss materials. First, the complex permittivity of the liquid phantom material is measured under various physical lengths of the coaxial line for accurate measurement. Secondly, comparison between the measured result and the result obtained by the coaxial probe method is carried out in the frequency range from 0.5 to 3 GHz. Finally, the measurement error included in the complex permittivity is estimated quantitatively. The discussions lead to the conclusion that accurate measurement of the liquid material with high-permittivity and high-loss is possible by the presented method.