Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Generalized Prefix Construction for OFDM Systems Over Quasi-Static Channels (1601.07207v1)

Published 26 Jan 2016 in cs.IT, cs.NI, and math.IT

Abstract: All practical OFDM systems require a prefix to eliminate inter-symbol interference at the receiver. Cyclic prefix (CP) and zero-padding are well-known prefix construction methods, the former being the most employed technique in practice due to its lower complexity. In this paper we construct an OFDM system with a generalized CP. It is shown that the proposed generalized prefix effectively makes the channel experienced by the packet different from the actual channel. Using an optimization procedure, lower bit error rates can be achieved, outperforming other prefix construction techniques. At the same time the complexity of the technique is comparable to the CP method. The presented simulation results show that the proposed technique not only outperforms the CP method, but is also more robust in the presence of channel estimation errors and mobility. The proposed method is appropriate for practical OFDM systems.

Citations (11)

Summary

We haven't generated a summary for this paper yet.