Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Journal article
Title: Coding and bounds for channel estimation in visible light communications and positioning
Author: Ho, S.W.
Saed, A.A.
Lai, L.
Sung, C.W.
Citation: IEEE Journal on Selected Areas in Communications, 2018; 36(1):34-44
Publisher: IEEE
Issue Date: 2018
ISSN: 0733-8716
Statement of
Siu-Wai Ho, Abdullah A. Saed, Lifeng Lai, Chi Wan Sung
Abstract: — In visible light communications (VLC) and visible light positioning (VLP), it is essential to obtain accurate estimates of the channel gains between receiver and multiple light sources. When there are multiple transmitters, time-division multiple access (TDMA) is typically used in the channel estimation phase of radio frequency systems. However, the estimation performance of TDMA-based schemes in VLC and VLP systems is substantially impacted by the maximum power constraint and desired average power constraint that are unique to visible light systems. Under these constraints, this paper explores coding schemes for the simultaneous channel gain estimations of multiple light sources such that the total and maximum noise variances of the channel estimates by the receiver are minimized. Although the minimization problem is non-convex, criteria for optimal codes are found by using majorization theory. Coding scheme satisfying these criteria is proposed that helps to characterize the fundamental tradeoff between noise variance and codeword length.
Keywords: Visible light communications; visible light positioning; channel estimation; power estimation; TDMA; majorisation theory; non-convex optimisation
Rights: © 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
DOI: 10.1109/JSAC.2017.2774718
Grant ID:
Published version:
Appears in Collections:Aurora harvest 8
Electrical and Electronic Engineering publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.