The subspace algorithm can be utilized for the blind detection of space-time block codes (STBC) without knowledge of channel state information (CSI) both at the transmitter and receiver. However, its performance degrades when the channels are correlated. In this letter, we analyze the impact of channel correlation from the orthogonality loss between the transmit signal subspace (TSS) and the statistical noise subspace (SNS). Based on the decoding property of the subspace algorithm, we propose a revised detection in favor of the channel correlation matrix (CCM) only known to the receiver. Then, a joint transmit-receive preprocessing scheme is derived to obtain a further performance improvement when the CCM is available both at the transmitter and receiver. Analysis and simulation results indicate that the proposed methods can significantly improve the blind detection performance of STBC over the correlated channels.

In this paper, we propose an adaptive data transmission scheme for DS/CDMA packet radio communication systems in bandlimited indoor multipath fading channels. We first analyze the relationship between the code rate and the processing gain (defined as the number of chips per coded bit) in maximizing the normalized throughput in connection with the channel state of the indoor multipath fading channels. One observation made is that the maximum throughput with BPSK modulation is attained when the code rate is chosen as low as possible irrespective of the channel state, and the processing gain is increased (decreased) as the channel becomes worse (better). The other observation made is that when DPSK modulation is employed, there exists an optimal combination of the code rate and the processing gain in maximizing the normalized throughput for each channel state. Based on these observations, we propose to adapt the processing gain and/or code rate according to the fading conditions in order to maximize the normalized throughput. We analyze the performance of the proposed scheme and compare it with the non-adaptive data transmission scheme. Our results show that the adaptive transmission scheme yields a significant performance improvement over the nonadaptive scheme, and increasing the adaptation level is more effective as the channel gets worse, but the 3-state adaptation seems to be practically optimum.

We present the approximated bit error rate (BER) performance of a binary phase shift keying (BPSK) modulated equal-gain combining (EGC) diversity receiver with phase noise over independent and non-identical Nakagami fading branches. The approximated BER becomes accurate with phase-locked loop (PLL) gain, K=20. Also, for special values of fading parameter, m, and branch number, L, we derived the closed form expression of the BER.

This letter proposes a robust detection scheme of orthogonal space-time block codes that face very fast fading channels. The proposed detection scheme employs a QR decomposition on the channel matrix and minimizes noise enhancement and impact of channel estimation errors which occur in a conventional detection scheme. It is shown by simulations that the proposed detection scheme outperforms the conventional detection scheme when the channel fading is very fast.

We investigate selection transmit multi-input multi-output systems where only a single transmit antenna is selected for the transmission and multiple receive antennas are employed for maximal ratio combining. Antenna selection is performed by a generalized selection criterion based on the ordinal number of the strength of the received signal-to-noise ratio.

Secret key agreement is a procedure for agreeing on a secret key by exchanging messages over a public channel when a sender, a legitimate receiver (henceforth referred to as a receiver), and an eavesdropper have access to correlated sources. Maurer [6] defined secret key capacity, which is the least upper bound of the key generation rate of the secret key agreement, and presented an upper and a lower bound for the secret key capacity. The advantage distillation capacity is introduced and it is shown that this quantity equals to the secret key capacity. Naive information theoretical expressions of the secret key capacity and the advantage distillation capacity are also presented. An example of correlated sources, for which an analytic expression of the secret key capacity can be obtained, is also presented.

This paper presents a test input data compression technique, Selective Low-Care Coding (SLC), which can be used to significantly reduce input test data volume as well as the external test channel requirement for multiscan-based designs. In the proposed SLC scheme, we explored the linear dependencies of the internal scan chains, and instead of encoding all the specified bits in test cubes, only a smaller amount of specified bits are selected for encoding, thus greater compression can be expected. Experiments on the larger benchmark circuits show drastic reduction in test data volume with corresponding savings on test application time can be indeed achieved even for the well-compacted test set.

In this letter, we propose a partial minimum mean-squared error (MMSE) with successive interference cancellation (PMMSESIC) method in frequency domain to mitigate ICI caused by channel variation. Each detection, the proposed method detects the symbol with the largest received signal-to-interference-plus-noise ratio (SINR) among all the undetected symbols, using an MMSE detector that considers only the interference of several neithborhood subcarriers. Analysis and simulations show that it outperforms the MMSE method at relatively high Eb/N0 and its performance is close to the MMSE with successive detection (MMSESD) method in relatively low Doppler frequency region.

Recently, a novel detector was proposed by the authors for code acquisition in non-Gaussian impulsive channels [3], which dramatically outperforms the conventional squared-sum detector; however, it requires exact knowledge of the non-Gaussian noise dispersion. In this paper, a robust detector is proposed, which employs the signs and ranks of the received signal samples, instead of their actual values, and so does not require knowledge of the non-Gaussian noise dispersion. The acquisition performance of the proposed detector is compared with that of the detector of [3] in terms of the mean acquisition time. The simulation results show that the proposed scheme is not only robust to deviations from the true value of the non-Gaussian noise dispersion, but also has comparable performance to that of the scheme of [3] using exact knowledge of the non-Gaussian noise dispersion.

