In orthogonal frequency-division multiplex access (OFDMA) downlink systems, the carrier-frequency offset (CFO) between the multiple transceivers introduces inter-carrier interference (ICI). In this letter, we propose an iterative precoding scheme to suppress the ICI due to CFO. This scheme is applied at the transmitter, and can jointly cancel the ICI for all the receivers. Moreover, by the studies of the convergence behavior of the iterations, a sufficient condition for the convergence is presented. The theoretical analysis and simulation results both show that this iterative scheme is equivalent to the zero-forcing (ZF) scheme in function, but with much lower complexity.

In this letter we introduce new generalized cyclotomic sequences of order two and length pq firstly, then we determine the linear complexity and autocorrelation values of these sequences. Our results show that these sequences are rather good from the linear complexity viewpoint.

Steganographic methods usually produce distortions in cover images due to the process of embedding secret bits. These distortions are hard to remove, and thus the cover image cannot be recovered. Although the distortions are always small, they cannot be allowed for some sensitive applications. In this paper, we propose a reversible embedding scheme for VQ-compressed images, which allows the original cover image to be completely recovered after the extraction of the secret bits. The embedded payload in the proposed method comprises the secret bits plus the restoration information. In order to reduce the size of payload, we utilized the spatial correlations in the image as the restoration information and then compressed the correlations by a lossless compression method. In addition, an alternative pairing method for codewords was proposed to improve the stegoed image quality and control the embedding capacity. Experimental results showed that the proposed method has the benefit of high efficiency of the steganographic process, high image quality, and adaptive embedding capacity compared with other schemes.

There is an increasing requirement for supporting complex multidimensional queries in Peer-to-Peer systems. In the centralized spatial database world, R-Trees and its variant structures are widely accepted due to their capabilities to manage complex multidimensional queries. In this paper, we propose a new multidimensional indexing structure for P2P systems, called Distributed Hilbert R-Trees (DHR-Trees), in which peers organize themselves into an overlay network, dynamically maintain routing tables with region information and collaboratively execute complex multidimensional queries, such as range query and k-nearest neighbors query, efficiently. DHR-Trees has similar topology to the P-Trees P2P system. The peers' routing tables are enhanced with spatial region information, which allow multidimensional query predicates to be adapted into P2P systems with minor modification. The structure design and two major multidimensional query algorithms are presented. Our experimental results demonstrate that it performs well on range queries and k-nearest neighbors queries with multidimensional data set.

A cyclic prefix reconstruction scheme is proposed for precoded single-carrier systems with frequency-domain equalization (SC-FDE) that employ insufficient length of cyclic prefix. For SC-FDE, cyclic prefix is employed to facilitate frequency-domain equalization at the receiver. Since inserting cyclic prefix incurs a loss in bandwidth-utilization efficiency, it is desirable to limit the length of cyclic prefix for SC-FDE. This paper designs the energy spreading transform (EST), a precoder that enables iterative reconstruction of missing cyclic prefix. The performance of the proposed scheme is shown to be close to that of SC-FDE with enough length of cyclic prefix.

Self-Clocked Fair Queueing (SCFQ) and Credit-Based Fair Queueing (CBFQ) are well-known fair scheduling schemes for packet-switched network. In this paper, it is shown that SCFQ and CBFQ are equivalent in selecting packets to transmit. For this, we modified the per-packet service tag based SCFQ algorithm to an equivalent per-session service tag based algorithm, SCFQ+, and showed that the service tags for SCFQ+ and CBFQ evolve identically.

The modified covariance (MC) method provides a computationally attractive and closed-form solution for frequency estimation of a single real sinusoid. In this paper, the performance measures of the MC estimator, namely, mean and mean square error, are derived in closed-form and confirmed by computer simulations.

This paper proposes a design method of a Doherty amplifier, which can determine the most efficient backed-off point of the amplifier by adjusting a load modulation parameter. The parameter is defined through the design of output transmission line of a carrier and a peak amplifier using a virtual open stub technique. This paper describes the design results using the technique to optimize efficiency of a Doherty amplifier for an orthogonal frequency division multiplexing (OFDM) signal, and parameter adjustment for a linearized Doherty amplifier using an adaptive digital predistortion (ADPD). Applying this method, the developed 250 W ADPD Doherty amplifier has achieved drain efficiency of 43.4% and intermodulation (IM) distortion of -48.3 dBc with output power of 44.1 dBm (10.1 dB output backed-off) at 563 MHz using an OFDM signal for integrated services digital broadcasting-terrestrial (ISDB-T).

