2017•Unpublished venueRequires access

Channel estimation in time domain using complementary sequence

Shufeng Li, Hongda Wu, Libiao Jin

Open publisher page 3 citations

Abstract

It is indispensable to take a low complexity and high accuracy channel estimation algorithm into account under rapidly growth in wireless communication. In this paper, we propose an algorithm for channel estimation using complementary sequence (CS). By utilizing the fantastic autocorrelation property of CS, time domain channel estimation can be easily achieved. We analyzed the complementary sequence, m sequence and combinational Barker code (CB-c) including autocorrelation function (ACF) and expansion principle. Furthermore, the system model and the design of channel estimation sequence are described. The normalized mean square error (NMSE) performance shows that the CS is superior to the other two kinds of sequence. Meanwhile, the BER performance proved the feasibility of complementary sequences for time domain channel estimation.

About this research paper

What this paper is about

It is indispensable to take a low complexity and high accuracy channel estimation algorithm into account under rapidly growth in wireless communication. In this paper, we propose an algorithm for channel estimation using complementary sequence (CS). By utilizing the fantastic autocorrelation property of CS, time domain channel estimation can be easily achieved. We analyzed the complementary sequence, m sequence and combinational Barker code (CB-c) including autocorrelation function (ACF) and expansion principle. Furthermore, the system model and the design of channel estimation sequence are described. The normalized mean square error (NMSE) performance shows that the CS is superior to the other two kinds of sequence. Meanwhile, the BER performance proved the feasibility of complementary sequences for time domain channel estimation.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

It is indispensable to take a low complexity and high accuracy channel estimation algorithm into account under rapidly growth in wireless communication. In this paper, we propose an algorithm for channel estimation using complementary sequence (CS). By utilizing the fantastic autocorrelation property of CS, time domain channel estimation can be easily achieved. We analyzed the complementary sequence, m sequence and combinational Barker code (CB-c) including autocorrelation function (ACF) and expansion principle. Furthermore, the system model and the design of channel estimation sequence are described. The normalized mean square error (NMSE) performance shows that the CS is superior to the other two kinds of sequence. Meanwhile, the BER performance proved the feasibility of complementary sequences for time domain channel estimation.

Key concepts: Autocorrelation, Channel (broadcasting), Sequence (biology), Algorithm, Computer science, Time domain, Frequency domain, Bit error rate

Related papers

Back to paper searchBrowse research topicsOriginal source
Channel estimation in time domain using complementary sequence — Research Paper | ScholarLens