Based on the Khatri-Rao matrix product, we propose a novel unitary space-time modulation design called KR-USTM in this paper. Different from existing USTM schemes, such as the systematic approach and space-time frequency-shift keying (ST-FSK), KR-USTM does not require any computer search and can be applied to any number of transmit antennas. Moreover, the special structure of KR-USTM also makes it a high-rate scheme and achieve full antenna diversity as well as lower decoding complexity. Simulation results show that the proposed KR-USTM constellation achieves error performance comparable to existing USTM designs at low rates, while it outperforms them at high rates.

This paper studies a multiband mobile communication system to support both high data rate services and wide service coverage, using high and low frequency resources with different propagation characteristics. In the multiband system, multiple frequency bands are managed by a base station and one of the frequency bands is adaptively allocated to a terminal depending on his channel quality. By limiting the low frequency resources to a terminal not covered by the higher frequencies, the presented multiband system can accommodate many terminals providing wide coverage area, as if all radio resources have low frequency. From numerical results, the multiband system can provide wide service coverage area for much larger number of terminals than conventional systems. It is also found that an appropriate balance of multiple frequency resources is essential to achieve high capacity.

Binary sequences with two-level periodic autocorrelation correspond directly to cyclic (v, k, λ)-designs. When v = 4t-1, k = 2t -1 and λ = t-1, for some positive integer t, the sequence (or design) is called a cyclic Hadamard sequence (or design). For all known examples, v is either a prime number, a product of twin primes, or one less than a power of 2. Except when v = 2k-1, all known examples are based on quadratic residues (using the Legendre symbol when v is prime, and the Jacobi symbol when v = p(p+2) where both p and p+2 are prime); or sextic residues (when v is a prime of the form 4a2 + 27). However, when v = 2k-1, many constructions are now known, including m-sequences (corresponding to Singer difference sets), quadratic and sextic residue sequences (when 2k-1 is prime), GMW sequences and their generalizations (when k is composite), certain term-by-term sums of three and of five m-sequences and more general sums of trace terms, several constructions based on hyper-ovals in finite geometries (found by Segre, by Glynn, and by Maschietti), and the result of performing the Welch-Gong transformation on some of the foregoing.

The convergence speed of the conventional adaptive LMS algorithms for time delay estimation (TDE) is highly dependent on the spectral distribution of the desired random source signals of interest, thus the performance of TDE might be degraded, dramatically. To solve this problem, in this letter, a DCT-transform domain constrained adaptive normalized-LMS filtering scheme, referred to as the adaptive constrained DCT-LMS algorithm, is devised for TDE. Computer simulation results verify that the proposed scheme can be used to achieve desired performance, for input random signals with different spectral distributions; it outperforms the unconstrained DCT-LMS and time-domain constrained adaptive LMS algorithms.

The behavior of Bard-type pivoting algorithms for the linear complementarity problem with a P-matrix is represented by an orientation of a hypercube. We call it a PLCP-cube. In 1978, Stickney and Watson conjectured that such an orientation has no facet on which all even outdegree vertices appear. We prove that this conjecture is true for acyclic PLCP-cubes in dimension five.

It was previously shown that the number of array elements must exceed the number of sources for multiple target direction of arrival (DOA) tracking. This is clearly not practical for code-division multiple access (CDMA) communications since the number of mobile users is very large. To overcome the restriction, adaptive angle tracking approaches employing the code-matched filters and parallel Kalman/H∞ algorithms are presented in this paper. The proposed approaches are applied to the base station of a mobile communication system. Different from Kalman prediction algorithm which minimize the squared tracking error, the adaptive H∞ filtering algorithm is a worst case optimization. It minimizes the effect of the worst disturbances (including modeling error of direction matrix models and array structure imperfection, process noise, and measurement noise). Hence, the difficult problem of tracking the crossing mobiles can be successfully handled by using the code-matched filters. Computer simulation is provided for illustrating the effectiveness of the adaptive angle tracking approaches.

Plasma oscillations in nanometer field effect transistors are used for detection and generation of electromagnetic radiation of THz frequency. Following first observations of resonant detection in 150 nm gate length GaAs HEMT, we describe recent observations of room temperature detection in nanometer Si MOSFETs, resonant detection in GaN/AlGaN HEMTs and improvement of room temperature detection in GaAs HEMTs due to the drain current. Experiments on spectrally resolved THz emission are described that involve room and liquid helium temperature emission from nanometer GaInAs and GaN HEMTs.

Kernel-based learning algorithms have been successfully applied in various problem domains, given appropriate kernel functions. In this paper, we discuss the problem of designing kernel functions for binary regression and show that using a bell-shaped cosine function as a kernel function is optimal in some sense. The rationale of this result is based on the Karhunen-Loeve expansion, i.e., the optimal approximation to a set of functions is given by the principal component of the correlation operator of the functions.

The minimization problem of an L2-sensitivity measure subject to L2-norm dynamic-range scaling constraints is formulated for a class of two-dimensional (2-D) state-space digital filters. First, the problem is converted into an unconstrained optimization problem by using linear-algebraic techniques. Next, the unconstrained optimization problem is solved by applying an efficient quasi-Newton algorithm with closed-form formula for gradient evaluation. The coordinate transformation matrix obtained is then used to synthesize the optimal 2-D state-space filter structure that minimizes the L2-sensitivity measure subject to L2-norm dynamic-range scaling constraints. Finally, a numerical example is presented to illustrate the utility of the proposed technique.

We study the coupled spatio-temporal variations of the electron density and the electric field (electron plasma oscillations) in high-electron mobility transistors using the developed device model. The excitation of electron plasma oscillations in the terahertz range of frequencies might lead to the emission of terahertz radiation. In the framework of the model developed, we calculate the resonant plasma frequencies and find the conditions for the plasma oscillations self-excitation (plasma instability) We show that the transit-time effect in the high-electric field region near the drain edge of the channel of high-electron mobility transistors can cause the self-excitation of the plasma oscillations. It is shown that the self-excitation of plasma oscillations is possible when the ratio of the electron velocity in the high field region, ud, and the gate length, Lg, i.e., the inverse transit time are sufficiently large in comparison with the electron collision frequency in the gated channel, ν. The transit-time mechanism of plasma instability under consideration can superimpose on the Dyakonov-Shur mechanism predicted previously strongly affecting the conditions of the instability and, hence, terahertz emission. The instability mechanism under consideration might shed light on the origin of terahertz emission from high electron mobility transistors observed in recent experiments.

In this study, we propose an adaptive handoff scheme with dynamic hysteresis value for cellular communications, which is based on distance between the mobile station and the serving base station. Performance is evaluated in terms of the expected number of handoffs, the expected handoff delay, standard deviation of handoff location, and the expected link degradation probability as well. Numerical results and simulations show that the proposed scheme outperforms the handoff schemes with static hysteresis levels. The effect of distance error is also discussed.

Experimental investigations on detection of terahertz radiation are presented. We used plasma wave instability phenomenon in nanometer Silicon field effect transistor. A 30 nm gate length transistor was illuminated by THz radiation at room temperature. We observe a maximum signal near to the threshold voltage. This result clearly demonstrates the possibility of plasma wave THz operation of these nanometer scale devices. The response was attributed to a non resonant detection. We also demonstrate the possibility to observe a resonant detection on the same devices.

We extend the adaptive-order rational Arnoldi algorithm for multiple-inputs and multiple-outputs (MIMO) interconnect model order reductions. Instead of using the standard Arnoldi algorithm for the SISO adaptive-order reduction algorithm (AORA), we study the adaptive-order rational global Arnoldi (AORGA) algorithm for MIMO model reductions. In this new algorithm, the input matrix is treated as a vector form. A new matrix Krylov subspace, generated by the global Arnoldi algorithm, will be developed by a Frobenius-orthonormal basis. By employing congruence transformation with the matrix Krylov subspace, the one-sided projection method can be used to construct a reduced-order system. It will be shown that the system moment matching can be preserved. In addition, we also show that the transfer matrix residual error of the reduced system can be derived analytically. This error information will provide a guideline for the order selection scheme. The algorithm can also be applied to the classical multiple point MIMO Pade approximation by the rational Arnoldi algorithm for multiple expansion points. Experimental results demonstrate the feasibility and the effectiveness of the proposed method.

