• Publications
  • Influence
Multiple-symbol differential detection of MPSK
A differential detection technique for MPSK (multiple-phase shift keying), which uses a multiple-symbol observation interval, is presented, and its performance is analyzed and simulated. Expand
  • 682
  • 70
Improved parallel interference cancellation for CDMA
This paper introduces an improved nonlinear parallel interference cancellation scheme for code-division multiple access (CDMA) that significantly reduces the degrading effect on the desired user of interference from the other users that share the channel. Expand
  • 773
  • 68
  • PDF
Serial concatenation of interleaved codes: performance analysis, design and iterative decoding
In this paper, upper bounds to the average maximum-likelihood bit error probability of serially concatenated coding schemes are derived and a highly-performing iterative decoding algorithm is proposed. Expand
  • 439
  • 66
Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding
We obtain upper bounds to the average maximum-likelihood bit error probability of serially concatenated block and convolutional coding schemes. Expand
  • 971
  • 52
  • PDF
A soft-input soft-output APP module for iterative decoding of concatenated codes
We describe the SISO APP module that updates the APP's corresponding to the input and the output bits, of a code, and show how to embed it into an iterative decoder for a new hybrid concatenation of three codes, to fully exploit the benefits of the proposed S ISO APP module. Expand
  • 608
  • 39
Transfer function bounds on the performance of turbo codes Pasadena
In this article we apply transfer function bounding techniques to obtain upper bounds on the bit-error rate for maximum likelihood decoding of turbo codes constructed with random permutations. Expand
  • 236
  • 35
  • PDF
Turbo codes for PCS applications
Turbo codes are the most exciting and potentially important development in coding theory in many years. Expand
  • 416
  • 32
  • PDF
Weight distributions for turbo codes using random and nonrandom permutations
This article takes a preliminary look at the weight distributions achievable for turbo codes using random, nonrandom, and semirandom permutations. Due to the recursiveness of the encoders, it isExpand
  • 459
  • 30
  • PDF
Coding theorems for 'turbo-like' codes
In this paper we discuss AWGN coding theorems for ensembles of coding systems which are built from fixed convolutional codes interconnected with random interleavers. Expand
  • 566
  • 28
  • PDF