Multipath propagation of radio signal introduces frequency selectivity. OFDMA systems greatly suffer from frequency selective fading. It is an important limit factor of performance of OFDMA systems, especially in subband based multiple user access scehems. In this paper, we propose the method of subband selection and handover to improve the system performance over the frequency selective channel. Two subband selection algorithms are presented to accurately select the subband with high channel gain and avoid the channel notch. The random access procedure employing subband selection is presented as an example. The effects of the subband selection are also given. The selection effectively improves the performances of frame synchronization, frequency synchronization, channel estimation, and bit error rate (BER). The investigations show that the proposed scheme is promising to reliable communications over frequency selective fading channel.

In order to achieve adaptive channel coding and adaptive modulation, the main causes of degradation to system performance are the decoder selection error and modulator estimation error. The utilization of supplementary information, in an estimation system utilizing channel estimation results, blind modulation estimation, and blind encoder estimation using several decoders information and encoder transitions have been considered to overcome these two problems. There are however many issues in these methods, such as the channel estimation difference between transmitter and receiver, computational complexity and the assumption of perfect Channel State Information (CSI). Our proposal, on the other hand, decreases decoder and demodulator selection error using a Hidden-Markov Model (HMM). In order to estimate the switching patterns of the encoder and modulator, our proposed system selects the maximum likelihood encoder and modulator transition patterns using both encoder and modulator transition probability based on the HMM obtained by CSI and also Decoder and Demodulator Selection Error probabilities. Therefore, the decoder and demodulation results can be achieved efficiently without any restraint on the pattern of switching encoder and modulation.

This research aims to construct a high-quality Japanese TTS (Text-to-Speech) system that has high flexibility in treating prosody. Many TTS systems have implemented a prosody control system but such systems have been fundamentally designed to output speech with a standard pitch and speech rate. In this study, we employ a unit selection-concatenation method and also introduce an analysis-synthesis process to provide precisely controlled prosody in output speech. Speech quality degrades in proportion to the amount of prosody modification, therefore a target cost for prosody is set to evaluate prosodic difference between target prosody and speech candidates in such a unit selection system. However, the conventional cost ignores the original prosody of speech segments, although it is assumed that the quality deterioration tendency varies in relation to the pitch or speech rate of original speech. In this paper, we propose a novel cost function design based on the prosody of speech segments. First, we recorded nine databases of Japanese speech with different prosodic characteristics. Then with respect to the speech databases, we investigated the relationships between the amount of prosody modification and the perceptual degradation. The results indicate that the tendency of perceptual degradation differs according to the prosodic features of the original speech. On the basis of these results, we propose a new cost function design, which changes a cost function according to the prosody of a speech database. Results of preference testing of synthetic speech show that the proposed cost functions generate speech of higher quality than the conventional method.

A frequency selection algorithm leveraging the capability of a handset to autonomously select idle channels of a public communication system for use in a private communication system was previously proposed, and its effectiveness was verified through experiments conducted in a metropolitan area. This paper describes the results of an experiment verifying the algorithm's effectiveness in rural areas with relatively low public communication system traffic.

This paper proposes cell selection (CS) based on shadowing variation for the forward-link Orthogonal Frequency and Code Division Multiplexing (OFCDM) packet wireless access. We clarify its effects using a broadband propagation channel model in a comparison with fast cell selection (FCS), which tracks the instantaneous fading variation, and with the conventional slow CS, which tracks only the distance-dependent path loss, based on radio link level simulations that take into account time-varying instantaneous fading and shadowing variations. The simulation results show that the achievable throughput with FCS improves slightly in a broadband channel with an increasing number of paths when the average path-loss difference between two cells is greater than 2 dB. Nevertheless, we show that the optimum CS interval becomes approximately 100 msec, because the interval can track the time-varying shadowing variation considering low-to-high mobility up to the maximum Doppler frequency of 200 Hz. Consequently, we show that the throughput by employing the CS based on shadowing variation with the selection interval of 100 msec is increased by approximately 5 and 15% compared to that using the conventional slow CS with the selection interval of 1 sec, for the maximum Doppler frequency of 20 and 200 Hz, respectively.

Adaptive routing algorithms, which dynamically select the route of a packet, have been widely studied for interconnection networks in massively parallel computers. An output selection function (OSF), which decides the output channel when some legal channels are free, is essential for an adaptive routing. In this paper, we propose a simple and efficient OSF called minimal multiplexed and least-recently-used (MMLRU). The MMLRU selection function has the following simple strategies for distributing the traffic: 1) each router locally grasps the congestion information by the utilization ratio of its own physical channels; 2) it is divided into the two selection steps, the choice from available physical channels and the choice from available virtual channels. The MMLRU selection function can be used on any type of network topology and adaptive routing algorithm. Simulation results show that the MMLRU selection function improves throughput and latency especially when the number of dimension becomes larger or the number of nodes per dimension become larger.

