Generalized space-time shift keying designed for flexible diversity-, multiplexing- and complexity-tradeoffs

In this paper, motivated by the recent concept of Spatial Modulation (SM), we propose a novel Generalized Space-Time Shift Keying (G-STSK) architecture, which acts as a unified Multiple-Input Multiple-Output (MIMO) framework. More specifically, our G-STSK scheme is based on the rationale that P out of Q dispersion matrices are selected and linearly combined in conjunction with the classic PSK/QAM modulation, where activating P out of Q dispersion matrices provides an implicit means of conveying information bits in addition to the classic modem. Due to its substantial flexibility, our G-STSK framework includes diverse MIMO arrangements, such as SM, Space-Shift Keying (SSK), Linear Dispersion Codes (LDCs), Space-Time Block Codes (STBCs) and Bell Lab’s Layered Space-Time (BLAST) scheme. Hence it has the potential of subsuming all of them, when flexibly adapting a set of system parameters. Moreover, we also derive the Discrete-input Continuous-output Memoryless Channel (DCMC) capacity for our G-STSK scheme, which serves as the unified capacity limit, hence quantifying the capacity of the class of MIMO arrangements. Furthermore, EXtrinsic Information Transfer (EXIT) chart analysis is used for designing our G-STSK scheme and for characterizing its iterative decoding convergence

Coded spread spectrum digital transmission system design study

Results are presented of a comprehensive study of the performance of Viterbi-decoded convolutional codes in the presence of nonideal carrier tracking and bit synchronization. A constraint length 7, rate 1/3 convolutional code and parameters suitable for the space shuttle coded communications links are used. Mathematical models are developed and theoretical and simulation results are obtained to determine the tracking and acquisition performance of the system. Pseudorandom sequence spread spectrum techniques are also considered to minimize potential degradation caused by multipath

Performance Evaluation of Wavelet-Coded OFDM on a 4.9 Gbps W-Band Radio-over-Fiber Link

Future generation mobile communications running on mm-wave frequencies will require great robustness against frequency selective channels. In this paper, we evaluate the transmission performance of 4.9 Gb/s wavelet-coded orthogonal frequency division multiplexing (OFDM) signals on a 10 km fiber plus 58 m wireless radio-over-fiber link using a mm-wave radio frequency carrier. The results show that a 2 × 128 wavelet-coded OFDM system achieves a bit-error rate of 1e-4 with nearly 2.5 dB less signal-to-noise ratio than a convolutional coded OFDM system with equivalent spectral efficiency for 8 GHz-wide signals with 512 subcarriers on a carrier frequency of 86 GHz. Our findings confirm the Tzannes’ theory that wavelet coding enables high diversity gains with a low complexity receiver and, most notably, without compromising the system’s spectral efficiency

Analysis and Design of Tuned Turbo Codes

It has been widely observed that there exists a fundamental trade-off between the minimum (Hamming) distance properties and the iterative decoding convergence behavior of turbo-like codes. While capacity achieving code ensembles typically are asymptotically bad in the sense that their minimum distance does not grow linearly with block length, and they therefore exhibit an error floor at moderate-to-high signal to noise ratios, asymptotically good codes usually converge further away from channel capacity. In this paper, we introduce the concept of tuned turbo codes, a family of asymptotically good hybrid concatenated code ensembles, where asymptotic minimum distance growth rates, convergence thresholds, and code rates can be traded-off using two tuning parameters, {\lambda} and {\mu}. By decreasing {\lambda}, the asymptotic minimum distance growth rate is reduced in exchange for improved iterative decoding convergence behavior, while increasing {\lambda} raises the asymptotic minimum distance growth rate at the expense of worse convergence behavior, and thus the code performance can be tuned to fit the desired application. By decreasing {\mu}, a similar tuning behavior can be achieved for higher rate code ensembles.Comment: Accepted for publication in IEEE Transactions on Information Theor

Concatenation and Implementation of Reed- Solomon and Convolutional Codes

High bit error rates of the wireless communication system require forward error correction (FEC) methods to implement on the data to be transmitted. In this paper, the performance of convolutional, block and concatenated coding schemes are used to encode the data stream and are evaluated. Simulation is performed to find the Bit Error Rate(BER) of the Convolutional(CC) and Reed-Solomon(RS) codes and the best outcome is used to model the RS-CC and CC-RS concatenated codes. By concatenating these two codes, an improved BER performance is obtained due to benefits of RS codes correcting burst errors and convolutional codes correcting random errors that are caused due to a noisy channel. Finally, a comparison between both the coding techniques and also with the uncoded data transmission technique is done