Pilot pattern design scheme with branch and bound in PSA-OFDM system

Shuchen Wang (), Suixiang Gao () and Wenguo Yang ()
Additional contact information
Shuchen Wang: University of Chinese Academy of Sciences
Suixiang Gao: University of Chinese Academy of Sciences
Wenguo Yang: University of Chinese Academy of Sciences

Journal of Combinatorial Optimization, 2023, vol. 45, issue 4, No 15, 16 pages

Abstract: Abstract Pilot symbol assisted (PSA) channel estimation is an important means to improve the communication quality of orthogonal frequency division multiplexing (OFDM) systems. The insertion position of the pilot in the frequency domain and time domain of the OFDM symbol is called the pilot pattern. The appropriate pilot pattern can greatly reduce channel estimation error and enhance communication quality. In this paper, the branch and bound (BnB) method is adopted to design the pilot pattern BnB-PP for the first time. Specifically, the result of the linear minimum mean square error method is taken as the target value of channel estimation in PSA-OFDM systems. For branching, pilot positions are randomly selected one by one in the form of the binary tree. For the boundary, after the pilots are filled randomly, a correction term is subtracted from the result of channel estimation at this time to present the expectation boundary. The results show that BnB-PP is better than the common pilot pattern. When signal-to-noise ratio is 36, the average MSE of channel estimation for 32 and 64 pilots in 1344 data signals is reduced by $$93.24\%$$ 93.24 % and $$62.33\%$$ 62.33 % respectively compared with the lattice-type pilot pattern.

Keywords: Pilot pattern; Branch and bound; PSA-OFDM; Channel estimation; LMMSE (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-023-01037-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:45:y:2023:i:4:d:10.1007_s10878-023-01037-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-023-01037-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().