A Shared-State Hidden Markov Model (SS-HMM) has been widely used as an acoustic model in speech recognition. In this paper, we propose a method for constructing SS-HMMs within a practical Bayesian framework. Our method derives the Bayesian model selection criterion for the SS-HMM based on the variational Bayesian approach. The appropriate phonetic decision tree structure of the SS-HMM is found by using the Bayesian criterion. Unlike the conventional asymptotic criteria, this criterion is applicable even in the case of an insufficient amount of training data. The experimental results on isolated word recognition demonstrate that the proposed method does not require the tuning parameter that must be tuned according to the amount of training data, and is useful for selecting the appropriate SS-HMM structure for practical use.

In this letter, we address the problem of how to measure the link quality in terms of signal-to-interference ratio (SIR) in rapidly time varying channels which are due to fast variation of the interference or the bursty nature of the traffic. We propose a new SIR estimation approach for the TD-CDMA system, that is based on a pre-selection tentative decision device which discards and selects the estimated symbol on the basis of MAP ratio. The simulation results show that the proposed SIR estimator works and is superior to other known estimators in rapidly time varying channels.

The single path routing protocol, known as the Ad Hoc On-demand Distance Vector, has been widely studied for use in mobile ad hoc networks. AODV requires a new route discovery whenever a path breaks. Such frequent route discoveries cause a delay due to route discovery latency. To avoid such inefficiency, a multipath routing protocol has been proposed that attempts to find link-disjoint paths in a route discovery. However, when there are two or more common intermediate nodes on the path, the protocol can not find a pair of link-disjoint paths even if the paths actually exist. To reduce this route discovery latency, it is necessary to increase the opportunities for finding a pair of link-disjoint paths. In this paper, we focus on AODV and propose an AODV-based new multipath routing protocol for mobile ad hoc networks. The proposed routing protocol uses a new method to find a pair of link-disjoint paths by selecting a route having a small number of common intermediate nodes on its path. Using simulation models, we evaluate the proposed routing protocol and compare it with AODV and the existing multipath routing protocol. Results show that the proposed routing protocol achieves better performance in terms of delay than other protocols because it increases the number of cases where a pair of link-disjoint paths can be established.

In future high-speed networks, provision of diverse multimedia services with strict quality-of-service (QoS) requirements, such as bandwidth, delay and so on, is desired. QoS routing is a possible solution to handle these services. Generally, a path selection for QoS routing is formulated as a shortest path problem subject to multiple constraints. However, it is known to be NP-complete when more than one QoS constraint is imposed. As a result, many heuristic algorithms have been proposed so far. The authors proposed a path selection algorithm Fallback+ for QoS routing, which focuses not only on the path selection with multiple constraints but also on the efficient use of network resources. This paper proposes an enhanced version of Fallback+, named Enhanced Fallback+, where in a shrewd way, it keeps tentative paths produced in the conventional Fallback algorithm with Dijkstra's algorithm. Simulation experiments prove the excellent performance of Enhanced Fallback+, compared with the original Fallback+ and other existing path selection algorithms.

Low Earth Orbit (LEO) satellite constellations have been proposed in recent years to provide broadband network access. This research focuses on Walker Delta type constellation. Walker Delta has overlapping ascending and descending orbits. Although Inter Satellite Links (ISLs) can be utilized between satellites orbiting in the same direction, ISLs cannot be utilized between satellites orbiting in opposite directions. As a result, a Walker Delta Constellation with ISLs has two locally separate overlapping meshes, an ascending and a descending mesh. To reach from one local mesh to the other, the traffic has to pass through the highest latitude intra-plane ISLs. Therefore the propagation delay between terminals connected to different meshes is greater than between terminals connected to the same mesh. Due to characteristic handover of LEO satellites, terminals can connect to a satellite in the other mesh during communication, causing drastic variation of propagation delay which results in degradation of communication quality. These issues can be solved by continuously connecting the communication terminals to the same mesh. In this paper, a satellite selection method for Walker Delta Constellations with double mesh coverage is proposed. It employs geographical location information of the communicating terminals, to connect them to the same mesh. In addition, the proposed method selects the mesh that minimize propagation delay for that communication session. It is shown through simulation that the proposed method is effective in reducing delay and jitter for a connection while improving overall communication quality of the network.

We have proposed a speculative selection function for adaptive routing, which uses idle cycles of the network physical links to exchange network information between nodes, thus helps to decide the best selection. Previous study on the mesh network showed that SSR gives message selection flexibility that improves network performance by balancing the network traffic in both global and local scopes. This paper evaluates the speculative selection function on 2D torus network with simulation. The simulation compares the network throughput and latency with various traffic patterns. The visualization graphs show how the speculative selection eliminates hotspots and disperses traffic in the global scope. The simulation results demonstrate that by using speculative selection, the network performance is increased by around 7%. Compared to the mesh network, the torus's version has smaller gain due to the high performance nature of the torus network.