In this letter, we study the capacity of fading channels with perfect channel side information (CSI) at the receiver and quantized CSI at the transmitter. We present a general algorithm for the joint design of optimal quantization and power control for maximizing the forward link capacity over flat fading channels. Numerical results for Rayleigh fading are given.

This paper investigates a modifying orthogonality factor for synchronous DS-CDMA uplink in dispersive Rician multipath fading channels, which reflects upon the effects of specular path power as well as decaying channel characteristics. Using this investigation, the orthogonal factors in indoor environments are evaluated and compared with the various parameters such as decaying factor, line-of-sight component, and the number of multipaths.

In this letter, new results on the BER performance of multitone DS-CDMA systems for transmissions over Nakagami-m fading channels with exponentially decaying multipath intensity profile are presented. The results show that, in viewpoint of the BER performance, there is a critical relation between the number of resolvable paths and the effect of the rate of average power decay.

This paper proposes two space-time joint channel parameter estimation and signal detection algorithms for downlink DS-CDMA systems with multiple-input-multiple-output (MIMO) wireless multipath fading channels. The proposed algorithms initially use the space-time MUSIC to estimate the DOA-delays of the multipath channel. Based on these estimated DOA-delays, a space-time channel decoupler is developed to decompose the multipath downlink channel into a set of independent parallel subchannels. The fading amplitudes of the multipath can then be estimated from the eigen space of the output of the space-time channel decoupler. With these estimated channel parameters, signal detection is carried out by a maximal ratio combiner on a pathwise basis. Computer simulations show that the proposed algorithms outperform the conventional space-time RAKE receiver while having the similar performance compared with the space-time minimum mean square error receiver.

In this letter, a joint estimation algorithm of Doppler spread and frequency offset for OFDM systems in Rayleigh fading channels is proposed based on the autocorrelation function between the last part of the received OFDM signal and its copy in guard interval. It is shown by computer simulations that the proposed algorithm performs well for different Doppler spread values and carrier frequency offsets.

This paper clarifies a necessary condition and a sufficient condition for transmissibility for a given set of general sources and a given general broadcast channel. The approach is based on the information-spectrum methods introduced by Han and Verdu. Moreover, we consider the capacity region of the general broadcast channel with arbitrarily fixed error probabilities if we send independent private and common messages over the channel. Furthermore, we treat the capacity region for mixed broadcast channel.

This paper proposes wavelet packets for use in ultra wideband communications. The pulse shapes that are generated are quasi orthogonal and have almost identical time duration. After normalization, an M-ary signaling set can be constructed allowing higher data rate. Finally, the performance of such a system when multipath propagation occurs is investigated by computer simulations. In order to combat multipath fading, a Rake receiver using coherent channel estimation is designed. This channel estimation is carried out using adaptive algorithms such as least-mean square (LMS), normalized least-mean square (NLMS), or recursive least square (RLS) algorithms which adapt the received signal given a reference signal.

Data broadcast has become a promising approach to achieving information dissemination in wireless environments due to the limited channel bandwidth and the power constraints of portable devices. In this paper, a restricted dynamic programming approach which generates broadcast programs is proposed to partition data items over multiple channels near optimally. In our approach, a function to predict the optimal average expected delay, in terms of the number of channels, the summation of the access frequencies of data items, and the ratio of the data items is developed by employing curve fitting. Applying this function, we can find a cut point that may be very close to the optimal cut. Thus, the search space in dynamic programming can be restricted to the interval around a determined cut point. Therefore, our approach only takes O(N log K) time, where N is number of data items and K is the number of broadcast channels. Simulation results show that the solution obtained by our proposed algorithm is near-optimal.

This paper discusses a generalized concept of multiple-symbol differential detection (MDD) and analytically derives weight parameters based on channel prediction for MDD on fast time-varying channels. At first, this paper shows that adaptive maximum-likelihood sequence estimation employing per-survivor processing (PSP-MLSE) with a single channel tap is similar concept to MDD. Next, the weight parameters for MDD are derived according to the channel estimation of PSP-MLSE based on a high order channel prediction. Finally, computer simulation confirms that MDD with the analytically derived parameters mitigates floor of bit error rate (BER) on fast time-varying fading channels without channel state information.

This paper proposes a new family of space-time block codes whose transmission rate is 1 symbol per channel use. The proposed space-time codes can achieve full transmit diversity with larger coding gain for the constellation carved from the scaled complex integer ring κZ[i]. It is confirmed that the performances of the proposed space-time codes are superior to the existing space-time block codes by our simulation results.

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.