In this paper, an (N, K) codebook is constructed from a K × N partial matrix with K < N, where each code vector is equivalent to a column of the matrix. To obtain the K × N matrix, K rows are selected from a J × N matrix Φ, associated with a binary sequence of length J and Hamming weight K, where a set of the selected row indices is the index set of nonzero entries of the binary sequence. It is then discovered that the maximum magnitude of inner products between a pair of distinct code vectors is determined by the maximum magnitude of Φ-transform of the binary sequence. Thus, constructing a codebook with small magnitude of inner products is equivalent to finding a binary sequence where the maximum magnitude of its Φ-transform is as small as possible. From the discovery, new classes of near-optimal codebooks with nontrivial bounds on the maximum inner products are constructed from Fourier and Hadamard matrices associated with binary Sidelnikov sequences.
展开▼
