کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4953939 | 1443125 | 2017 | 21 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A novel Segregated K-Best detection algorithm for low complexity near optimal MIMO receivers
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper addresses the problem of computational and hardware complexity in higher order constellation Multiple Input Multiple Output (MIMO) detectors. A novel Segregated K-Best detection (SKD) algorithm is proposed to serve as low complexity near optimal detector for MIMO receivers. The algorithm reduces detection complexity by choosing an optimal value of K depending upon the layer of traversal. This allows lesser number of nodes to be traversed leading to reduced complexity with only slight degradation in error rate performance. Hardware Descriptive Language (HDL) implementation of SKD is performed using 'one symbol detection per cycle architecture' and a compatible 'sequential linear sort' algorithm is proposed for sorting in SKD. The proposed design achieves a throughput as high as 802Â Mbps with latency of 19.83Â ns.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: AEU - International Journal of Electronics and Communications - Volume 75, May 2017, Pages 130-139
Journal: AEU - International Journal of Electronics and Communications - Volume 75, May 2017, Pages 130-139
نویسندگان
Pranay Joshi, Shreyas Joshi, Varun Jain, Sunil Joshi,