Silas Fong

Dr. Silas Fong


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 January 2019 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
SFSilas Fong
Silas Fong
AKAshish Khisti
Ashish Khisti
BLBaochun Li
Baochun Li
WTWai-Tian Tan
Wai-Tian Tan
XZXiaoqing Zhu
Xiaoqing Zhu
JAJohn Apostolopoulos
John Apostolopoulos
This paper considers transmitting a sequence of messages (streaming messages) over a packet erasure channel. In each time slot, the source constructs a packet based on the current and the previous messages and transmits the packet, which may be erased when the packet travels from the source to the destination. Every source message must be recovered perfectly at the destination subject to a fixed decoding delay. We assume that the channel loss model introduces either one burst erasure or multiple arbitrary erasures in any fixed-sized sliding window. Under this channel loss assumption, we fully characterize the maximum achievable rate by constructing streaming codes that achieve the optimal rate. In addition, our construction of optimal streaming codes implies the full characterization of the maximum achievable rate for convolutional codes with any given column distance, column span and decoding delay. Numerical results demonstrate that the optimal streaming codes outperform existing streaming codes of comparable complexity over some instances of the Gilbert-Elliott channel and the Fritchman channel.

12 September 2019 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
SFSilas Fong
Silas Fong
AKAshish Khisti
Ashish Khisti
BLBaochun Li
Baochun Li
WTWai-Tian Tan
Wai-Tian Tan
XZXiaoqing Zhu
Xiaoqing Zhu
JAJohn Apostolopoulos
John Apostolopoulos
This paper investigates low-latency streaming codes for a three-node relay network. The source transmits a sequence of messages (streaming messages) to the destination through the relay between them, where the first-hop channel from the source to the relay and the second-hop channel from the relay to the destination are subject to packet erasures. Every source message generated at a time slot must be recovered perfectly at the destination within the subsequent T time slots. In any sliding window of T + 1 time slots, we assume no more than N1 and N2 erasures are introduced by the first-hop channel and secondhop channel respectively. We fully characterize the maximum achievable rate in terms of T, N1 and N2. The achievability is proved by using a symbol-wise decode-forward strategy where the source symbols within the same message are decoded by the relay with different delays. The converse is proved by analyzing the maximum achievable rate for each channel when the erasures in the other channel are consecutive (bursty). In addition, we show that traditional message-wise decode-forward strategies, which require the source symbols within the same message to be decoded by the relay with the same delay, are sub-optimal in general.

18 May 2016 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
SFSilas Fong
Silas Fong
VTVincent Y. F. Tan
Vincent Y. F. Tan
We prove the strong converse for the N -source Gaussian multiple access channel. In particular, we show that any rate tuple that can be supported by a sequence of codes with asymptotic average error probability <;1 must lie in the Cover-Wyner capacity region. Our proof consists of the following. First, we perform an expurgation step to convert any given sequence of codes with asymptotic average error probability <;1 to codes with asymptotic maximal error probability <;1. Second, we quantize the input alphabets with an appropriately chosen resolution. Upon quantization, we apply the wringing technique (by Ahlswede) on the quantized inputs to obtain further subcodes from the subcodes obtained in the expurgation step, so that the resultant correlations among the symbols transmitted by the different sources vanish as the blocklength grows. Finally, we derive upper bounds on achievable sum-rates of the subcodes in terms of the type-II error of a binary hypothesis test. These upper bounds are then simplified through judicious choices of auxiliary output distributions. Our strong converse result carries over to the Gaussian interference channel under strong interference as long as the sum of the two asymptotic average error probabilities <;1.

23 June 2016 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
SFSilas Fong
Silas Fong
VTVincent Tan
Vincent Tan
This paper establishes that the strong converse holds for some classes of discrete memoryless multimessage multicast networks (DM-MMNs) whose corresponding cut-set bounds are tight, i.e., coincide with the corresponding sets of achievable rate tuples. Our strong converse result implies that for any DM-MMN of these classes, the average error probabilities of any sequence of codes operated at a rate tuple belonging to the exterior of the cut-set bound must tend to one (and are not simply bounded away from zero) as the block length grows. Examples in the classes of DM-MMNs include wireless erasure networks, DM-MMNs consisting of independent discrete memoryless channels (DMCs) as well as single-destination DM-MMNs consisting of independent DMCs with destination feedback. Our elementary proof technique leverages properties of the Rényi divergence.

18 October 2021 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
EDElad Domanovitz
Elad Domanovitz
SFSilas Fong
Silas Fong
AKAshish Khisti
Ashish Khisti
This paper considers the transmission of an infinite sequence of messages (a streaming source) over a packet erasure channel, where every source message must be recovered perfectly at the destination subject to a fixed decoding delay. While the capacity of a channel that introduces only bursts of erasures has been known for more than fifteen years, only recently, the capacity of a channel with either one burst of erasures or multiple arbitrary erasures in any fixed-sized sliding window has been established. However, explicit codes shown to achieve this capacity for any admissible set of parameters require a large field size that scales exponentially with the delay. Recently, it has been shown that there exist codes that achieve the capacity with field size which scales quadratically with the delay. However, explicit constructions were shown only to specific combinations of parameters. This work describes an explicit rate-optimal construction for all admissible channel and delay parameters over a field size that scales quadratically with the delay.

5 January 2017 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
Lan TruongLan Truong
Lan Truong
SFSilas Fong
Silas Fong
VTVincent Tan
Vincent Tan
In this paper, we consider single-and multi-user Gaussian channels with feedback under expected power constraints and with non-vanishing error probabilities. In the first of two contributions, we study asymptotic expansions for the additive white Gaussian noise (AWGN) channel with feedback under the average error probability formalism. By drawing ideas from Gallager and Nakiboǧlu's work for the direct part and the meta-converse for the converse part, we establish the e-capacity and show that it depends on e in general and so the strong converse fails to hold. Furthermore, we provide bounds on the second-order term in the asymptotic expansion. We show that for any positive integer L, the second-order term is bounded between a term proportional to - ln(L) n (where ln(L)(·) is the L-fold nested logarithm function) and a term proportional to +(n ln n)1/2, where n is the blocklength. The lower bound on the second-order term shows that feedback does provide an improvement in the maximal achievable rate over the case where no feedback is available. In our second contribution, we establish the e-capacity region for the AWGN multiple access channel with feedback under the expected power constraint by combining ideas from hypothesis testing, information spectrum analysis, Ozarow's coding scheme, and power control.