This paper studies bit-interleaved coded modulation with iterative decoding (BICM-ID) systems that employ multi-dimensional mappings of M-ary constellations to improve the error performance over Rayleigh fading channels. Based on the analytical evaluations of the asymptotic bit error probability (BEP), the distance criteria for the mapping designs can be obtained. A binary switching algorithm (BSA) is then applied to find the optimal mappings with respect to the asymptotic performance. Simulation and analytical results show that the use of multi-dimensional mappings of M-ary constellations can significantly improve the error performance.

This paper presents a method of simple adaptive control (SAC) using neural networks for a class of nonlinear systems with bounded-input bounded-output (BIBO) and bounded nonlinearity. The control input is given by the sum of the output of the simple adaptive controller and the output of the neural network. The neural network is used to compensate for the nonlinearity of the plant dynamics that is not taken into consideration in the usual SAC. The role of the neural network is to construct a linearized model by minimizing the output error caused by nonlinearities in the control systems. Furthermore, convergence and stability analysis of the proposed method is performed. Finally, the effectiveness of the proposed method is confirmed through computer simulation.

A lexicon is an important linguistic resource needed for both shallow and deep language processing. Currently, there are few machine-readable Thai dictionaries available, and most of them do not satisfy the computational requirements. This paper presents the design of a Thai lexicon named the TCL's Computational Lexicon (TCLLEX) and proposes a method to construct a large-scale Thai lexicon by re-using two existing dictionaries and a large number of texts on the Internet. In addition to morphological, syntactic, semantic case role and logical information in the existing dictionaries, a sort of semantic constraint called selectional preference is automatically acquired by analyzing Thai texts on the web and then added into the lexicon. In the acquisition process of the selectional preferences, the so-called Bayesian Information Criterion (BIC) is applied as the measure in a tree cut model. The experiments are done to verify the feasibility and effectiveness of obtained selection preferences.

We investigated performance improvement in a cellular system by introducing direct communication between terminals. Previous research has indicated that direct communication efficiently uses channels; however, this is not always so. We studied two factors that affect how much efficiency improves. One is the distribution of terminals. We defined some typical distributions with localization of terminals and analyzed how the difference between the distributions affected the performance improvement by direct communication. Another factor is the mobility of terminals, because mobility shortens the length of time during which terminals are directly connected. We analyzed how mobility affected performance improvement by direct communication. For the analyses, we used some theoretical techniques.

This paper proposes two complexity reduced Maximum Likelihood Detection (MLD) methods for Space Division Multiplexing--OFDM (SDM-OFDM) system to exploit the spatial diversity so as to achieve the improved transmission quality. The proposed methods enable to outperform the other suboptimal detection methods and achieve near MLD performance with a significant reduction in calculation complexity. The various computer simulation results confirm that the proposed methods could realize the above targets and might be promising solution in practical systems.

From the viewpoint of a low-power pipeline ADC design, a comparison between two conventional power reduction techniques is discussed. The comparison shows that the amplifier sharing technique has an advantage in terms of the power reduction effect. To confirm the advantage, a test chip of 10-bit 80-MSPS ADC using the amplifier sharing technique is fabricated. The test chip dissipates 55 mW at 80 MSPS (Mega Sample Per Second).

The noise robustness of an audio fingerprinting system is one of the most important issues in music information retrieval by the content-based audio identification technique. In a real environment, sound recordings are commonly distorted by channel and background noise. Recently, Philips published a robust and efficient audio fingerprinting system for audio identification. To extract a robust and efficient audio fingerprint, Philips applied the first derivative (differential) to the frequency-time sequence of the perceptual filter-bank energies. In practice, however, the noise robustness of Philips' audio fingerprinting scheme is still insufficient. In this paper, we introduce an extension method of the audio fingerprinting scheme for the enhancement of noise robustness. As an alternative to frequency filtering, a type of band-pass filter, instead of a high-pass filter, is used to achieve robustness to background noise in a real situation. Our experimental results show that the proposed filter improves the noise robustness in audio identification.

This paper deals with a secret key agreement problem from correlated random numbers. It is proved that there is a pair of linear matrices that yields a secret key agreement in the situation wherein a sender, a legitimate receiver, and an eavesdropper have access to correlated random numbers. A relation between the coding problem of correlated sources and a secret key agreement problem from correlated random numbers are also discussed.

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.

