Performance Analysis for Optimal Pilot Spacing in MIMO-OFDM Systems

In this paper, we investigate the performance of the Viterbi decoding algorithm with/without Automatic Repeat reQuest (ARQ) over a Rician flat fading channel with unlimited interleaving. We show that the decay rate of the average bit error probability with respect to the bit energy to noise ratio is at least equal to d <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">f</sub> at high-bit energy to noise ratio for both cases (with ARQ and without ARQ), where d <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">f</sub> is the free distance of the convolutional code. The Yamamoto-Itoh flag helps to reduce the average bit error probability by a factor of 4(d) <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">f</sub> with a negligible retransmission rate. We also prove an interesting result that the average bit error probability decays exponentially fast with respect to the Rician factor for any fixed bit energy per noise ratio. In addition, the average bit error exponent with respect to the Rician factor is shown to be d <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">f</sub> .

Pilot symbols are commonly modulated on uniformly spaced subcarriers to aid channel estimation, thereby facilitating data demodulation in practical orthogonal frequency-division multiplexing (OFDM) systems operating over quasi-static multipath channels, where the channel frequency response (CFR) remains static within one block. Aided by uniformly spaced pilot symbols, the direct least-square CFR estimation can enable reliable symbol-by-symbol data demodulation within the same OFDM block, based on the principle of generalized likelihood ratio test (GLRT). Such GLRT-based OFDM can be easily incorporated with single-input multiple-output (SIMO) antenna technique to enhance data demodulation over quasi-static channels exhibiting random multipaths. In this article, an upper bound to the average bit error probability (BEP) is analytically derived for this GLRT-based SIMO&#x2013;OFDM system over quasi-static random multipath channels. The analysis is generally applicable to arbitrary two-dimensional component modulations when the quasi-static SIMO channel consists of independent but not necessarily identically distributed random channel paths with Rician or Rayleigh distributed path response magnitudes. The BEP upper bound facilitates the error performance characterization of the GLRT-based SIMO&#x2013;OFDM system with respect to data-to-noise power ratio, data-to-pilot power ratio, antenna diversity, pilot density, and pilot power allocation.

This paper focuses on multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems with channel order larger than the cyclic prefix (CP) length. Writing the demodulating fast Fourier transform (FFT) as a sliding FFT followed by a downsampling operation, we show in this paper that by swapping the filtering operations of the MIMO channel and the sliding FFT, the data model for the temporally smoothened received signal of each individual tone of the MIMO OFDM system is very similar to the data model for the temporally smoothened received signal of a MIMO single-carrier (SC) system. As a result, to recover the data symbol vectors, the conventional equalization approach for MIMO SC systems can be applied to each individual tone of the MIMO OFDM system. This so-called per-tone equalization (PTEQ) approach for MIMO OFDM systems is an attractive alternative to the recently developed time-domain equalization (TEQ) approach for MIMO OFDM systems. In the second part of this paper, we focus on direct per-tone equalizer design and adapt an existing semi-blind equalizer design method for space-time block coding (STBC) SC systems to the corresponding semi-blind per-tone equalizer design method for STBC OFDM systems.

In this paper, an exact expression for the average bit error probability was obtained for the λ-MRC detector, proposed in Sendonaris et al. (IEEE Trans Commun 51: 1927-1938, IEEE Trans. Commun 51: 1939-1948), under Rayleigh fading channel. In addition, a very accurate approximation was obtained to calculate the average bit error probability for any power allocation scheme. Our expressions allow to investigate the possible gains and situations where cooperation can be beneficial.

In this letter we propose a unified analytical expression for the average bit error probability of dual-hop amplify- and-forward relaying systems operating in the presence of both fast fading and shadowing. In order to provide a realistic end-to- end performance of the considered system we assume that both hops are subject to independent but not necessarily identically distributed Extended Generalized-K fading. Our newly derived formula is obtained in terms of the bivariate H-Fox function. A computationally efficient algorithm to evaluate the average bit error probability is also proposed. The accuracy of the proposed method is substantiated by various numerically evaluated and computer simulation results.

Sequential sensing algorithms are developed for OFDM-based hierarchical cognitive radio (CR) systems. Secondary users sense multiple sub-bands simultaneously for possible spectrum availabilities under hard miss-detection constraints to prevent interference to the primary users. Accounting for the fact that the sensing time overhead can often be significant, a performance metric is developed based on the effective achievable data rate. An optimization problem is formulated in the framework of optimal stopping problems to maximize the average effective data rate by determining the best time to stop taking samples for sensing, as well as the best set of channels to use for data transmission. A basis expansion-based sub-optimal algorithm is derived to reduce the prohibitive complexity of the optimal solution.

