Adaptive transmission methods improve the performance of wireless communication system by adjusting parameters like modulation, code-rate, and power depending on the channel state adaptively. In this letter, we consider the adaptive code-rate OFDM system in which code-rate of each subcarrier is adapted optimally. RCPC code is used to obtain different code-rate for each subcarrier. Performance analysis shows that 3-6 dB SNR gain or up to 30-50% data rate increase is achieved at bit error rate 10-6.

In this letter two noise-predictive equalization schemes, which are based on zero-forcing (ZF) and minimum mean square error (MMSE) criteria, are presented for unique-word (UW) based single-carrier systems. The correlation properties of the noises in the outputs of the frequency domain equalizer are exploited to predict and cancel the noise contained in the estimation of data. Theoretical analyses show that both of the proposed techniques perform better than the conventional frequency domain equalizers. Simulation results have confirmed the significant performance improvement they could achieve.

Real-time object detection or recognition technology becomes more important for various intelligent vision systems. Processing models for object detection or recognition from natural images should tolerate pattern deformations and pattern position shifts. The hierarchical convolutional neural networks are considered as a promising model for robust object detection/recognition. This model requires huge computational power for a large number of multiply-and-accumulation operations. In order to apply this model to robot vision or various intelligent real-time vision systems, its LSI implementation is essential. This paper proposes a new algorithm for reducing multiply-and-accumulation operation by sorting neuron outputs by magnitude. We also propose an LSI architecture based on this algorithm. As a proof of concept for our LSI architecture, we have designed, fabricated and tested two test LSIs: a sorting LSI and an image-filtering LSI. The sorting LSI is designed based on the content addressable memory (CAM) circuit technology. The image-filtering LSI is designed for parallel processing by analog circuit array based on the merged/mixed analog-digital approach. We have verified the validity of our LSI architecture by measuring the LSIs.

Orthogonal frequency division multiplexing (OFDM) has been adopted in the physical layer of IEEE802.11a WLAN standard. In this letter, an efficient diversity scheme is presented for better frequency synchronization in the OFDM-based WLAN. The diversity scheme utilizes a two-stage approach to effectively enhance the performance of frequency synchronization. Simulation results indicate that using the algorithm, the performance can significantly be improved in 802.11a WLAN systems.

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.

Uncertainty within one-wavelength (λ) is inevitable in an ultrasound positioning system that measures the time of flight of ultrasound pulses especially when a simple comparator is used for pulse detection. This paper proposes a compensation scheme based on pulse period adjustment. The test results show that the proposed scheme efficiently eliminates the 1λ-deviation and provides improved distance measurement.

A new class of ternary sequence with a zero-correlation zone is introduced. The proposed sequence sets have a zero-correlation zone for both periodic and aperiodic correlation functions. The proposed sequences can be constructed from a pair of Hadamard matrices of size n0n0 and a Hadamard matrix of size n1n1. The constructed sequence set consists of n0 n1 ternary sequences, and the length of each sequence is (n1+1) for a non-negative integer m. The zero-correlation zone of the proposed sequences is |τ|≤ -1, where τ is the phase shift. The sequence member size of the proposed sequence set is equal to times that of the theoretical upper bound of the member size of a sequence set with a zero-correlation zone.

A reduced-sample-rate (RSR) sigma-delta-pipeline (SDP) analog-to-digital converter architecture suitable for high-resolution and high-speed applications with low oversampling ratios (OSR) is presented. The proposed architecture employs a class of high-order noise transfer function (NTF) with a novel pole-zero locations. A design methodology is developed to reach the optimum NTF. The optimum NTF determines the location of the non-zero poles improving the stability of the loop and implementing the reduced-sample-rate structure, simultaneously. Unity gain signal transfer function to mitigate the analog circuit imperfections, simplified analog implementation with reduced number of operational transconductance amplifiers (OTAs), and novel, aggressive yet stable NTF with high out of band gain to achieve larger peak signal-to-noise ratio (SNR) are the main features of the proposed NTF and ADC architecture. To verify the usefulness of the proposed architecture, NTF, and design methodology, two different cases are investigated. Simulation results show that with a 4th-order modulator, designed making use of the proposed approach, the maximum SNDR of 115 dB and 124.1 dB can be achieved with only OSR of 8, and 16 respectively.

Time-frequency-selective, i.e., time-variant multipath, fading in orthogonal frequency division multiplexing (OFDM) systems destroys subcarrier orthogonality, resulting in intercarrier interference (ICI). In general, the previously proposed estimation schemes to resolve this problem are only applicable to slowly time-variant channels or suffer from high complexity due to large-sized matrix inversion. In this letter, we propose and develop efficient symbol estimation schemes, called the iterative sequential neighbor search (ISNS) algorithm and the simplified iterative sequential neighbor search (S-ISNS) algorithm. These algorithms achieve enhanced performances with low complexities, compared to the existing estimation methods.

Content-based publish/subscribe systems provide a useful alternative to traditional address-based communication due to their ability to decouple communication between participants. It has remained a challenge to design a scalable overlay supporting the complexity of content-based networks, while satisfying the desirable properties large distributed systems should have. This paper presents the design of Mirinae, a new structured peer-to-peer overlay mesh based on the interests of peers. Given an event, Mirinae provides a flexible and efficient dissemination tree minimizing the participation of non-matching nodes. We also present a novel ID space transformation mechanism for balancing routing load of peers even with highly skewed data, which is typical of the real world. Our evaluation demonstrates that Mirinae is able to achieve its goals of scalability, efficiency, and near-uniform load balancing. Mirinae can be used as a substrate for content-search and range query in other important distributed applications.

