Abstract
The paper discusses a Novel PSK enumeration technique for VLSI implementation of K-Best MIMO detection. The detection is modeled as a closet point search problem in N x N lattice and further simplified to a breadth first tree search problem of depth N for a N x N MIMO channel. The breadth first search has been carried out using spiral searches and a predictor-extender algorithm to decode the k best points in order of their path metric. The proposed enumeration technique is tested for a 4 X 4 MIMO channel with 64-QAM modulation. VLSI implementation of the PSK enumeration cell was implemented using Synopsys synthesis tool with a 0.13 mu m CMOS technology and optimized to achieve an area of 764 mu m(2)and power of 52.58 mu W.