Fast and Deterministic Method for Compressed Sensing Based Pilot Patterns Allocation

Irregular pilot patterns with low mutual coherence allow to reduce pilot overhead with the help of Compressed Sensing algorithms. Algorithms for pilot positions generation usually have high computational complexity or depend on random initialization result. They can be used to precalculate pilot positions for all possible combinations of configuration parameters, but for practical systems the amount of data to be stored is large. In this article we propose fast and deterministic method for finding pilot patterns. We compared it with other algorithms from literature. Proposed method wins strongly (O(NK) vs O(N<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup>K)) in computational complexity and (near 100 times faster) time of execution with minimal losing (less than 1%) in achieved capacity.