Fast decoding for silver codes

In this work, we introduce a method for fast decoding of silver codes that is dimensionality reduced method on search tree of the sphere decoder. In the recent works, it is known that the fast decoding method for the silver code has the worst-case complexity of m². By the use of proposed method, silver code has only m^1.5 decoding complexity in worst-case. In this case, the error performance of the proposed method for the silver codes has limited loss about 1 dB in the receiver unit.