The trend of microwave circuits has been toward highly integrated systems. Most design tools for designing microwave circuits mounted the linear or the nonlinear devices adopt the fundamental circuit theory using the S matrix on the frequency domain. The harmonic balance method is also used to correspond to the nonlinear circuit. Therefore, the effect of the electromagnetic field, for example, a mutual coupling between sub-circuits through the space is almost disregarded. To calculate these circuits included its surrounding electromagnetic field, the finite difference time domain method combined with the equivalent circuit simulation had been presented as the lumped element FDTD (LE-FDTD) method. In general, even if an analytical target is a linear circuit, the FDTD method requires very long analytical time. In this paper, we propose an efficient LE-FDTD method to reduce the analytical time. We investigate its efficiency to compare with the conventional LE-FDTD method or measurements, consequently, it is confirmed that the proposal method requires only at analytical time of 1/10 compared with the conventional method. We also show that the proposal method is able to analyze characteristics of the active integrated antenna (AIA) which are practicably impossible to analyze by using the conventional method.

In digital transmission and storage systems, sequences must have attributes that comply with the physical characteristics of the channel. These channel constraints can often be satisfied through constrained sequence coding techniques which avoid use of sequences that violate the given channel constraints. In the design of a constrained code, it is usually helpful to consider the PSD of the encoded sequence in order to ensure that PSD requirements are met, and to obtain an indication of bandwidth, response at dc, average power peaks, and other spectral characteristics of interest. In this paper, we introduce an approach for the construction of finite-state sequential machine (FSSM) modeled encoders to satisfy spectral requirements. This approach involves construction of either a Mealy or a Moore FSSM to represent the encoder, and evaluation of the state transition probabilities and codeword values such that the PSD of the designed code meets a predefined spectral shape. Examples in this paper demonstrate the usefulness of this approach.

In this letter, we present a blind carrier frequency offset (CFO) estimator by exploiting the subspace-based technique for multicarrier-code division multiple access (MC-CDMA) systems. Relative high accuracy and low-complexity to the CFO estimation can be achieved by rooting a polynomial. Simulation results are provided for illustrating the effectiveness of the proposed blind polynomial rooting estimator.

In statistical pattern recognition, it is important to estimate the distribution of patterns precisely to achieve high recognition accuracy. In general, precise estimation of the parameters of the distribution requires a great number of sample patterns, especially when the feature vector obtained from the pattern is high-dimensional. For some pattern recognition problems, such as face recognition or character recognition, very high-dimensional feature vectors are necessary and there are always not enough sample patterns for estimating the parameters. In this paper, we focus on estimating the distribution of high-dimensional feature vectors with small number of sample patterns. First, we define a function, called simplified quadratic discriminant function (SQDF). SQDF can be estimated with small number of sample patterns and approximates the quadratic discriminant function (QDF). SQDF has fewer parameters and requires less computational time than QDF. The effectiveness of SQDF is confirmed by three types of experiments. Next, as an application of SQDF, we propose an algorithm for estimating the parameters of the normal mixture. The proposed algorithm is applied to face recognition and character recognition problems which require high-dimensional feature vectors.

In order to prepare the health care industry for an increasingly aging society, a ubiquitous health care infrastructure is certainly needed. In a ubiquitous computing environment, it is important that all applications and middleware should be executed on an embedded system. To provide personalized health care services to users anywhere and anytime, a context-aware framework should convert low-level context to high-level context. Therefore, ontology and rules were used in this research to convert low-level context to high-level context. In this paper, we propose context modeling and context reasoning in a context-aware framework which is executed on an embedded wearable system in a ubiquitous computing environment for U-HealthCare. The objective of this research is the development of the standard ontology foundation for health care services and context modeling. A system for knowledge inference technology and intelligent service deduction is also developed in order to recognize a situation and provide customized health care service. Additionally, the context-aware framework was tested experimentally.

