Dynamic programming in digital communications: Viterbi decoding to turbo multiuser detection

DOI10.1023/A:1021259315279zbMath1031.94017OpenAlexW39910894MaRDI QIDQ1411378

H. Vincent Poor

Publication date: 27 October 2003

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021259315279

zbMATH Keywords

Dynamic programmingchannel equalizationmultiuser detectionsequence detectionturbo processingmaximum likelihood detectionchannel decodingmaximum a posteriori probability detection

Mathematics Subject Classification ID

Dynamic programming (90C39) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Detection theory in information and communication theory (94A13) Convolutional codes (94B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational complexity of optimum multiuser detection
• Optimal receiver design for convolutional codes and channels with memory via control theoretical concepts
• Transformations of Wiener integrals under translations
• An iterative multiuser decoder for near-capacity communications
• Space-time multiuser detection in multipath CDMA channels
• Minimum probability of error for asynchronous Gaussian multiple-access channels
• Abstract Dynamic Programming Models under Commutativity Conditions
• Optimal Sequence Detection and Optimal Symbol-by-Symbol Detection: Similar Algorithms
• Channel identification for high speed digital communications
• Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
• Multiuser ML sequence estimator for convolutionally coded asynchronous DS-CDMA systems
• Polynomial complexity optimal detection of certain multiple-access systems
• Solving a class of optimum multiuser detection problems with polynomial complexity
• Detection of stochastic processes
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• Correlative level coding and maximum-likelihood decoding
• Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference