z-logo
open-access-imgOpen Access
Early results on deep unfolded conjugate gradient‐based large‐scale MIMO detection
Author(s) -
Ahmed Ouameur Messaoud,
Massicotte Daniel
Publication year - 2021
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/cmu2.12076
Subject(s) - conjugate gradient method , computer science , backpropagation , residual , deep learning , overhead (engineering) , mimo , gradient descent , algorithm , function (biology) , conjugate residual method , artificial intelligence , convergence (economics) , graph , activation function , scale (ratio) , artificial neural network , channel (broadcasting) , theoretical computer science , telecommunications , physics , evolutionary biology , quantum mechanics , economics , biology , economic growth , operating system
Deep learning (DL) is attracting considerable attention in the design of communication systems. This paper derives a deep unfolded conjugate gradient (CG) architecture for large‐scale multiple‐input multiple‐output detection. The proposed technique combines the advantages of a model‐driven approach in readily incorporating domain knowledge and deep learning in effective parameters learning. The parameters are trained via backpropagation over a data flow graph inspired from the iterative conjugate gradient method. We derive the closed‐form expressions for the gradients for parameters training and discuss early results on the performance in a statistically identical and independent distributed channel where the training overhead is considerably low. It is worth noting that the loss function is based on the residual error that is not an explicit function of the desired signal, which makes the proposed algorithm blind. As an initial framework, we will point to the inherent issues and future directions.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here