Orthogonal frequency division multiplexing (OFDM) is an attractive technique to accomplish wired or wireless broadband communications. Since it has been adopted as the terrestrial digital-video-broadcasting standard in Europe, it has also subsequently been embedded into many broadband communication standards. Many techniques for frame timing and frequency synchronization of OFDM systems have been studied as a result of its increasing importance. We propose a new technique of simultaneously synchronizing frame timing and frequency utilizing matched filters. First, a new short preamble consisting of short sequences multiplied by a DBPSK coded sequence is proposed. Second, we show that the new short preamble results in a new structure for matched filters consisting of a first matched filter, a DBPSK decoder, and a second matched filter. We can avoid the adverse effects of carrier frequency offset (CFO) when frame timing is synchronized because a DBPSK decoder has been deployed between the first and second matched filters. In addition, we show that the CFO can be directly estimated from the peak value of matched filter output. Finally, our simulation results demonstrate that the proposed scheme outperforms the conventional schemes.

The long-term bit error rate (BER) performance of partial response maximum likelihood (PRML) system using an adaptive equalizer in a perpendicular magnetic recording (PMR) channel with thermal decay is studied. A thermal decay model based on the experimental data giving the amplitude change of reproducing waveforms with the elapsed time for CoPtCr-SiO2 PMR medium is obtained. The BER performance of PR1ML channel for the 16/17(0,6/6) run-length-limited (RLL) code is evaluated by computer simulation using the model. The relationship between the ratio RJ of the jitter-like media noise power to the total noise power at the reading point and the required SNR to achieve a BER of 10-4 is also obtained and the performance is compared with that of the conventional equalization. The results show that the significant improvement in SNR by utilizing the adaptive equalization is recognized over all RJ compared with the conventional equalization.

This paper presents a novel stereophonic acoustic echo canceling scheme without preprocessing. To accurately estimate echo path keeping the high level of performance in echo erasing, this scheme uses two filters, of which one filter is utilized as a guideline which does not erases echo but helps updating of the other filter, which actually erases echo. In addition, we propose a new filter dividing technique to apply to the filter divide scheme, and utilize this as the guideline. Numerical examples demonstrate that the proposed scheme improves the convergence behavior compared to conventional methods both in system mismatch (i.e., normalized coefficients error) and Echo Return Loss Enhancement (ERLE).

In this paper we propose a cross-layer retransmission control for TCP communication over a wireless link. With our proposed control, a retransmission delay for lost packet is reduced, packet losses in the wireless link are eliminated and all packets are delivered in the correct order. No change is required to TCP itself or to the sender. Our proposed method is implemented in a queue between the media access control (MAC) layer and logical link layer in a base station, and is designed to assist local retransmission control in the MAC layer. Computer simulations show that our proposed method can maximally use the bandwidth of the wireless link under high bit error rates conditions with conventional TCP control. The fairness problem of TCP communication between connections with different bit error rates in a wireless link is also improved, and MAC level fairness is also controllable.

This paper proposes a design method for representing monochrome medical X-ray images on an electronic display. The required quantizing resolution of the input density and output voltage are theoretically clarified. The proposed method makes it easier to determine the required quantizing resolution which is important in a X-ray diagnostic system.

This paper considers reduction of the peak-to-average power ratio (PAPR) of M-quadrature amplitude modulation (QAM) signals in orthogonal frequency division multiplexing (OFDM) systems. It is known that a 16-QAM or 64-QAM constellation can be written as the vector sum of two or three QPSK constellations respectively. We can then use the Golay complementary sequences over Z4 to construct 16-QAM or 64-QAM OFDM sequences with low PAPR. In this paper, we further examine the squared Euclidean distance of these M-QAM sequences and their variations. Our goal here is to combine the block coded modulation (BCM) and Golay complementary sequences to trade off the PAPR, the code rate, and the squared Euclidean distance of M-QAM OFDM signals. In particular, some 16-QAM and 64-QAM OFDM sequences with low PAPR and large squared Euclidean distance are presented.

Using the recursive generalized eigendecomposition method, we develop a recursive form solution to the data least squares (DLS) problem in which the error is assumed to lie in the data matrix only. We apply it to a linear channel equalizer. Simulations shows that the DLS-based equalizer outperforms the ordinary least squares-based one in a channel equalization problem.