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.

In this letter, we propose two computationally efficient precoding algorithms that achieve near-ML performance for multiuser MIMO downlink. The proposed algorithms perform tree expansion after lattice reduction. The first full expansion is tried by selecting the first level node with a minimum metric, constituting a reference metric. To find an optimal sequence, they iteratively visit each node and terminate the expansion by comparing node metrics with the calculated reference metric. By doing this, they significantly reduce the number of undesirable node visit. Monte-Carlo simulations show that both proposed algorithms yield near-ML performance with considerable reduction in complexity compared with that of the conventional schemes such as sphere encoding.

Two-ray (TR) fading model is one of the fading models to represent a worst-case fading scenario. We derive the exact closed-form expressions of the generalized moment generating function (G-MGF) for the TR fading model, which enables us to analyze the numerous types of wireless communication applications. Among them, we carry out several analytical results for the TR fading model, including the exact ergodic capacity along with asymptotic expressions and energy detection performance. Finally, we provide numerical results to validate our evaluations.

Based on an analysis of the error patterns in lattice-reduction (LR) precoding in a multiple-antenna broadcast channel, this paper proposes a simple precoding technique that can reduce the quantization error. The proposed scheme establishes a lattice list to provide more candidates for transmission power reduction based on the analysis of the patterns of the error in the LR precoding method [9]. Simulation results show that the proposed scheme matches the BER performance of more complex precedents (such as the vector perturbation using sphere encoding) with significant saving in complexity.

In this paper, a computationally efficient stack-based iterative detection algorithm is proposed for V-BLAST systems. To minimize the receiver's efforts as much as possible, the proposed scheme employs iterative tree search for complexity reduction and storage saving. After an M-ary tree structure by QR decomposition of channel matrix is constructed, the full tree depth is divided into the first depth and the remaining ones. At tree depth of one, the proposed algorithm finds M candidate symbols. Based on these symbols, it iteratively searches the remaining symbols at second-to-last depth, until finding an optimal symbol sequence. Simulation results demonstrate that the proposed algorithm yields the performance close to that of sphere detection (SD) with significant saving in complexity and storage.

In this study, a computationally efficient ranging scheme exploiting a minimum mean square error (MMSE) and a matrix-pencil (MP) technique is proposed for the IEEE 802.15.4a chirp spread spectrum (CSS) system. Based on the characteristics of the CSS signal, a practical methodology for the MMSE process is devised and the appropriate values of parameters, which are cutoff bandwidth, number of samples and sampling duration in frequency domain, are investigated and numerically determined to enhance the performance. The performance of proposed scheme is analyzed in terms of the computational complexity and the ranging estimation errors. Simulation results demonstrate that the proposed scheme performs as well as the conventional scheme at remarkably reduced computational costs.

We propose a sub-optimal but computationally efficient Modified Fano Detection algorithm (MFD) for V-BLAST systems. This algorithm utilizes the QR decomposition of the channel matrix and the sequential detection scheme based on tree searching to find the optimal symbol sequence. For more reliable signal detection, the decoder is designed to move backward for the specified value at the end of the tree. This results in significant reduction of the complexity while the performance of MFD is comparable to that of ML detector.

This letter presents a new vertical Bell Labs layered space-time (V-BLAST) transmission scheme for developing low-complexity tree searching in the QRD-M algorithm. In the new V-BLAST system, we assign modulation scheme in ascending order from top to bottom tree branches. The modulation set to be assigned is decided by two criteria: minimum performance loss and maximum complexity reduction. We also propose an open-loop power allocation algorithm to surmount the performance loss. Numerical results show that the proposed V-BLAST transmission approach can significantly reduce the computational loads of the QRD-M algorithm with a slight performance degradation.

Time-frequency-selective, equivalently time-variant multipath, fading channels in orthogonal frequency division multiplexing (OFDM) systems introduce intercarrier interference (ICI), resulting in severe performance degradation. To suppress the effect of ICI, several symbol detection methods have been proposed, all of which are based on the observation that most of the ICI's power is distributed near the desired subcarrier. However, these methods usually ignore the channel variation in a OFDM symbol block by fixing the number of considered ICI terms. Therefore, we propose a novel frequency-domain symbol detection method with moderate complexity, which adaptively determines the number of ICI terms within each OFDM symbol block.

In this letter, we provide an asymptotic error rate performance evaluation of space-time block codes from coordinate interleaved orthogonal designs (STBCs-CIODs), especially in shadowed Rayleigh fading channels. By evaluating a simplified probability density function (PDF) of Rayleigh and Rayleigh-lognormal channels affecting the STBC-CIOD system, we derive an accurate closed-form approximation for the tight upper and lower bounds on the symbol error rate (SER). We show that shadowing asymptotically affects coding gain only, and conclude that an increase in diversity order under shadowing causes slower convergence to asymptotic bound due to the relatively larger loss of coding gain. By comparing the derived formulas and Monte-Carlo simulations, we validate the accuracy of the theoretical results.

