Frequency-modulated clock signals are widely used in personal computers to reduce the amplitude of the clock harmonic noise, as measured using an electromagnetic interference (EMI) test receiver. However, the power of the clock harmonics is not decreased with this technique called spread spectrum clocking (SSC). Hence, the impact of the harmonics of a frequency-modulated clock on the bit error rate (BER) and packet error rate (PER) of a Bluetooth system is theoretically analyzed. In addition, theoretical analysis covers the effectiveness of a frequency hopping spread spectrum (FH-SS) scheme and forward error correction (FEC) in mitigating the degradation in the BER and PER caused by clock harmonic interference. The results indicate that the BER and PER strongly depend on the modulating frequency and maximum frequency deviation of the clock harmonic. They also indicate that radiated clock harmonics may considerably degrade the BER and PER when a Bluetooth receiver is very close to a personal computer. Frequency modulating the clock harmonics slightly reduces the BER while it negligibly reduces the PER.

We propose a new fixed-rate error correction system with a feedback channel. In our system, the receiver transmits a list of positions of unreliable information bits based on the log a-posteriori probability ratios by outputs of a soft-output decoder to the transmitter. This method is just like that of the reliability-based hybrid ARQ scheme. To dynamically select an appropriate interleaving function with feedback information is a key feature of our system. By computer simulations, we show that the performance of a system with a feedback channel is improved by dynamically selecting an appropriate interleaving function.

In a typical OFDM system, a time domain equalizer (TEQ) can be used in order to reduce the channel length, allowing for shortening of the Cyclic Prefix (CP). In this paper, a novel TEQ method is proposed for OFDM systems, which can reduce implementation complexity without sacrificing performance. Furthermore, the length of the proposed TEQ may be arbitrary. For time-varying channels, an adaptive method is also developed to track the variation of the optimum TEQ coefficients rather than recomputing inversion of the channel matrix.

For the construction of a large fingerprinting system, conventional protocols need many computations to provide each fingerprinted contents to each user. In order to reduce the computational cost, we introduce a new concept of distributed providers in the fingerprinting protocol. Before a sale, our practical fingerprinting protocol using a concept of secure oblivious transfer is performed between a contents supplier and each provider. Then each provider obtains fingerprinted contents such that each bit of fingerprinting information is embedded in each segment of the contents. When a user orders some contents to the supplier, each segment of the contents is distributed from each provider specified by the supplier. The selection of providers who distribute the segments of contents is executed based on the user's identity so that the sequence of embedded bits in the collected segments may indicate the user's identity.

Compound noun segmentation is a key component for Korean language processing. Supervised approaches require some types of human intervention such as maintaining lexicons, manually segmenting the corpora, or devising heuristic rules. Thus, they suffer from the unknown word problem, and cannot distinguish domain-oriented or corpus-directed segmentation results from the others. These problems can be overcome by unsupervised approaches that employ segmentation clues obtained purely from a raw corpus. However, most unsupervised approaches require tuning of empirical parameters or learning of the statistical dictionary. To develop a tuning-less, learning-free unsupervised segmentation algorithm, this study proposes a pruning-based unsupervised technique that eliminates unhelpful segmentation candidates. In addition, unlike previous unsupervised methods that have relied on purely character-based segmentation clues, this study utilizes word-based segmentation clues. Experimental evaluations show that the pruning scheme is very effective to unsupervised segmentation of Korean compound nouns, and the use of word-based prior knowledge enables better segmentation accuracy. This study also shows that the proposed algorithm performs competitively with or better than other unsupervised methods.

In future systems beyond IMT-2000, macrocell cellular systems such as the 3G systems and high bandwidth microcell wireless systems such as Wireless LAN will complement one another. Routing in the systems beyond IMT-2000 will support seamless inter- and intra-system handover among the cellular and WLAN systems by maintaining active connections. Under such environments, the time scales of mobility and bandwidth-sharing behavior cannot be easily separated. It is not obvious what fraction of traffic is accommodated by each cellular and WLAN system, i.e. the traffic distribution is unknown. This paper shows the considerable impacts the mobility of users has on the capacities of the systems beyond IMT-2000 with roaming capability between different bit rate systems. Especially, this paper demonstrates that the traffic distribution among different systems is a major factor in defining total network throughput. We also provide an analytical method to determine the traffic distribution based on the theory of queueing networks.

In this paper, a multistage parallel interference canceller (MPIC) with multiple-beam reception for a DS-CDMA system is proposed to suppress multiple access interference (MAI) effectively. Its aim is to reduce the computational complexity of the conventional MPIC cascaded with an adaptive array antenna. It employs multiple fixed beams based on phased array and selects suitable beams to demodulate the transmitted signal of each user. Then it suppresses residual interference signals by the MPIC cascaded with multiple-beam receiver. Its bit error rate (BER) performance is evaluated by computer simulations assuming an uplink single-chip-rate multiple-spreading-factor DS-CDMA system over both exponentially decaying 5-path and equal average power 2-path Rayleigh distributed channels. When there are 16 users in an 120-sectored single cell, the proposed receiver with 6-element array antenna and 2-stage MPIC shows better or comparable BER performance compared with that of the conventional receiver. Moreover, the proposed receiver with 8 beams can reduce the number of complex multiplications to about 40% of that of the complexity-reduced conventional receiver over 5-path channels.

In this paper, the problem of Redundant Duplicated RREQ Network-wide Flooding (RDRNF), induced by multiple sensor nodes during route discovery in event-driven wireless sensor networks, is described. In order to reduce the number of signaling messages during the route discovery phase, a novel extension, named the Localized Route Discovery Extension (LRDE), to the on-demand ad hoc routing protocol, is proposed. The LRDE reduces energy consumption during route discovery. The heuristically and temporarily selected Path Set-up Coordinator (PSC) plays the role of a route request broker that alleviates redundant route request flooding. The LRDE also sets a route path be aggregation-compatible. The PSC can effectively perform data aggregation through the routing path constructed by the LRDE. The simulation results reveal that significant energy is conserved by reducing signaling overhead and performing data aggregation when LRDE is applied to on-demand routing protocols.

Higher transmission rates are one of the main characteristics of the fourth-generation (4G*) of mobile communications. These systems are expected to operate at higher frequency bands, which experience larger propagation loss. This results in larger required transmission power, which causes several problems, particularly for uplink communications, as the typical mobile station (MS) has limited transmission power. Multi-hop systems have been proposed to address this problem. In this paper, we consider the issue of random-access (RA) in a multi-hop system. It is clear that a two-hop mobile communication system requires a two-stage RA process. In this paper, we propose a two-stage RA process that is an extension of the RA process of the CDMA-based 3GPP standard. The proposed method uses a hybrid of code division multiple access (CDMA) and Slotted-ALOHA. To realize the proposed two-hop RA, we dedicate one slot for second-hop transmissions in each interval (predefined); we refer to this as the interval slots allocation (ISsA) technique. Numerical analyses and simulations are conducted to evaluate its basic performance in a multi-hop system. The results demonstrate the superior throughput-delay performance of the proposed two-stage RA multi-hop system with ISsA.

In this paper, we propose a variational method to derive the coefficients of piecewise-linear (PWL) models able to accurately approximate nonlinear functions, which are vector fields of autonomous dynamical systems described by continuous-time state-space models dependent on parameters. Such dynamical systems admit limit cycles, and the supercritical Hopf bifurcation normal form is chosen as an example of a system to be approximated. The robustness of the approximations is checked, with a view to circuit implementations.

In this paper, we propose two techniques to solve the nonlinear constrained optimization problem in large scale mesh-interconnected system. The first one is a diagram-method-based decomposition technique which decomposes the large scale system into some small subsystems. The second technique is a projected-Jacobi-based parallel dual-type method which can solve the optimization problems in the decomposed subsystems efficiently. We have used the proposed algorithm to solve numerous examples of large scale constrained optimization problems in power system. The test results show that the proposed algorithm has computational efficiency with respect to the conventional approach of the centralized Newton method and the state-of-the-art Block-Parallel Newton method.

The decorrelating detector is one of the detecting methods in a direct sequence code division multiple access systems. We investigate the blind adaptive decorrelating detector (BADD) using only the signature of the desired user (DU) according to the assumption that the algorithm is used in downlink. When the BADD is constructed with an antenna array, both the spatial and temporal signature must be taken into consideration for signal detection. We propose the BADD incorporated with the blind estimation of spatial signature (SS) of the DU only from the received signals. As the estimation procedure of SS, the orthogonal projection approximation and subspace tracking algorithm is adopted. The proposed BADD presented the BER improvement with using antenna array. The BER performance has a lower limit with increasing the number of antenna array elements.

Mobile IP is a solution to support mobile nodes but it does not handle NEtwork MObility (NEMO). The NEMO Basic Support (NBS) [1] ensures session continuity for all the nodes in a MObile NETwork (MONET). Since the protocol is based on Mobile IP, it inherits from Mobile IP the same fundamental problem such as tunnel convergence, when it is used to support the multicast for NEMO. In this paper, we propose the multicast Route Optimization (RO) scheme in NEMO environments. We suppose that the Mobile Router (MR) has a multicast function and the Nested Mobile Router Information (NeMRI). The NeMRI is used to record a list of the CoAs of all the MRs located below. And it obtains information whether the MRs desire multicast services. Also, we adopt any RO scheme to handle pinball routing. Therefore, we achieve optimal routes for multicasting in NEMO. We also develop analytic models to evaluate the performance of our scheme. We show much lower multicast tree delay and cost in NEMO compared with other techniques such as Bi-directional Tunneling (BT), Remote Subscription (RS), and Mobile Multicast (MoM) based on the NBS protocol.

For point-to-point mobile visual communications, layered video has been utilized to adapt to time-varying channel capacity over noisy environments. From the perspective of the HVS (Human Visual System), it is necessary to minimize the loss of visual quality by specifically maintaining the throughput of visually important regions, objects and so on. Utilizing the prioritized bitstreams generated according to each layer, the throughput can be improved for given channel statistics. In this paper, we define the transmission gain and measure the improved performance when the throughput of ROI (Regions Of Interest) is increased relative to visually unimportant regions over a capacity limited mobile channel.

The proposed zero-current switching switched-capacitor (ZCS SC) DC-DC converter is an innovative bi-directional power flow control conversion scheme. A zero-current switching switched-capacitor step-up/step-down bi-directional converter is presented that can improve the current stress problem during bi-directional power flow control processing. It can provide a high voltage conversion ratio of n/ (n-mode/-mode) using four power MOSFET main switches, a set of switched-capacitors and a small resonant inductor. Simulation and experimental results are carried out to verify the concept and performance of the proposed quadruple-mode/quarter-mode bi-directional DC-DC converter.

A network based on the Inverse Function Delayed (ID) model which can recall a temporal sequence of patterns, is proposed. The classical problem that the network is forced to make long distance jumps due to strong attractors that have to be isolated from each other, is solved by the introduction of the ID neuron. The ID neuron has negative resistance in its dynamics which makes a gradual change from one attractor to another possible. It is then shown that a network structure consisting of paired conventional and ID neurons, perfectly can recall a sequence.

Watson-Crick automata were introduced as a new computer model and have been intensively investigated regarding their computational power. In this paper, aiming to establish the relations among language families defined by Watson-Crick automata and the family of context-free languages completely, we obtain the following results. (1) F1WK = FSWK = FWK, (2) FWK = AWK, (3) there exists a language which is not context-free but belongs to NWK, and (4) there exists a context-free language which does not belong to AWK.

Tone Injection (TI) can reduce the high peak-to-average ratio (PAR) which can substantially limit the performance of multicarrier systems without bandwidth loss. However, TI results in peak regrowth since it does not consider second peaks which can be higher than the peak after performing TI and also the average transmit power is increased because of huge constellation. In this paper, a no-rate loss PAR reduction technique, Injected Tone Constellation (ITC), is proposed along with an iterative algorithm to achieve the performance increase and to minimize the average transmit power without high complexity.

CMOS poly-Si thin-film transistors (TFTs) were fabricated through crystallization and GILD processes by a novel selected area laser assisted (SALA) system. The system enables a local area irradiation of small beams of a pulsed solid-state laser of frequency tripled Nd:YAG. The novel TFT process eliminated 3 doping mask steps of the conventional process. On-off current ratios for both types of poly-Si TFTs were improved by SALA. The field effect mobility of n- and p-channel TFTs is 84 cm2/Vs and 75 cm2/Vs, respectively.

In this paper, we shall describe about a refined theory based on the concept of set-valued operators, suitable for available operation of extremely complicated large-scale network systems. The deduction of theory is accomplished in a weak topology introduced into the Banach space. Fundamental conditions for availability of system behaviors of such network systems are clarified, as a result, in a form of fixed point theorem for system of set-valued operators.