In this paper, we develop a new distributed adaptive power control framework for multi-cell OFDM systems based on the game theory. A specific utility function is defined considering the users' achieved average utility per power, i.e., power unit based utility. We solve the subcarrier allocation issue naturally as well as the power control. Each user tries to maximize its utility by adjusting the transmit power on each subcarrier. A Nash equilibrium for the game is shown to exist and the numerical results show that our proposal outperforms the pure water-filling algorithm in terms of efficiency and fairness.

Our investigation is presented into analysis of the co-channel interference (CCI) statistic in orthogonal frequency-division multiple access (OFDMA) uplink systems. The derived statistic is then used to analyze the performance of reuse partitioning (RP)-based dynamic channel allocation (DCA). Analysis and simulation results show that the performance of DCA in multi-cell environments is noticeably dependent on the CCI. Finally, the results of the analysis yield the optimum RP area for achieving the maximum spectral efficiency.

Electrical capacitance tomography (ECT) is used to obtain information about the distribution of a mixture of dielectric materials inside a vessel or pipe. ECT has several advantages over other reconstruction algorithms and has found many applications in the industrial fields. However, there are some difficulties with image reconstruction in ECT: The relationship between the permittivity distribution and measured capacitance is nonlinear. And inverse problem is ill-posed so that the inverse solution is sensitive to measurement error. To cope with these difficulties iterative image reconstruction algorithms have been developed. In general, the iterative reconstruction algorithms in ECT have comparatively good-quality in reconstructed images but result in intensive computational burden. This paper presents the iterative image reconstruction algorithm for ECT that can enhance the speed of image reconstruction without degradation in the quality of reconstructed image. The main contribution of the proposed algorithm is new weighting matrices, which are obtained by the interpolation of the grouped electrical field centre lines (EFCLs). Extensive simulation results have demonstrated that proposed algorithm provides improved reconstruction performance in terms of computational time and image quality.

The most of conventional information services are based on the implicit premise that the users has already defined their desired information. This study proposes a mobile information service that allows the users who have not yet defined their desired information or whose desired information varies according to the situation to get appropriate information. When the user can specify their desired information to the system explicitly, the authors develop a "Pull" service. Conversely, when the user cannot verbally specify their desired information to the system, this study provides "Push" service and "Don't disturb" option for the user who does not welcome this service. This study considers the characteristics of the environment of mobile terminal to focus on "Time", "Place" and user's "Preference": long term and short term preference. This study also creates rules, algorithms and filtering to the service. Furthermore, the results of experiments have been discussed to verify the idea that different of user desired requires different information services.

The purpose of the study is to obtain the automatic and optimal matching between a motion-measurement device such as a data glove and an output device such as a dexterous robot hand, where there are many differences in the numbers of degree of freedom, sensor and actuator positions, and data format, by means of motion imitation by the humans. Through the algorithm proposed here, a system engineer or user need no labor of determining the values of gains and parameters to be used. In the system, a subject with data glove imitated the same motion with a dexterous robot hand which was moving according to a certain mathematical function. Autoregressive models were adapted to the matching, where each joint angle in the robot and data glove data of the human were used as object and explanatory variables respectively. The partial regression coefficients were estimated by means of singular value decomposition with a system-noise reduction algorithm utilizing statistical properties. The experimental results showed that the robot hand was controlled with high accuracy with small delay, suggesting that the method proposed in this study is proper and easy way and is adaptive to many other systems between a pair of motion-measurement device and output device.

In this paper, we propose a robust timing synchronization algorithm for wireless MAN OFDM systems. The proposed algorithm is composed of frame synchronization and FFT timing synchronization. The conventional correlation scheme for estimation of timing offset has an ambiguity in the detection of accurate symbol timing. The proposed scheme, however, shows a clear peak at the correct timing by using the conjugate-symmetric characteristic of preamble and is able to control the FFT window position continuously with the 1-st order loop filter. Simulation results demonstrate the superiority of the proposed algorithm.

This paper proposes a metric for example matching under the example-based machine translation. Our metric served as similarity measure is employed to retrieve the most similar examples to a given query. Basically it makes use of simple information such as lemma and part-of-speech information of typographically mismatched words. In addition, it uses the contiguity information of matched word units to catch the full context. Finally we show the results for the correctness of the proposed metric.

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.

The hand posture estimation system by searching a similar image from a vast database, such as our previous research, may cause the increase of processing time, and prevent realtime controlling of a robot. In this study, the authors proposed a new estimation method of human hand posture by rearranging a large-scale database with the Self-Organizing Map including self-reproduction and self-annihilation, which enables two-step searches of similar image with short period of processing time, within small errors, and without deviation of search time. The experimental results showed that our system exhibited good performance with high accuracy within processing time above 50 fps for each image input with a 2.8 GHz CPU PC.

In this paper, an automated computer-aided-detection scheme is proposed to identify and locate the suspicious masses in the abnormal breasts from the full mammograms. Mammograms are examined using a four-stage detection method including pre-processing, identification of local maxima, seeded region-growing, and false positive (FP) reduction. This method has been applied to the entire Mammographic Image Analysis Society (MIAS) database of 322 digitized mammograms containing 59 biopsy-proven masses in 56 images. Results of detection show 95% true positive (TP) fraction at 1.9 FPs per image for the 56 images and 1.3 FPs per image for the entire database.