This paper proposes the use of the ratio of wavelet extrema numbers taken from the horizontal and vertical counts respectively as a texture feature, which is called aspect ratio of extrema number (AREN). We formulate the classification problem upon natural and synthesized texture images as an optimization problem and develop a coevolving approach to select both scalar wavelet and multiwavelet feature spaces of greater discriminatory power. Sequential searches and genetic algorithms (GAs) are comparatively investigated. The experiments using wavelet packet decompositions with the innovative packet-tree selection scheme ascertain that the classification accuracy of coevolutionary genetic algorithms (CGAs) is acceptable enough.

This paper presents a local learning framework in which the local classifiers can be pre-learned and the support size of each classifier can be selected to minimize the error bound. The proposed algorithm is compared with the conventional support vector machine (SVM). Experimental results show that our scheme using the user-defined parameters C and σ is more accurate and less sensitive than the conventional SVM.

A method is presented for selecting items asked for new users to input their preference rates on those items in recommendation systems based on the collaborative filtering. Optimal item selection is formulated by an integer programming problem and we solve it by using a kind of the Hopfield-network-like scheme for interior point methods.

This paper proposes a novel feature selection method for the fuzzy neural networks and presents an application example for 'personalized' facial expression recognition. The proposed method is shown to result in a superior performance than many existing approaches.

In this letter, adaptive modulation and coding (AMC) is combined with multiple input multiple output (MIMO) multiplexing to improve the throughput performance of AMC. In addition, a system that adopts selection transmit diversity (STD) in the AMC-MIMO multiplexing system, AMC-STD-MIMO multiplexing system, is proposed. STD in our simulation selects 2 transmission antennas from 4 antennas and AMC-MIMO multiplexing process operates with the selected antennas. The computer simulation is performed in a flat Rayleigh fading channel. The results show that the proposed AMC-STD-MIMO multiplexing system achieves the SNR gain of 4.0 dB, compared to the AMC-MIMO multiplexing system at 3 Mbps throughput.

We have proposed a new low-IF transceiver architecture to simultaneously achieve both a small chip area and good minimum input sensitivity. The distinctive point of the receiver architecture is that we replace the complicated high-order analog filter for channel selection with the combination of a simple low-order analog filter and a sharp digital band-pass filter. We also proposed a high-speed convergence AGC (automatic gain controller) and a demodulation block to realize the proposed digital architecture. For the transceiver, we further reduce the chip area by applying a new form of direct modulation for the VCO. Since conventional VCO direct modulation tends to suffer from variation of the modulation index with frequency, we have developed a new compensation technique that minimizes this variation, and designed the low-phase noise VCO with a new biasing method to achieve large PSRR (power-supply rejection ratio) for oscillation frequency. The test chip was fabricated in 0.35-µm BiCMOS. The chip size was 3 3 mm2; this very small area was realized by the advantages of the proposed transceiver architecture. The transceiver also achieved good minimum input sensitivity of -85 dBm and showed interference performance that satisfied the requirements of the Bluetooth standard.

The rapid spread of cellular phones in recent years has facilitated not only voice communication but also Internet access via the cellular phone system, and in addition, subscriber demand has led to a diversification in the services provided. One service in high demand is the seamless use of cellular phones in both public and private wireless network areas. In the data world, there is already such an application in the form of public and private use of wireless LAN. However, an increase in the number of users would require the realization of low-cost, easy-to-install very small base stations (VSBS) that use the frequency band efficiently in order to allow private use of ordinary cellular phones. To bring such VSBS into effect, a technology that autonomously selects frequencies which do not interfere with the public communication system from out of the publicly used frequency band is essential for turning such VSBS into reality. This paper proposes a frequency selection algorithm that actively uses cellular phone features such as frequency selection and received signal level measurement, and discusses the results of verification experiments.

This paper proposes the constraint availability and bandwidth shortest path (CABSP) selection algorithm and the extension of the adaptive modulation scheme to the CABSP (CABSP-AM) selection algorithm in the millimeter-wave (MMW) broadband entrance network for wireless heterogeneous systems. The CABSP algorithm considers the availability denoted as the quality of the MMW which is severely affected by the rainfall. The CABSP-AM algorithm, moreover, is proposed to further make more efficient use of bandwidth resources by considering the QoS requirements of each class of service in multimedia communication. As the results, the CABSP algorithm yields higher throughput performance than the conventional constraint shortest path (CSP) selection algorithm, but lower than the CABSP-AM algorithm. The spectrum efficiency improvements of the CABSP-AM over the CABSP are about 1.36 and 1.48 fold in case of error sensitive and non-sensitive classes respectively.