Computing the Computational Complexity of an Efficient Algorithm for Greedy ZF-DP Precoding Method in MIMO Broadcast Channels
Publish place: Congress on Electrical, Computer and Information Technology
Publish Year: 1392
Type: Conference paper
Language: English
View: 1,397
This Paper With 6 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
CECIT01_717
Index date: 5 September 2013
Computing the Computational Complexity of an Efficient Algorithm for Greedy ZF-DP Precoding Method in MIMO Broadcast Channels abstract
In this work we analyze a precoding method in MIMO broadcast channels which is called ZF-DP. ( QR Decomposition with Dirty Paper coding ) There is an algorithm for reducing the computational complexity of the ZF-DP method with greedy user selection. In this paper the computational complexity of this algorithm is computed when the channel matrix is full rank or rank deficient.
Computing the Computational Complexity of an Efficient Algorithm for Greedy ZF-DP Precoding Method in MIMO Broadcast Channels Keywords:
Computing the Computational Complexity of an Efficient Algorithm for Greedy ZF-DP Precoding Method in MIMO Broadcast Channels authors
Seyyed Ali Erfani
Sadjad Institute of Higher Education Mashhad Iran, Author’s Address: No. ۲۷, Yaser Street, Niyavaran Avenue,
Iman Ahadi Akhlaghi
Sadjad Institute of Higher Education, Mashhad, Iran,
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :