Pilot Sequences with Low Coherence and PAPR for Grant-Free Massive Access

Qi, T; Lyu, B; Hoang, DT

Pilot Sequences with Low Coherence and PAPR for Grant-Free Massive Access

Qi, T Lyu, B Hoang, DT

Permalink

Publisher:: Institute of Electrical and Electronics Engineers (IEEE)
Publication Type:: Journal Article
Citation:: IEEE Wireless Communications Letters, 2023, 12, (7), pp. 1254-1258
Issue Date:: 2023-07-01

Embargoed

	Filename	Description	Size
	2-s2.0-85159706285 am.pdf	Accepted version	142.01 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Embargoed
Open Access

This item is currently unavailable due to the publisher's embargo.

The embargo period expires on 1 Jul 2025

Full metadata record

Field	Value	Language
dc.contributor.author	Qi, T
dc.contributor.author	Lyu, B
dc.contributor.author	Hoang, DT
dc.date.accessioned	2023-08-24T05:23:42Z
dc.date.available	2023-08-24T05:23:42Z
dc.date.issued	2023-07-01
dc.identifier.citation	IEEE Wireless Communications Letters, 2023, 12, (7), pp. 1254-1258
dc.identifier.issn	2162-2337
dc.identifier.issn	2162-2345
dc.identifier.uri	http://hdl.handle.net/10453/171820
dc.description.abstract	To accommodate massive devices and facilitate activity detection in a grant-free access system, it is necessary to design non-orthogonal pilot sequences with low coherence. In this letter, we study the optimization problem to minimize the worst-case coherence among sequences under the peak-to-average power ratio (PAPR) constraint of each sequence. An efficient method is proposed to iteratively construct sequences by the conjugate gradient descent and space projection. Simulation results demonstrate that the proposed sequences can decrease the coherence under strict PAPR constraints by up to 62% compared with the benchmarks.
dc.language	en
dc.publisher	Institute of Electrical and Electronics Engineers (IEEE)
dc.relation.ispartof	IEEE Wireless Communications Letters
dc.relation.isbasedon	10.1109/LWC.2023.3270305
dc.rights	info:eu-repo/semantics/embargoedAccess
dc.subject	0805 Distributed Computing, 0906 Electrical and Electronic Engineering, 1005 Communications Technologies
dc.subject.classification	4006 Communications engineering
dc.subject.classification	4009 Electronics, sensors and digital hardware
dc.subject.classification	4606 Distributed computing and systems software
dc.title	Pilot Sequences with Low Coherence and PAPR for Grant-Free Massive Access
dc.type	Journal Article
utslib.citation.volume	12
utslib.for	0805 Distributed Computing
utslib.for	0906 Electrical and Electronic Engineering
utslib.for	1005 Communications Technologies
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	embargoed	*
utslib.copyright.embargo	2025-07-01T00:00:00+1000Z
dc.date.updated	2023-08-24T05:23:41Z
pubs.issue	7
pubs.publication-status	Published
pubs.volume	12
utslib.citation.issue	7

Abstract:

To accommodate massive devices and facilitate activity detection in a grant-free access system, it is necessary to design non-orthogonal pilot sequences with low coherence. In this letter, we study the optimization problem to minimize the worst-case coherence among sequences under the peak-to-average power ratio (PAPR) constraint of each sequence. An efficient method is proposed to iteratively construct sequences by the conjugate gradient descent and space projection. Simulation results demonstrate that the proposed sequences can decrease the coherence under strict PAPR constraints by up to 62% compared with the benchmarks.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/171820