Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Low-Complexity Detection Algorithm for the Primary Synchronization Signal in LTE

Published 23 Nov 2015 in cs.IT and math.IT | (1511.07316v1)

Abstract: One of the challenging tasks in LTE baseband receiver design is synchronization, which determines the symbol boundary and transmitted frame start-time, and performs cell identification. Conventional algorithms are based on correlation methods that involve a large number of multiplications and thus lead to high receiver hardware complexity and power consumption. In this paper, a hardware-efficient synchronization algorithm for frame timing based on K-means clustering schemes is proposed. The algorithm reduces the complexity of the primary synchronization signal for LTE from 24 complex-multiplications, currently best known in the literature, to just 8. Simulation results demonstrate that the proposed algorithm has negligible performance degradation with reduced complexity relative to conventional techniques.

Citations (22)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.