International audience

Orthogonal frequency division multiplexing (OFDM) has become an important component of waveform generation in wideband transmission. it's a superior technology for the high-speed rate of wired and wireless communication systems. Currently, multiple-input multiple-output orthogonal frequency division multiplexing (MIMO OFDM) systems are crucial wireless communication systems like 4G and 5G networks &amp; tactical communication. The OFDM has many advantages over other techniques like its high capacity and immunity against multipath fading channels. However, one amongst the foremost drawbacks of the OFDM system is that the high-peak-to-average power ratio (PAPR) that leads the system to provide in-band distortion and out-of-band radiation and reduces its efficiency. This problem increases with a rise within the number of transmit antennas. Therefore, it's highly desirable to cut back the PAPR of an OFDM signal. For this, numerous techniques are proposed to beat the PAPR problem like i) Selective mapping (SLM) ii) Partial transmit sequence (PTS), iii) Clipping, iv) Clipping and filtering. All of those are reduced the PAPR by generating alternative subcarrier vector that are statistically independent OFDM symbols for a given data frame and transmitting the symbol with rock bottom peak power. During this paper we also proposed, some hybrid techniques. The hybrid techniques are the technique of clipping is employed in conjunction with SLM and PTS to cut back computational complexity. And also the combination of SLMPTS to scale back PAPR. Simulations are acquainted with analyze the efficiency of the techniques used which signifies OFDM to be providing much better PAPR reduction and a way better Bit Error Rate (BER). it's shown in simulation results that the proposed scheme performs well reducing PAPR. But the proposed scheme is more complex than the prevailing techniques.

The average bit error rate (ABER) performance of low-density parity-check (LDPC)-coded orthogonal frequency-division multiplexing (OFDM) free-space optical communication system with K-ary quadrature amplitude modulation (QAM) and phase shift keying (PSK) modulation schemes is investigated over the composite Málaga fading channel with atmospheric attenuation and pointing errors considered. The probability density function and cumulative distribution function regarding the aggregated channel model are derived with the help of the generalized Gauss-Laguerre quadrature rule, the analytical ABER expressions for both QAM and PSK OFDM systems are then obtained. On the basis of them, the ABER performance is analyzed with different turbulence strengths, weather conditions, normalized beam width, normalized jitter, and specifically, different values of Málaga distribution parameter ρ. Monte Carlo simulation is offered to confirm the correctness of the proposed ABER models. Moreover, LDPC codes are added into the simulation to enhance system performance. The result shows that, for the same turbulence, weather, and pointing error conditions, whether the LDPC codes are taken into account or not, the ABER performance of 16-QAM OFDM system is better than that of 16-PSK OFDM system over the Málaga fading channel, and the ABER result decreases with higher ρ for both modulation schemes. Furthermore, the LDPC coding can significantly improve the system performance over this aggregated fading channel for these two modulation schemes, and a lower LDPC code rate can obtain a better ABER performance. This work is beneficial for free-space optical system design.

Permutation index-quadrature spatial modulation: A spectral efficient spatial modulation for next generation networks

Most of the existing works on space-time block codes (STBC) assume the channels are quasi-static, i.e., they remain invariant within one block. This assumption is not always true. In a more general case of time-selective channel, the channel matrix is no longer orthogonal. If conventional linear decoder is applied as it is in the quasi-static channel, it will introduce an irreducible error floor. In order to improve the performance, we can use zero-forcing decoder, which completely removes the interference. In this paper, we analyze the average bit error performance for BOTH conventional linear and zero-forcing decoders in the time-selective channels. The closed-form average bit error probabilities are obtained for both decoders, together with the irreducible error floor for the conventional linear decoder. Asymptotic analysis and numerical examples are also provided.

Recently, wireless multimedia services have been growing because of the spread of various wireless applications. Hence, time division duplex (TDD) systems and their crossed-slot interference problems in a cellular environment have been attracting growing interests. Considering large signaling overhead between cells, decentralized time slot allocation (TSA) strategy is suitable for practical implementation. Thus, Fixed-TSA strategy which fixes the same ratio of uplink and downlink time slots in all cells is adopted in commercial WiBro systems (IEEE802.16e Mobile WiMax) to mitigate the crossed-slot interference. However, the Fixed-TSA strategy reduces the flexibility in time slot allocation due to a strong constraint set by a predefined boundary. Moreover, the mathematical derivation of the optimal value for the predefined boundary has not been presented yet. In this paper, we propose two decentralized TSA strategies. The first one is Enhanced Fixed-TSA strategy, which dynamically adapts the predefined boundary of the conventional Fixed-TSA strategy according to traffic conditions. The second one is region-based Decentralized Time Slot Allocation (RED-TSA) strategy, which utilizes partial location information of MSs to reduce crossedslot interference. We fully analyze the proposed TSA strategies in terms of new call blocking probability, average bit error probability, and the overall system throughput. Numerical results show that the proposed RED-TSA strategy provides the highest system throughput by compromising both new call blocking performance and average bit error performance, whereas it requires additional location information and complicated computation. On the contrary, the proposed Enhanced Fixed-TSA strategy requires reasonable computational complexity while it provides almost the same system throughput with that of the proposed RED-TSA strategy. In a nutshell, the proposed Enhanced Fixed- TSA strategy is more appropriate for the practical systems. Moreover, it can be directly applied to the current commercial WiMax/WiBro systems with minimum changes.

Artificial noise (AN) is one of physical layer security techniques, which can realize secure communication. AN is a noise signal which is intentionally transmitted from transmitter along with data signals. Since AN is generated to be canceled out at legitimate receivers, it can prevent eavesdroppers from eavesdropping even if transmitters do not know the existence of eavesdroppers. In spite of its usefulness, most of the AN generation techniques cannot be applied to multiple-input multiple-output (MIMO) systems when the number of antennas at the transmitter is less than that at the legitimate receiver. In this paper, we consider time-domain AN generation techniques for MIMO orthogonal frequency division multiplexing (OFDM) systems. A time-domain AN generation technique is originally proposed for single-input single-output (SISO) OFDM systems. Thus, we first consider to apply the conventional time-domain AN generation technique to MIMO-OFDM systems, and show that this technique requires a large number of antennas at the transmitter and/or a longer cyclic prefix (CP). Next, to solve this problem, we propose another time-domain AN generation technique. Our proposed time-domain AN is generated to be canceled out at the legitimate receiver in the frequency domain, while the conventional time-domain AN is canceled out in the time domain. As a result, the proposed time-domain AN generation technique can be applied to MIMO-OFDM systems, irrespective of the number of antennas and the length of CP. Simulation results can show that the proposed AN achieves the same secrecy rate as the conventional time-domain AN. Moreover, the proposed technique achieves a higher secrecy rate when a MIMO-OFDM system is employed with the antenna configuration to which the conventional time-domain AN generation technique is hard to be applied.

A coherent receiver with a decision-feedback equalizer (DFE) operating on a Rayleigh fading channel under a suitable adaptive algorithm is considered. In the analysis of a DFE, a common assumption is that the receiver has perfect knowledge of the channel impulse response. However, this is not the case in practice, and for a rapidly fading channel, errors in channel tracking can become significant. We analyze theoretically the impact of these errors on the performance of a multichannel DFE. The expressions obtained for the achievable average MPSK bit error probabilities depend on the estimation error covariance. In order to specify this matrix, we focus on a special case when a Kalman filter is used as an optimal channel estimator. In this case, the probability of bit error can be assessed directly in terms of channel fading model parameters, the most interesting of which is the fading rate. Our results show the penalty imposed by imperfect channel estimation, as well as the fading-induced irreducible error rates. >

The key question need to be answered about relay selection in a large‐scale randomly distributed wireless network is that how to select a relay energy efficiently under a throughput (i.e., effective data rate) constraint with a reasonable complexity. It is not practical to collect instantaneous channel state information of all relays for relay selection because of excessive control packet transmission and useless energy consumption because to hold a relay in active mode to participate relay selection process needs significantly more power consumption than to hold in sleep mode. In this paper we propose a new energy‐efficient relay selection technique for large‐scale randomly distributed wireless networks for which an active relay region is introduced where only the relays in the region are taken into consideration for relay selection. Then, we propose a simple relay selection technique, which is only based on the channel state information of source‐relay channels of the relay subset to reduce the complexity and signaling overhead. The proposed relay selection technique increases energy efficiency at an acceptable complexity level without jeopardizing the effective data rate. We investigate the optimum size of the active relay region for energy efficient in which relays perform decode‐and‐forward technique. A detailed and realistic power consumption model is studied by taking all possible sources of power consumption into consideration, i.e., data transmission, signaling packets transmission, and circuit power consumption during all phases of the communication. We show that the proposed technique is more energy efficient and provides better effective data rate in comparison to the reference techniques.