کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5000809 | 1460841 | 2017 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Symbol detection based on Voronoi surfaces with emphasis on superposition modulation
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
کنترل و سیستم های مهندسی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
A challenging task when applying high-order digital modulation schemes is the complexity of the detector. Particularly, the complexity of the optimal a posteriori probability (APP) detector increases exponentially with respect to the number of bits per data symbol. This statement is also true for the Max-Log-APP detector, which is a common simplification of the APP detector. Thus it is important to design new detection algorithms which combine a sufficient performance with low complexity. In this contribution, a detection algorithm for two-dimensional digital modulation schemes which cannot be split-up into real and imaginary parts (like phase shift keying and phase-shifted superposition modulation (PSM)) is proposed with emphasis on PSM with equal power allocation. This algorithm exploits the relationship between Max-Log-APP detection and a Voronoi diagram to determine planar surfaces of the soft outputs over the entire range of detector input values. As opposed to state-of-the-art detectors based on Voronoi surfaces, a priori information is taken into account, enabling iterative processing. Since the algorithm achieves Max-Log-APP performance, even in the presence of a priori information, this implies a great potential for complexity reduction compared to the classical APP detection.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Digital Communications and Networks - Volume 3, Issue 3, August 2017, Pages 141-149
Journal: Digital Communications and Networks - Volume 3, Issue 3, August 2017, Pages 141-149
نویسندگان
Martin Damrath, Peter Adam Hoeher, Gilbert J.M. Forkel,