In this paper, ultra-wideband (UWB) multiple access systems are introduced by using direct-sequence (DS) and hybrid direct-sequence time-hopping (DS/TH) code division multiple access (CDMA) that use arbitrary chip-duty of the spreading sequences. The bit error probabilities are presented. First of all, the variances of the multiple access interference are developed by investigating the collision properties of the signals. Afterward, various approximations are applied. The standard Gaussian approximation (SGA) for the DS system is shown to become extremely optimistic as the chip-duty becomes low. Though the hybrid system performs better, the SGA still remains optimistic. To obtain accurate results, Holtzman's simplified improved Gaussian approximation (SIGA) and Morrow and Lehnert's improved Gaussian approximation (IGA) are used. A shortcoming of the SIGA is rediscovered that renders it unusable for low-duty DS systems, especially, at high signal-to-noise ratio. However, for the hybrid system, the SIGA works as an excellent tool. The IGA is used to get accurate results for the low-duty DS systems. It is shown that lowering of chip-duty by keeping chip rate and chip length unchanged improves performance for asynchronous DS and both asynchronous and synchronous hybrid systems. However, under the same processing gain, a high-duty system performs better than a low-duty system. Performance of synchronous DS system remains independent of chip-duty.

In this letter, we derive an efficient audio/video synchronization method for video telephony. For synchronization, this method does not require any further RTCP packet processing except for the first one. The derived decision rule is far more compact than the conventional method. This decision rule is incorporated in an actual video telephony system adopting Texas Instruments (TI) OMAP 1510 processor and Qualcomm MSM 5500. The computational requirement was compared with the conventional method and through simulations the superiority of the proposed method is proved.

We describe a layer 3 diversity reception scheme that enhances the transmission characteristics of Ku-band mobile satellite communication systems. This scheme can realize high-speed communication for vehicles that experience shadowing caused by terrestrial obstacles such as tunnels, buildings and bridges, especially for trains that frequently experience shadowing from the trolley wire structures. Layer 3 diversity was chosen for long distance diversity to prevent signal shadowing caused by terrestrial obstacles while minimizing the alterations of existing receivers. The technology enables high-speed communication under shadowing conditions in a running train environment.

This paper studies the problem of the relations between existence conditions of common quadratic and those of common infinity-norm Lyapunov functions for sets of discrete-time linear time-invariant (LTI) systems. Based on the equivalence between the robust stability of a class of time-varying systems and the existence of a common infinity-norm Lyapunov function for the corresponding set of LTI systems, the relations are determined. It turns out that although the relation is an equivalent one for single stable systems, the existence condition of common infinity-norm type is strictly implied by that of common quadratic type for the set of systems. Several existence conditions of a common infinity-norm Lyapunov functions are also presented for the purpose of easy checking.

The rapid hybrid acquisition of PN sequences is proposed for DS/CDMA systems. The system introduces the excision CFAR method into the background power estimation. A mathematical analysis is done for the single path and multipath environments. The detection performance of the proposed scheme is compared with that of other acquisition schemes. Results show that the proposed method has better detection performance if the excision coefficient is properly selected.

We consider the classification problem to construct a classifier c:{0,1}n{0,1} from a given set of examples (training set), which (approximately) realizes the hidden oracle y:{0,1}n{0,1} describing the phenomenon under consideration. For this problem, a number of approaches are already known in computational learning theory; e.g., decision trees, support vector machines (SVM), and iteratively composed features (ICF). The last one, ICF, was proposed in our previous work (Haraguchi et al., (2004)). A feature, composed of a nonempty subset S of other features (including the original data attributes), is a Boolean function fS:{0,1}S{0,1} and is constructed according to the proposed rule. The ICF algorithm iterates generation and selection processes of features, and finally adopts one of the generated features as the classifier, where the generation process may be considered as embodying the idea of boosting, since new features are generated from the available features. In this paper, we generalize a feature to an extended Boolean function fS:{0,1,*}S{0,1,*} to allow partial knowledge, where * denotes the state of uncertainty. We then propose the algorithm ICF* to generate such generalized features. The selection process of ICF* is also different from that of ICF, in that features are selected so as to cover the entire training set. Our computational experiments indicate that ICF* is better than ICF in terms of both classification performance and computation time. Also, it is competitive with other representative learning algorithms such as decision trees and SVM.

The present letter deals with the blind equalization problem of a single-input single-output infinite impulse response (SISO-IIR) channel with additive Gaussian noise. To solve the problem, we propose a new criterion for maximizing constrainedly a fourth-order cumulant. The algorithms derived from the criterion have such a novel property that even if Gaussian noise is added to the output of the channel, an effective zero-forcing (ZF) equalizer can be obtained with as little influence of Gaussian noise as possible. To show the validity of the proposed criterion, some simulation results are presented.