The feasibility of a new transistor structure was demonstrated through an experimental observation of current gain and voltage gain. The proposed transistor structure is a hot electron transistor without a base layer to minimize scattering. Electron emission from the emitter is controlled using positively biased Schottky gate electrodes located on both sides of the emitter mesa. Monte Carlo simulation shows an estimated delay time of 0.17 ps and low gate leakage current with open-circuit voltage gain over unity. To confirm the basic operation, the device with a 25 nm wide emitter was fabricated. To obtain saturated current-voltage characteristics, the emitter was surrounded by gates and parasitic regions were eliminated by electron beam lithography. The observed open-circuit voltage gain was 25. To obtain a low leakage current, an electron energy smaller than the Γ-L separation was necessary to maintain the ballistic nature of the electron. When the gate-emitter voltage was 0.8 V, the gate leakage current was only 4% of the collector current. Thus voltage amplication and current amplification were confirmed simultaneously.

This investigation of the temperature and illumination effects on the AlGaN/GaN HFET threshold voltage shows that it shifts about -1 V under incandescent lamp or blue LED illumination, while almost no shift takes place under red LED illumination. The temperature coefficient for the threshold voltage shift is +3.44 mV/deg under the illuminations and +0.28 mV/deg in darkness. The threshold voltage variation can be attributed to a virtual back-gate effect caused by light-generated buffer layer potential variations. The expressions for the potential variation are derived using Shockley-Read-Hall (SRH) statistics and the Maxwell-Boltzmann distribution for the carriers and deep traps in the buffer layer. The expressions indicate that large photoresponses will occur when the electron concentration in the buffer layer is extremely small, that is, highly resistive. In semi-insulating substrates, the substrate potential varies so as to keep the trap occupation function constant. The sign and the magnitude of the threshold voltage variation are explained by the shift of the pinning energy calculated from the Fermi-Dirac distribution function.

To obtain large capacity, high quality mobile satellite communication systems in the future, we must use a multi-beam that can cope with extremely high levels of frequency reuse. This paper describes a novel resource allocation algorithm for multi-beam satellite communication systems that can dynamically adapt to maximum communication capacity without compromising quality. The algorithm combines two resource allocation schemes that enable it to contend with the ever-changing user distribution and inter-beam interference conditions. The first scheme optimizes the resources amongst beams. To minimize interference, the optimal constraint conditions are clarified when all clusters share and occupy the same bandwidth completely. These constraints are used in the optimization algorithm. The second scheme manages the various required resources and adapts them to the beam gain and interference levels at various user locations within a single beam. We propose a fixed power adaptive modulation scheme to obtain stable communications. This two-layered scheme can satisfactorily allocate multi-beam satellite resources to contend with the increasing communication capacity and still improve the quality.

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.

The most powerful channel coding schemes, namely those based on turbo codes and low-density parity-check (LDPC) Gallager codes, have in common the principle of iterative decoding. However, the relative coding structures and decoding algorithms are substantially different. This paper presents a 2048-bit, rate-1/2 soft decision decoder for a new class of codes known as Turbo Gallager Codes. These codes are turbo codes with properly chosen component convolutional codes such that they can be successfully decoded by means of the decoding algorithm used for LDPC codes, i.e., the belief propagation algorithm working on the code Tanner graph. These coding schemes are important in practical terms for two reasons: (i) they can be encoded as classical turbo codes, giving a solution to the encoding problem of LDPC codes; (ii) they can also be decoded in a fully parallel manner, partially overcoming the routing congestion bottleneck of parallel decoder VLSI implementations thanks to the locality of the interconnections. The implemented decoder can support up to 1 Gbit/s data rate and performs up to 48 decoding iterations ensuring both high throughput and good coding gain. In order to evaluate the performance and the gate complexity of the decoder VLSI architecture, it has been synthesized in a 0.18 µm standard-cell CMOS technology.

