Skip to main content
. 2021 Apr 11;21(8):2690. doi: 10.3390/s21082690
Algorithm 4 Proposed ZF-based efficient decremental TAS selection algorithm.
Inputs: H,Q2K,NT,NS1: HQ=Q2KTH*2: H˜S=[HHQ]3: V˜NT=(H˜SH˜SH)14: for k=1,2,,NTNS5:for q=1,2,,(NTk+1)6: H˜k,q=[H(:,q)HQ(:,q)]7: Θ˜k,q=V˜NTk+1H˜k,q8: λk,q=Tr[Θ˜k,q(I2H˜k,qHΘ˜k,q)1Θ˜k,qH]9:end10:q^= arg minq λk,q11:V˜NTk+2=V˜NTk+1+Θ˜k,q^(I2H˜k,q^HΘ˜k,q^)1Θ˜k,q^H12:H=H(:,[1:(q^1)(q^+1):end])13:HQ=HQ(:,[1:(q^1)(q^+1):end])14: end15: HS=HOutput: HS