Learn More
We investigate the joint source-channel coding problem of transmitting nonuniform memoryless sources over binary phase-shift keying-modulated additive white Gaussian noise and Rayleigh fading channels via turbo codes. In contrast to previous work, recursive nonsystematic convolutional encoders are proposed as the constituent encoders for heavily biased(More)
We present performance limits of the optical code-division multiple-access (OCDMA) networks. In particular, we evaluate the information-theoretical capacity of the OCDMA transmission when single-user detection (SUD) is used by the receiver. First, we model the OCDMA transmission as a discrete memoryless channel, evaluate its capacity when binary modulation(More)
This paper considers wireless data transmission over multi-input, multi-output (MIMO) channels when only the receiver has perfect channel state information. A linear-complexity space-time detector is derived in the context of a turbo-code-based space-time transmitter and iterative processing (turbo detection, demodulation and decoding). Simulation results(More)
We consider the problem of achieving high data rates for uplink transmission on multi-input, multi-output (MIMO) channels. We propose a soft decision space-time detection scheme of linear complexity in a turbo-coded architecture with a new form of iterative processing. Simulation results illustrate that the coded MIMO system is within 1.5 dB of the Shannon(More)
Faster than Nyquist (FTN) signaling has been studied as an alternative transmission technology in communication systems when information carrying symbols are sent faster than the Nyquist rate determined by the physical channel bandwidth. This paper presents analysis of the information rates of cyclostationary FTN signaling on AWGN and selected ISI channels.(More)
We consider the concept of faster-than-Nyquist rate (FTN) broadcasting, which nonorthogonally multiplexes more than one user message in the continuous-time domain for transmission over broadcast channels. Two FTN broadcasting approaches, namely, sub-FTN and full-FTN, are considered for broadcasting of K independent messages over K -user continuous time(More)