Orthogonal space-time block codes (STBCs) appear to be a very fascinating means of enhancing reception quality in quasi-static MIMO channels due to their full diversity, and especially their simple maximum-likelihood (ML) decoders. However, full-rate full-diversity orthogonal STBCs do not exist for more than two transmit antennas. Vertical layered space-time architecture (so-called the V-BLAST) with a nulling- and cancelling-based detection algorithm, in contrast, has an ability of achieving high transmission rates at the cost of having very low diversity gain, an undesirable consequence caused by the interference nulling and cancelling processes. The uncoded V-BLAST system is able to reach its ML performance with the aid of the sphere decoder algorithm at the expense of higher detection complexity. Undoubtedly, the tradeoff between transmission rates, diversity, and complexity is inherent in designing space-time codes. This paper investigates a method to increase the "nulling diversity gains" for a general high-rate space-time code and introduces a new design strategy for high-rate space-time codes detected based on interference nulling and cancelling processes, thanks to which high-rate quasi-orthogonal space-time codes for MIMO applications are proposed. We show that when nT transmit and nR=nT receive antennas are deployed, the first code offers a transmission rate of (nT-1) with a minimum nulling diversity order of 3, whereas the second one offers a transmission rate of (nT-2) with a minimum nulling diversity order of 5. Therefore, the proposed codes significantly outperform the V-BLAST as nR=nT. Simulation results and discussions on the performance of the proposed codes are provided.

For multiple-channel active noise control (ANC) systems, distributed systems consisting of more than one controller are useful. In this paper, we propose a performance improvement algorithm for the distributed multiple-channel ANC system based on the simultaneous equations method. In the proposed algorithm, no estimation of error paths is required. This algorithm can provide good performance in canceling primary noises with auto-/cross-correlations and achieve stable noise reduction under a change of the error paths.

In this letter, we propose a closed-form joint space-time channel and direction of arrival (DOA) blind estimation algorithm for space-time coded MC-CDMA systems equipped with a uniform linear array (ULA) at the base station in frequency-selective fading environments. We prove that the signal subspaces defined by the receive data covariance matrix can be determinately separated into an equivalent set of signal subspaces spanned by the space-time channel vector of an individual user. From these signal subspaces, the space-time channels of multiple users are estimated using the subspace method.

This paper presents analysis results on finite-impulse response (FIR) channel estimation used for the equalization in Advanced Television Systems Committee digital television receivers. While channel estimation results have been effectively used for the equalization, the conditions of sufficient order and high signal-to-noise ratio (SNR) were assumed in most cases. To compensate for these unrealistic assumptions, we consider diverse probable conditions for channel estimation, such as reduced order and low SNRs, and then theoretically analyze each estimation case. The analysis shows that the adaptive FIR channel estimator provides an unbiased estimation and matches well its corresponding channel coefficients irrespective of the number of taps of the estimator and the non-causality of the unknown channel. Simulation results verify our analysis on the estimation of terrestrial DTV channels.

Many image and video compression algorithms work by splitting the image into blocks and producing variable-length code bits for each block data. If variable-length code data are transmitted consecutively over error-prone channel without any error protection technique, the receiving decoder cannot decode the stream properly. So the standard image and video compression algorithms insert some redundant information into the stream to provide some protection against channel errors. One of such redundancy is resynchronization marker, which enables the decoder to restart the decoding process from a known state in the event of transmission errors, but its frequent use should be restricted not to consume bandwidth too much. The Error Resilient Entropy Code (EREC) is well known method which can regain synchronization without any redundant information. It can work with the overall prefix codes, which many image compression methods use. This paper proposes an improvement to FEREC (Fast Error-Resilient Entropy Coding). It first calculates initial searching position according to bit lengths of consecutive blocks. Second, initial offset is decided using statistical distribution of long and short blocks, and initial offset is adjusted to insure all possible offset value can be examined. The proposed algorithm can speed up the construction of EREC slots, and can preserve compressed image quality in the event of transmission errors. The simulation result shows that the quality of transmitted image is enhanced about 0.3-3.5 dB compared with the existing FEREC when random channel error happens.

In this paper, the channel segregation dynamic channel allocation (CS-DCA) scheme is applied to a multi-hop DS-CDMA virtual cellular network (VCN). After all multi-hop routes are constructed over distributed wireless ports in a virtual cell, the CS-DCA is carried out to allocate the channels to multi-hop up and down links. Each wireless port is equipped with a channel priority table. The transmit wireless port of each link initiates the CS-DCA procedure and selects a channel among available ones using its channel priority table to check. In this paper, the channel allocation failure rate is evaluated by computer simulation. It is shown that CS-DCA reduces remarkably the failure rate compared to FCA. The impact of propagation parameters on the failure rate is discussed.