In this paper, Morse code is selected as a communication adaptive device for persons whose hand coordination and dexterity are impaired by such ailments as amyotrophic lateral sclerosis, multiple sclerosis, muscular dystrophy, and other severe handicaps. Morse code is composed of a series of dots, dashes, and space intervals, and each element is transmitted by sending a signal for a defined length of time. A suitable adaptive automatic recognition method is needed for persons with disabilities due to their difficulty in maintaining a stable typing rate. To overcome this problem, the proposed method combines the support vector machines method with a variable degree variable step size LMS algorithm. The method is divided into five stages: tone recognition, space recognition, training process, adaptive processing, and character recognition. Statistical analyses demonstrated that the proposed method elicited a better recognition rate in comparison to alternative methods from the literature.

This paper presents a robust object tracking method under pose variation and partial occlusion. In practical environment, the appearance of objects is changed dynamically by pose variation or partial occlusion. Therefore, the robustness to them is required for practical applications. However, it is difficult to be robust to various changes by only one tracking model. Therefore, slight robustness to variations and the easiness of model update are required. For this purpose, Kernel Principal Component Analysis (KPCA) of local parts is used. KPCA of local parts is proposed originally for the purpose of pose independent object recognition. Training of this method is performed by using local parts cropped from only one or two object images. This is good property for tracking because only one target image is given in practical applications. In addition, the model (subspace) of this method can be updated easily by solving a eigen value problem. Performance of the proposed method is evaluated by using the test face sequence captured under pose, partial occlusion, scaling and illumination variations. Effectiveness and robustness of the proposed method are demonstrated by the comparison with template matching based tracker. In addition, adaptive update rule using similarity with current subspace is also proposed. Effectiveness of adaptive update rule is shown by experiment.

Various mixed-signal very-high-speed integrated circuits have been developed using InP DHBTs. These circuits have been designed for fiber-optic 43 Gbit/s transmissions applications. They include: on the transmitting side, a clocked driver and an EAM driver, as well as a PSBT/DQPSK precoder; on the receiving side, a sensitive decision circuit, a limiting amplifier and an eye monitor. System experiments made possible by these circuits include a 6 Tbit/s transmission on >6000 km distance.

In this paper, a new family S(r) of 2n binary sequences of period 2n-1 is proposed, where n ≡ 2 mod 4 and gcd(r, 2n/2-1)=1. The presented family takes 4-valued out-of-phase auto- and cross-correlation values -1, 2n/2-1, and 2n/2+1-1, and its correlation distribution is determined. For r=2(n-2)/4-1, each sequence in S(r), except the unique ideal autocorrelation sequence in the family, is proved to have a large linear span n2n/2-2, whilst the linear span of the latter is n2(n-2)/4-1.

We present room temperature current voltage characteristics from SiGe interband tunneling diodes epitaxially grown on highly resistive Si(001) substrates. In this case, a maximum peak to valley current ratio (PVCR) of 5.65 was obtained. The possible integration of a SiGe tunnel diode with a strained Si transistor lead us to investigate the growth of SiGe interband tunneling diodes on Si0.7Ge0.3 virtual substrates. A careful optimization of the layer structure leads to a maximum PVCR of 1.36 at room temperature. The latter value can be further increased to 2.26 at 3.7 K. Our results demonstrate that high quality SiGe interband tunneling diodes can be realized, which is of great interest for future memory and high speed applications.

Micromobility management is a key issue for the deployment of broadband mobile communication services. The packet loss during handover and the handover latency need to be minimized to maintain the high quality of these services. We have previously proposed a mobility management scheme that addresses this issue in wide-area mobile networks that employed hierarchical multiple mobility management routers (Mobility Anchor Points or MAPs). Our scheme directs a Mobile Terminal (MT) to a suitable MAP to fully minimize packet loss during handover, and handover latency of the MTs. In our previous work, we confirmed the effectiveness of our scheme using a simple tree network. Actual networks however, always have densely meshed topologies to provide some redundancy for the elimination of single points of failure. In such networks, it is difficult to deduce the relationships between the MAPs, and this makes it difficult for our scheme to select a suitable MAP for an MT, because the selection is performed using both the MT's smoothed speed and the relationships existing between the MAPs located above the Access Router (AR), to which the MT is connected. In this paper, we propose a method to overcome this problem, by autonomously adjusting the selection criteria that are individually configured for use at a particular AR, and we evaluate this method using simulation experiments. The results show that our mobility management scheme works well in densely meshed networks using the proposed additional method.