Sung-En Chiu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Sung-En Chiu has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Tara Javidi
Department of Electrical and Computer Engineering University of California San Diego
5 shared publications - Bhaskar D. Rao
Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA, USA
2 shared publications - Nancy Ronquillo
Department of Electrical and Computer Engineering University of California San Diego
2 shared publications - Anusha Lalitha
Electrical and Computer Engineering Department, University of California at San Diego, La Jolla, CA, USA
1 shared publication - Nancy Ronquillo
Department of Electrical and Computer Engineering, University of California at San Diego, La Jolla, CA, USA
1 shared publication Tara Javidi
Department of Electrical and Computer Engineering University of California San Diego
1 shared publication
Latest Publications
- 12 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 67 (9) , 5731-5748
Low Complexity Sequential Search With Size-Dependent Measurement Noise
This paper considers a target localization problem where at any given time an agent can choose a region to query for the presence of the target in that region. The measurement noise is assumed to be increasing with the size of the query region the agent chooses. Motivated by practical applications such as initial beam alignment in array processing, heavy hitter detection in networking, and visual search in robotics, we consider practically important complexity constraints/metrics: time complexity, computational and memory complexity, and the complexity of possible query sets in terms of geometry and cardinality. Two novel search strategy, dyaPM and hiePM, are proposed. Pertinent to the practicality of our solutions, dyaPM and hiePM are of a connected query geometry (i.e. query set is always a connected set) implemented with low computational and memory complexity. Additionally, hiePM has a hierarchical structure and, hence, a further reduction in the cardinality of possible query sets, making hiePM practically suitable for applications such as beamforming in array processing where memory limitations favors a small and predefined query sets. Through a unified analysis with Extrinsic Jensen Shannon (EJS) Divergence, dyaPM is shown to be asymptotically optimal in search time complexity (asymptotic in both resolution (rate) and error (reliability)). On the other hand, hiePM is shown to be near-optimal in rate. In addition, both hiePM and dyaPM are shown to outperform prior work in the non-asymptotic regime.
- 12 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 67 (9) , 5731-5748
Low Complexity Sequential Search With Size-Dependent Measurement Noise
This paper considers a target localization problem where at any given time an agent can choose a region to query for the presence of the target in that region. The measurement noise is assumed to be increasing with the size of the query region the agent chooses. Motivated by practical applications such as initial beam alignment in array processing, heavy hitter detection in networking, and visual search in robotics, we consider practically important complexity constraints/metrics: time complexity, computational and memory complexity, and the complexity of possible query sets in terms of geometry and cardinality. Two novel search strategy, dyaPM and hiePM, are proposed. Pertinent to the practicality of our solutions, dyaPM and hiePM are of a connected query geometry (i.e. query set is always a connected set) implemented with low computational and memory complexity. Additionally, hiePM has a hierarchical structure and, hence, a further reduction in the cardinality of possible query sets, making hiePM practically suitable for applications such as beamforming in array processing where memory limitations favors a small and predefined query sets. Through a unified analysis with Extrinsic Jensen Shannon (EJS) Divergence, dyaPM is shown to be asymptotically optimal in search time complexity (asymptotic in both resolution (rate) and error (reliability)). On the other hand, hiePM is shown to be near-optimal in rate. In addition, both hiePM and dyaPM are shown to outperform prior work in the non-asymptotic regime.
- Open Access
Low Complexity Sequential Search with Size-Dependent Measurement Noise
This paper considers a target localization problem where at any given time an agent can choose a region to query for the presence of the target in that region. The measurement noise is assumed to be increasing with the size of the query region the agent chooses. Motivated by practical applications such as initial beam alignment in array processing, heavy hitter detection in networking, and visual search in robotics, we consider practically important complexity constraints/metrics: \textit{time complexity}, \textit{computational and memory complexity}, and the complexity of possible query sets in terms of geometry and cardinality. Two novel search strategy, $dyaPM$ and $hiePM$, are proposed. Pertinent to the practicality of out solutions, $dyaPM$ and $hiePM$ are of a connected query geometry (i.e. query set is always a connected set) implemented with low computational and memory complexity. Additionally, $hiePM$ has a hierarchical structure and, hence, a further reduction in the cardinality of possible query sets, making $hiePM$ practically suitable for applications such as beamforming in array processing where memory limitations favors a smaller codebook size. Through a unified analysis with Extrinsic Jensen Shannon (EJS) Divergence, $dyaPM$ is shown to be asymptotically optimal in search time complexity (asymptotic in both resolution (rate) and error (reliability)). On the other hand, $hiePM$ is shown to be near-optimal in rate. In addition, both $hiePM$ and $dyaPM$ are shown to outperform prior work in the non-asymptotic regime.Open AccessLow Complexity Sequential Search with Size-Dependent Measurement Noise
This paper considers a target localization problem where at any given time an agent can choose a region to query for the presence of the target in that region. The measurement noise is assumed to be increasing with the size of the query region the agent chooses. Motivated by practical applications such as initial beam alignment in array processing, heavy hitter detection in networking, and visual search in robotics, we consider practically important complexity constraints/metrics: \textit{time complexity}, \textit{computational and memory complexity}, and the complexity of possible query sets in terms of geometry and cardinality. Two novel search strategy, $dyaPM$ and $hiePM$, are proposed. Pertinent to the practicality of out solutions, $dyaPM$ and $hiePM$ are of a connected query geometry (i.e. query set is always a connected set) implemented with low computational and memory complexity. Additionally, $hiePM$ has a hierarchical structure and, hence, a further reduction in the cardinality of possible query sets, making $hiePM$ practically suitable for applications such as beamforming in array processing where memory limitations favors a smaller codebook size. Through a unified analysis with Extrinsic Jensen Shannon (EJS) Divergence, $dyaPM$ is shown to be asymptotically optimal in search time complexity (asymptotic in both resolution (rate) and error (reliability)). On the other hand, $hiePM$ is shown to be near-optimal in rate. In addition, both $hiePM$ and $dyaPM$ are shown to outperform prior work in the non-asymptotic regime. - Open Access
Sequential Learning of CSI for MmWave Initial Alignment
MmWave communications aim to meet the demand for higher data rates by using highly directional beams with access to larger bandwidth. An inherent challenge is acquiring channel state information (CSI) necessary for mmWave transmission. We consider the problem of adaptive and sequential learning of the CSI during the mmWave initial alignment phase of communication. We focus on the single-user with a single dominant path scenario where the problem is equivalent to acquiring an optimal beamforming vector, where ideally, the resulting beams point in the direction of the angle of arrival with the desired resolution. We extend our prior by proposing two algorithms for adaptively and sequentially selecting beamforming vectors for learning of the CSI, and that formulate a Bayesian update to account for the time-varying fading model. Numerically, we analyze the outage probability and expected spectral efficiency of our proposed algorithms and demonstrate improvements over strategies that utilize a practical hierarchical codebook.
Open AccessSequential Learning of CSI for MmWave Initial Alignment
MmWave communications aim to meet the demand for higher data rates by using highly directional beams with access to larger bandwidth. An inherent challenge is acquiring channel state information (CSI) necessary for mmWave transmission. We consider the problem of adaptive and sequential learning of the CSI during the mmWave initial alignment phase of communication. We focus on the single-user with a single dominant path scenario where the problem is equivalent to acquiring an optimal beamforming vector, where ideally, the resulting beams point in the direction of the angle of arrival with the desired resolution. We extend our prior by proposing two algorithms for adaptively and sequentially selecting beamforming vectors for learning of the CSI, and that formulate a Bayesian update to account for the time-varying fading model. Numerically, we analyze the outage probability and expected spectral efficiency of our proposed algorithms and demonstrate improvements over strategies that utilize a practical hierarchical codebook.
- Open Access
Active Learning and CSI Acquisition for mmWave Initial Alignment
Millimeter wave (mmWave) communication with large antenna arrays is a promising technique to enable extremely high data rates due to the large available bandwidth in mmWave frequency bands. In addition, given the knowledge of an optimal directional beamforming vector, large antenna arrays have been shown to overcome both the severe signal attenuation in mmWave as well as the interference problem. However, fundamental limits on achievable learning rate of an optimal beamforming vector remain. This paper considers the problem of adaptive and sequential optimization of the beamforming vectors during the initial access phase of communication. With a single-path channel model, the problem is reduced to actively learning the Angle-of-Arrival (AoA) of the signal sent from the user to the Base Station (BS). Drawing on the recent results in the design of a hierarchical beamforming codebook [1], sequential measurement dependent noisy search strategies [2], and active learning from an imperfect labeler [3], an adaptive and sequential alignment algorithm is proposed. An upper bound on the expected search time of the proposed algorithm is derived via Extrinsic Jensen-Shannon Divergence. which demonstrates that the search time of the proposed algorithm asymptotically matches the performance of the noiseless bisection search up to a constant factor. Furthermore, the upper bound shows that the acquired AoA error probability decays exponentially fast with the search time with an exponent that is a decreasing function of the acquisition rate. Numerically, the proposed algorithm is compared with prior work where a significant improvement of the system communication rate is observed. Most notably, in the relevant regime of low (-10dB to 5dB) raw SNR, this establishes the first practically viable solution for initial access and, hence, the first demonstration of stand-alone mmWave communication
Open AccessActive Learning and CSI Acquisition for mmWave Initial Alignment
Millimeter wave (mmWave) communication with large antenna arrays is a promising technique to enable extremely high data rates due to the large available bandwidth in mmWave frequency bands. In addition, given the knowledge of an optimal directional beamforming vector, large antenna arrays have been shown to overcome both the severe signal attenuation in mmWave as well as the interference problem. However, fundamental limits on achievable learning rate of an optimal beamforming vector remain. This paper considers the problem of adaptive and sequential optimization of the beamforming vectors during the initial access phase of communication. With a single-path channel model, the problem is reduced to actively learning the Angle-of-Arrival (AoA) of the signal sent from the user to the Base Station (BS). Drawing on the recent results in the design of a hierarchical beamforming codebook [1], sequential measurement dependent noisy search strategies [2], and active learning from an imperfect labeler [3], an adaptive and sequential alignment algorithm is proposed. An upper bound on the expected search time of the proposed algorithm is derived via Extrinsic Jensen-Shannon Divergence. which demonstrates that the search time of the proposed algorithm asymptotically matches the performance of the noiseless bisection search up to a constant factor. Furthermore, the upper bound shows that the acquired AoA error probability decays exponentially fast with the search time with an exponent that is a decreasing function of the acquisition rate. Numerically, the proposed algorithm is compared with prior work where a significant improvement of the system communication rate is observed. Most notably, in the relevant regime of low (-10dB to 5dB) raw SNR, this establishes the first practically viable solution for initial access and, hence, the first demonstration of stand-alone mmWave communication
- 8 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 37 (11) , 2474-2489
Active Learning and CSI Acquisition for mmWave Initial Alignment
Millimeter wave (mmWave) communication with large antenna arrays is a promising technique to enable extremely high data rates due to large available bandwidth in mmWave frequency bands. In addition, given the knowledge of an optimal directional beamforming vector, large antenna arrays have been shown to overcome both the severe signal attenuation in mmWave as well as the interference problem. However, fundamental limits on achievable learning rate of an optimal beamforming vector remain. This paper considers the problem of adaptive and sequential optimization of the beamforming vectors during the initial access phase of communication. With a single-path channel model, the problem is reduced to actively learning the Angle-of-Arrival (AoA) of the signal sent from the user to the Base Station (BS). Drawing on the recent results in the design of a hierarchical beamforming codebook 1, sequential measurement dependent noisy search strategies 2, and active learning from an imperfect labeler 3, an adaptive and sequential alignment algorithm is proposed. For any given resolution and error probability of the estimated AoA, an upper bound on the expected search time of the proposed algorithm is derived via Extrinsic Jensen-Shannon Divergence. The upper bound demonstrates that the search time of the proposed algorithm asymptotically matches the performance of the noiseless bisection search up to a constant factor, in effect, characterizing the AoA acquisition rate. Furthermore, the upper bound shows that the acquired AoA error probability decays exponentially fast with the search time with an exponent that is a decreasing function of the acquisition rate. Numerically, the proposed algorithm is compared with prior work where a significant improvement of the system communication rate is observed. Most notably, in the relevant regime of low (−10dB to +5dB) raw SNR, this establishes the first practically viable solution for initial access and, hence, the first demonstration of stand-alone mmWave communication.
- 8 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 37 (11) , 2474-2489
Active Learning and CSI Acquisition for mmWave Initial Alignment
Millimeter wave (mmWave) communication with large antenna arrays is a promising technique to enable extremely high data rates due to large available bandwidth in mmWave frequency bands. In addition, given the knowledge of an optimal directional beamforming vector, large antenna arrays have been shown to overcome both the severe signal attenuation in mmWave as well as the interference problem. However, fundamental limits on achievable learning rate of an optimal beamforming vector remain. This paper considers the problem of adaptive and sequential optimization of the beamforming vectors during the initial access phase of communication. With a single-path channel model, the problem is reduced to actively learning the Angle-of-Arrival (AoA) of the signal sent from the user to the Base Station (BS). Drawing on the recent results in the design of a hierarchical beamforming codebook 1, sequential measurement dependent noisy search strategies 2, and active learning from an imperfect labeler 3, an adaptive and sequential alignment algorithm is proposed. For any given resolution and error probability of the estimated AoA, an upper bound on the expected search time of the proposed algorithm is derived via Extrinsic Jensen-Shannon Divergence. The upper bound demonstrates that the search time of the proposed algorithm asymptotically matches the performance of the noiseless bisection search up to a constant factor, in effect, characterizing the AoA acquisition rate. Furthermore, the upper bound shows that the acquired AoA error probability decays exponentially fast with the search time with an exponent that is a decreasing function of the acquisition rate. Numerically, the proposed algorithm is compared with prior work where a significant improvement of the system communication rate is observed. Most notably, in the relevant regime of low (−10dB to +5dB) raw SNR, this establishes the first practically viable solution for initial access and, hence, the first demonstration of stand-alone mmWave communication.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 321-325
Bit-wise Sequential Coding with Feedback
This paper considers the problem of bit-wise channel coding over a Binary Symmetric Channel (BSC) with feedback. While it is known that feedback does not increase the capacity of a memoryless channel, it is believed to simplify the coding schemes for some channels. The most significant one is the Binary Erasure Channel (BEC) where capacity is achieved by a simple sequential bit-wise repetition code under which each bit is (re-)transmitted until it is received. This sequential bit-wise feedback code has the added advantage that it can be used for streaming applications over BECs. In contrast, there is no known sequential bit-wise code with feedback that can achieve nonzero transmission rate for a BSC. For example, under Posterior Matching for a binary input channel with feedback, also known as Horstein scheme, each message is considered in its entirety in a block coding manner. This paper proposes a sequential feedback coding scheme with a nested bit-wise structure that generalizes repetition codes. This scheme is shown to achieve strictly positive rate for a large class of binary input channels including a BSC with arbitrary cross-over probability p ∈ (0, 1/2). The analysis relies on characterizing a lower bound on the step-wise Extrinsic Jensen Shannon divergence.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 321-325
Bit-wise Sequential Coding with Feedback
This paper considers the problem of bit-wise channel coding over a Binary Symmetric Channel (BSC) with feedback. While it is known that feedback does not increase the capacity of a memoryless channel, it is believed to simplify the coding schemes for some channels. The most significant one is the Binary Erasure Channel (BEC) where capacity is achieved by a simple sequential bit-wise repetition code under which each bit is (re-)transmitted until it is received. This sequential bit-wise feedback code has the added advantage that it can be used for streaming applications over BECs. In contrast, there is no known sequential bit-wise code with feedback that can achieve nonzero transmission rate for a BSC. For example, under Posterior Matching for a binary input channel with feedback, also known as Horstein scheme, each message is considered in its entirety in a block coding manner. This paper proposes a sequential feedback coding scheme with a nested bit-wise structure that generalizes repetition codes. This scheme is shown to achieve strictly positive rate for a large class of binary input channels including a BSC with arbitrary cross-over probability p ∈ (0, 1/2). The analysis relies on characterizing a lower bound on the step-wise Extrinsic Jensen Shannon divergence.
- Open Access
- 9 March 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Signal Processing
- Vol. 12 (3) , 499-513
Bayesian Channel Estimation Algorithms for Massive MIMO Systems With Hybrid Analog-Digital Processing and Low-Resolution ADCs
We address the problem of channel estimation in massive multiple-input multiple-output (Massive MIMO) systems where both hybrid analog-digital (AD) processing and low-resolution analog-to-digital converters (ADCs) are utilized. The hardware-efficient architecture is attractive from a power and cost point of view, but poses two significant channel estimation challenges. One is due to the smaller dimension of the measurement signal obtained from the limited number of RF chains, and the other is the coarser measurements from the low-resolution ADCs. We address this problem by utilizing two sources of information. Firstly, by exploiting the sparse nature of the channel in the angular domain, the channel estimate is enhanced and the required number of pilots is reduced. Secondly, by utilizing the transmitted data symbols as the "virtual pilots", the channel estimate is further improved without adding more pilot symbols. The constraints imposed by the architecture, the sparsity of the channel and the data aided channel estimation are treated in a unified manner by employing a Bayesian formulation. The quantized sparse channel estimation is formulated into a sparse Bayesian learning (SBL) framework, and solved using the variational Bayesian (VB) method. Simulation results show that the proposed algorithm can efficiently estimate the channel even with the architectural constraints, and that significant improvements are enabled by leveraging the transmitted data symbols.
- 9 March 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Signal Processing
- Vol. 12 (3) , 499-513
Open AccessBayesian Channel Estimation Algorithms for Massive MIMO Systems With Hybrid Analog-Digital Processing and Low-Resolution ADCs
We address the problem of channel estimation in massive multiple-input multiple-output (Massive MIMO) systems where both hybrid analog-digital (AD) processing and low-resolution analog-to-digital converters (ADCs) are utilized. The hardware-efficient architecture is attractive from a power and cost point of view, but poses two significant channel estimation challenges. One is due to the smaller dimension of the measurement signal obtained from the limited number of RF chains, and the other is the coarser measurements from the low-resolution ADCs. We address this problem by utilizing two sources of information. Firstly, by exploiting the sparse nature of the channel in the angular domain, the channel estimate is enhanced and the required number of pilots is reduced. Secondly, by utilizing the transmitted data symbols as the "virtual pilots", the channel estimate is further improved without adding more pilot symbols. The constraints imposed by the architecture, the sparsity of the channel and the data aided channel estimation are treated in a unified manner by employing a Bayesian formulation. The quantized sparse channel estimation is formulated into a sparse Bayesian learning (SBL) framework, and solved using the variational Bayesian (VB) method. Simulation results show that the proposed algorithm can efficiently estimate the channel even with the architectural constraints, and that significant improvements are enabled by leveraging the transmitted data symbols.
- 19 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Correlation learning on joint support recovery for more sources than measurements
Consider MMV problem YM ×L = AM×N XN×L with X being D-row sparse. In this work, we first we analyze the MSBL algorithm by Wipf and Rao, and provide its limit in the M ≤ D regime. To improve support recovery, we further develop Bayesian methods for learning the correlation structures both temporally or spatially. In particular, we use the Inverse Wishart distribution, the conjugate prior for the covariance matrix of a Gaussian vector, to proceed with the Sparse Bayesian inference on the signal support. Simulation studies show that the method is robust, and it outperforms jointly support SBL families such as MSBL or TSBL under some circumstances.
- 19 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Correlation learning on joint support recovery for more sources than measurements
Consider MMV problem YM ×L = AM×N XN×L with X being D-row sparse. In this work, we first we analyze the MSBL algorithm by Wipf and Rao, and provide its limit in the M ≤ D regime. To improve support recovery, we further develop Bayesian methods for learning the correlation structures both temporally or spatially. In particular, we use the Inverse Wishart distribution, the conjugate prior for the covariance matrix of a Gaussian vector, to proceed with the Sparse Bayesian inference on the signal support. Simulation studies show that the method is robust, and it outperforms jointly support SBL families such as MSBL or TSBL under some circumstances.