In this letter, we propose a recursive space time decoding method for orthogonal frequency division multiplexing (OFDM) systems exploiting multiple transmit antenna diversity when the channels are fast fading. We first develop a computationally efficient space-time decoding method involving a matrix inversion to mitigate the channel variation effect. We then further reduce the computational complexity of the matrix inversion decoding method via a recursive formulation. Computer simulation results show that the proposed recursive decoding has much better BER performance than Alamouti decoding, requiring much less computation than the matrix inversion decoding. Moreover, the relative advantage in BER performance of the proposed scheme over Alamouti decoding stands out as the Doppler frequency increases.

In recent years, Pre-Rake combining technique has become a hot topic of research as it decreases the complexity of the portable mobile unit, while achieving the same multipath diversity effect of the Rake receiver. The technique is based on precoding of the transmitted signal relying on knowledge of the channel estimation response before transmission. This a priori channel state information is available in Time Division Duplexing (TDD) systems, since the same channel is used both in uplink and downlink. In practice, the error in channel estimation in Pre-Rake system occurs due to time variability in mobile radio channel. Most previous works on Pre-Rake in TDD CDMA have not taken into consideration the effect of imperfect channel estimation. In this paper, we present Pre-Rake performance under imperfect channel estimation due to time variability in TDD system, depending on Doppler Frequency and compare it with the ideal Pre-Rake system. Numerical analysis and computer simulations were carried out to obtain the system error probability.

We propose a rapid and reliable signal acquisition scheme for UWB (Ultra Wide Band) systems in indoor wireless environments. The proposed scheme is a two-step search with different thresholds and search windows, where each step utilizes the single-dwell search with the bit reversal. Simulation results show that the proposed scheme for the UWB signals can achieve significant reduction of the required mean acquisition time as compared to other schemes including general double-dwell search scheme for various threshold levels. Furthermore, it is also observed that the proposed scheme can achieve much faster and reliable signal acquisition as the first threshold is larger in noisy environments.

An asymmetric Dual Metal Stack Gate (DMSG) SOI MOSFET transistor has been investigated for its enhanced electrical characteristics. A 2-D physical model has been proposed and its results have been confirmed by those obtained by simulation. These results predict better short channel effects such as drain induced barrier lowering (DIBL) characteristics and hot carrier effects for this device compared to those for conventional SOI MOSFETs. The effects of the Stacked Gate (SG) and Dual Metal Gate (DMG) structures on short channel effects are compared. It has been observed that SG reduces DIBL significantly, while DMG prevents the normal roll-off of the threshold voltage reduction.

The discovery of the Turbo codes has driven research on the creation of new signal detection concepts that are, in general, referred to as the Turbo approach. Recently, this approach has made a drastic change in creating signal detection techniques and algorithms such as equalization of inter-symbol interference (ISI) experienced by broadband single carrier signaling over mobile radio channels. A goal of this paper is to provide readers with broad views and knowledge of the Turbo concept-based Multiple-Input Multiple-Output (MIMO) signal transmission techniques. How the techniques have been developed in various applications and how they perform in real-field environments are introduced.

In this paper a new adjacent channel interference (ACI) cancellation scheme for multi-channel signal reception with low-IF receivers is investigated through the experiment. In the low-IF receivers, the signal in the mirror frequency causes interference to the desired signal. In the proposed analog-digital signal processing scheme, channel selection is made by analog complex band pass filter and the signal is reconstruct by Wiener filter to eliminate the interference effect in order to improve the performance.

Side channel attacks (SCA) are serious attacks on mobile devices. In SCA, the attacker can observe the side channel information while the device performs the cryptographic operations, and he/she can detect the secret stored in the device using such side channel information. Ha-Moon proposed a novel countermeasure against side channel attacks in elliptic curve cryptosystems (ECC). The countermeasure is based on the signed scalar multiplication with randomized concept, and does not pay the penalty of speed. Ha-Moon proved that the countermeasure is secure against side channel attack theoretically, and confirmed its immunity experimentally. Thus Ha-Moon's countermeasure seems to be very attractive. In this paper we propose a novel attack against Ha-Moon's countermeasure, and show that the countermeasure is vulnerable to the proposed attack. The proposed attack utilizes a Markov chain for detecting the secret. The attacker determines the transitions in the Markov chain using side channel information, then detects the relation between consecutive two bits of the secret key, instead of bits of the secret key as they are. The use of such relations drastically reduces the search space for the secret key, and the attacker can easily reveal the secret. In fact, around twenty observations of execution of the countermeasure are sufficient to detect the secret in the case of the standard sizes of ECC. Therefore, the single use of Ha-Moon's countermeasure is not recommended for cryptographic use.

We have developed a model for circuit-simulation which describes the MOSFET region from pinch-off to drain contact based on the surface potential. The model relates the surface-potential increase beyond the pinch-off point to the channel/drain junction profile by applying the Gauss law with the assumption that the lateral field is greater than the vertical one. Explicit equations for the lateral field and the pinch-off length are obtained, which take the potential increase in the drain overlap region into account. The model, as implemented into a circuit simulator, correctly reproduces measured channel conductance and overlap capacitance for 100 nm pocket-implant technologies as a function of bias condition and gate length.

In this paper, a new 2-antenna transmit diversity, called orthogonal space-time spreading transmit diversity (OSTSTD) combined with delay transmission, is proposed. At the transmitter, N data symbols to be transmitted are spread using N different orthogonal space-time spreading codes (each represented by NN matrix) and are transmitted from two transmit antennas after adding different time delays. At the receiver, 2-step space-time despreading is carried out to recover the N transmitted data symbols. The first step recovers the N orthogonal spatial channels by taking the correlation between the received space-time spread signal and the time-domain spreading codes. The second step recovers the N transmitted data symbols using minimum mean square error (MMSE) despreading. The average bit error rate (BER) performance in a Rayleigh fading channel is evaluated by computer simulation. It is confirmed that the OSTSTD provides better BER performance than the Alamouti's space-time transmit diversity (STTD) at the cost of transmission time delay.

In the cellular mobile communication systems, co-channel interference and Rayleigh fading degrade the transmission performance. Adaptive Array Antenna (AAA) can suppress interference and, at the same time, can cope with multi-path fading by using a wide antenna spacing resulting in low correlation of received signals in each antenna element. A feedback-type AAA was proposed for frequency division duplexed (FDD) systems, where mobile station measures channel characteristics and feed-backs them to the base station. In this paper, we extend the system by introducing 2-branch diversity reception at a mobile station, and study the influence of antenna element spacing at the base station and control delay time on bit error rate performance under a realistic propagation model.

This paper proposes a novel frequency-domain channel estimator which mitigates the effects of ICI by jointly finding the frequency offset and channel frequency response (CFR). A binary search algorithm is used to find the present frequency offset and CFR jointly. The variance of the jointly estimated frequency offset is found to be very close to the Cràmer-Rao lower bound.

By using multiple transmit antennas, wireless systems have a large capacity in time-varying multipath fading channels. Space-time block code (STBC), space-frequency block code (SFBC), and space-time-frequency (STF) block code are well-known techniques in transmitter diversity schemes. While the SFBC (or the STF block coded) system gives full diversity at frequency-nonselective channels, it breaks down when used in a frequency-selective environment. This is because the SFBC (or the STF block code) scheme disregards frequency selectivity of the channel by assuming that channel frequency responses (CFRs) at adjacent subcarriers are the same. In this paper, we propose efficient channel estimation and symbol decoding methods, which consider the difference between CFRs at the adjacent subcarriers of the SFBC (or the STF block coded) orthogonal frequency division multiplexing (OFDM) system in multipath fading channels. The proposed method gives initial channel information by designing a simple training symbol, and the CFRs at all the subcarriers and the differences between the CFRs are easily calculated by using an interpolation method or a discrete Fourier transform (DFT) operation.

The XTR public key cryptosystem was introduced in 2000. XTR is suitable for a variety of environments including low-end smart cards, and is regarded as an excellent alternative to RSA and ECC. Moreover, it is remarked that XTR single exponentiation (XTR-SE) is less susceptible than usual exponentiation routines to environmental attacks such as the timing attack and the differential power analysis (DPA). This paper investigates the security of side channel attack (SCA) on XTR. In this paper, we show the immunity of XTR-SE against the simple power analysis if the order of the computation of XTR-SE is carefully considered. In addition, we show that XTR-SE is vulnerable to the data-bit DPA, the address-bit DPA, the doubling attack, the modified refined power analysis, and the modified zero-value attack. Moreover, we propose some countermeasures against these attacks. We also show experimental results of the efficiency of the countermeasures. From our implementation results, if we compare XTR with ECC with countermeasures against "SCAs," we think XTR is as suitable to smart cards as ECC.

Two rotational transformations are used to derive a new expression for the symbol error probability (SEP) of an M-ary phase shift keying (MPSK) with an I-Q unbalance over additive white Gaussian noise (AWGN) and Rician fading channels. We used the new expression to investigate the effect of the I-Q unbalance on the MPSK SEP performance. Our investigation confirms that this approach is a convenient way to evaluate the average SEP of an MPSK for various cases of the Rician factor.