Research Article
Random Graph-Based M-QAM Classification for MIMO Systems
Algorithm 1
Algorithm of the proposed problem.
1 initialization; | 2 whileM-QAMclassifieddo | 3 evaluate SFT (r) (where r is received signal); | 4 apply Normalization (transformed r); | 5 evaluate Rayleigh CDF (normalized signal); | 6 for j=1:K do | 7 for k=1:K-1 do | 8 connect each ith edge to jth edge; | 9 end | 10 end | 11 ifgraph ==fully connectedthen | 12 class 1 is separated; | 13 else | 14 take next power and continue classification; | 15 end | 16 end |
|