In this letter, we propose a cdma2000 based MC-CDMA scheme which inherits the same architecture and bandwidth of forward link packet data channel of cdma2000 1x EV-DV. The system utilizes no cyclic prefix, and it uses the bandwidth efficient iterative technique [6] to recover cyclicity of OFDM symbol of the MC-CDMA system to achieve backward compatibility with 1x EV-DV system. We report that the link-level performance of our proposed system is significantly better than previous equalizer-based scheme [7] in frequency selective fading channels.

This paper derives highly accurate and effective closed-form formulas for the average upper bound on the pairwise error probability (PEP) of the multi-carrier index keying orthogonal frequency division multiplexing (MCIK-OFDM) system with low-complexity detection (i.e., greedy detection) in two-wave with diffuse power (TWDP) fading channels. To be specific, we utilize an exact moment generating function (MGF) of the signal-to-noise ratio (SNR) under TWDP fading to guarantee highly precise investigations of error probability performance; existing formulas for average PEP employ the approximate probability density function (PDF) of the SNR for TWDP fading, thereby inducing inherent approximation error. Moreover, some special cases of TWDP fading are also considered. To quantitatively reveal the achievable modulation gain and diversity order, we further derive asymptotic formulas for the upper bound on the average PEP. The obtained asymptotic expressions can be used to rapidly estimate the achievable error performance of MCIK-OFDM with the greedy detection over TWDP fading in high SNR regimes.

We consider vector channel estimation for differentially modulated systems with transmit diversity. We propose a blind estimation scheme to yield superior performance to that of the pilot-aided estimation. The proposed scheme utilizes the repeated transmission of space-time coded data symbols. We compare the performance of the proposed blind scheme with the pilot-based estimation scheme via computer simulations.

We consider a blind estimation of the vector channel for systems with receive diversity. The objective of this paper is to reduce the complexity of the conventional subspace-based method in vector channel estimation. A reduced-complexity estimation scheme is proposed, which is based on selecting a column of the covariance matrix of the received signal vectors. The complexity and performance of the proposed scheme is investigated via computer simulations.

In this letter, we propose a simple adaptive switching scheme to enhance the performance of space-time/frequency block coded OFDM systems (STBC/SFBC-OFDM). Since STBC-OFDM and SFBC-OFDM undergo severe performance degradation in time- and frequency-selective fading channels, respectively, performance enhancement can be achieved by switching between STBC-OFDM and SFBC-OFDM over a continuously varying channel environments. Thus, a new switching scheme based on the characteristics of the actual channel is proposed. The effectiveness of the proposed scheme is demonstrated by computer simulations.

This letter proposes a high precision ranging scheme based on the time of arrival estimation technique for the IEEE 802.15.4a chirp spread spectrum system. The proposed scheme consists of a linear channel impulse response estimation process with the zero forcing or minimum mean square error technique and the multipath delay estimation process with matrix pencil algorithm. The performance of the proposed scheme is compared with that of a well known MUSIC algorithm in terms of computational complexity and ranging precision. Simulation results demonstrate that the proposed scheme outperforms the MUSIC algorithm even though it has comparatively lower computational complexity.

This letter considers frame synchronization in non-synchronized sampling discrete multi-tone (DMT) based asymmetric digital subscriber line (ADSL)/very high speed DSL (VDSL) systems in the presence of timing error. We propose a frame synchronization method which is based on the observation that the normalized correlation between two sequences separated by the FFT length is Cauchy random variable. The proposed approach uses less number of correlators, reducing computational complexity as well as demodulation delay than a previous approach. Therefore, ADSL/VDSL modems can be more power efficient and computationally less complex via the proposed frame synchronization method. Simulation results demonstrate the effectiveness of the proposed approach, comparing with the previous approach.

In this letter, a switched transmission technique is presented that can provide the orthogonal frequency division multiplexing (OFDM) systems with additional diversity gain. The space-time block coding (STBC) and space-frequency block coding (SFBC) are considered for the transmission of the OFDM signals. A proper coding scheme is selected based on the estimated normalized delay spread and normalized Doppler spread. The selection criterion is derived empirically. It is shown through computer simulations that the proposed switching technique can improve the bit error rate (BER) performance of an OFDM system when the corresponding wireless channel has some time variation of time selectivity as well as frequency selectivity.

Instead of pilot tones, the impulse sample is exploited for channel estimation in Impulse Postfix OFDM systems [1]. As the magnitude of impulse sample is increased, the accuracy of channel estimation can be enhanced, but it may significantly increase the PAPR of generated OFDM symbols. In this letter, based on the statistical analysis of the generated OFDM symbol, we propose a decision scheme for determining the magnitude of impulse sample. By using the proposed scheme, we can determine the magnitude of impulse sample that provides the enhancement of BER performance as well as the avoidance of PAPR increase. The validation of the proposed scheme is demonstrated by computer simulations.

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.