YSYu Ted Su

Yu Ted Su

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Yu Ted Su has a total of 102 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Fast Max-Log-MAP Detection of Irregular APSK Signals by Traversal Over Rings of Ordered PSK Constellation Points

    by Tsung-Hsien Liu, Don-Lin Yang, Jing-Hong Huang, Yu Ted Su

    Amplitude phase shift keying (APSK) modulation signals are of low peak average power ratio and are generated to fight against the potentially non-linear high power amplifier in satellite communication. The benchmark maximum log-likelihood maximum a posteriori probability (max-log-MAP) detector requires to compute the distance squared between the received signal and each APSK constellation point for the extrinsic bit log-likelihood ratio (LLR) information. To overcome this major challenge of high detection complexity, we propose in this paper to partition and order all the APSK constellation points into rings of ordered phase shift keying (PSK) constellation points. We also propose to apply and tailor the iterative search strategies, originally used to detect multiple input multiple output (MIMO) quadrature amplitude modulation (QAM) signals, to search over the ordered irregular PSK constellation points. Compared with previously reported APSK detectors, our proposed detector achieves exactly the max-log-MAP detection, requires very low computational complexity, and is able to detect APSK signals modulated from the APSK constellation with arbitrary number of constellation points, arbitrary phase offsets, and arbitrary ring radii.


  • Open Access

    Detection of Spatial-Modulated Signals in the Presence of CSI Uncertainty and Spatially- and Time-Selective Fading

    by Hsuan-Cheng Chang, Yen-Cheng Liu, Yu T. Su

    Although the channel state information (CSI) is never perfect and varies in time, most studies on spatial modulation (SM) systems assume perfectly known CSI and time-invariant channel. The spatial correlations among multiple spatial subchannels, which have to be considered when CSI is imperfect, are also often neglected. In this paper, we release the above assumptions and take the CSI uncertainty along with the spatial-temporal selectivities into account. We derive the channel estimation error aware maximum likelihood (CEEA-ML) detectors as well as several low-complexity alternatives for PSK and QAM signals. As the CSI uncertainty depends on the channel estimator (CE) used, we consider two well-known CEs in our study. The error rate performance of the ML and some suboptimal detectors is analyzed. Numerical results obtained by simulations and analysis show that the CEEA-ML detectors offer clear performance gain against conventional mismatched SM detectors and, in many cases, the proposed suboptimal detectors incur only minor performance loss.


  • Belief-Propagation Decoding of LDPC Codes With Variable Node–Centric Dynamic Schedules

    by Tofar C.-Y. Chang, Pin-Han Wang, Jian-Jia Weng, I-Hsiang Lee, Yu T. Su

    Belief propagation (BP) decoding of low-density parity-check (LDPC) codes with various dynamic decoding schedules have been proposed to improve the efficiency of the conventional flooding schedule. As the ultimate goal of an ideal LDPC code decoder is to have correct bit decisions, a dynamic decoding schedule should be variable node (VN)-centric and be able to find the VNs with probable incorrect decisions and having a good chance to be corrected if chosen for update. We propose a novel and effective metric called conditional innovation (CI) which serves this design goal well. To make the most of dynamic scheduling which produces high-reliability bit decisions, we limit our search for the candidate VNs to those related to the latest updated nodes only. Based on the CI metric and the new search guideline separately or in combination, we develop several highly efficient decoding schedules. To reduce decoding latency, we introduce multi-edge updating versions which offer extra latency-performance tradeoffs. Numerical results show that both single-edge and multi-edge algorithms provide better decoding performance against most dynamic schedules and the CI-based algorithms are particularly impressive at the first few decoding iterations.


  • A ML-MMSE Receiver for Millimeter Wave User-Equipment Detection: Beamforming, Beamtracking, and Data-Symbols Detection

    by Jiun-Hung Yu, Zhen-Hao Yu, Kang-Li Wu, Ta-Sung Lee, Yu T. Su

    For a millimeter wave (mmWave) system consisting of a basestation (BS) and a mobile user-equipment (UE), the problem of signal-and-data detection is investigated, and a low complexity ML-MMSE receiver for mmWave beamforming, beamtracking, and data-symbols detection is proposed. Specifically, with a (practical) hybrid beamforming transceiver architecture at both the BS and UE, a multistage angle-of-arrival (AoA) estimation based beamtraining algorithm that provides fast acquisition of the best beam pairs for the BS-UE link is developed. In addition, a novel joint beamtracking and data-symbols detection algorithm, equipped with an adaptive equalizer, is also developed. The algorithm can simultaneously track the best receiving beams, and produce the data estimates that are easy to extract soft bit information for soft decoding; also, it can tackle the dynamic changes of the baseband effective channel. Analytical and simulation results show that the proposed receiver performs well over a broad range of SNR-it can rapidly acquire the most dominant AoAs for beamforming and constantly track the best moving beams due to UE's mobility or device rotation-and in particular, it achieves near-optimal spectral efficiency for a mobile UE with a single RF chain or very few RF chains.


  • Sparse Bayesian Learning Based Tensor Dictionary Learning and Signal Recovery With Application to MIMO Channel Estimation

    by Wen-Che Chang, Yu T. Su

    In this paper, we develop solutions for sparse tensor signal recovery (SR) and tensor dictionary learning (DL) problems via the sparse Bayesian learning (SBL) approach. We consider a class of tensor system which has the special sparsity structure that a given (say the i th) row of every unfolding matrices of the tensor involved is simultaneously zero or non-zero. For both problems, we propose a Kronecker-like prior distribution for the variables to be recovered in the framework of SBL to take advantage of this sparsity structure. For tensor DL, we consider a de-noising problem in which the clear version is recoverable from sparse coefficients and several separable dictionaries. Our prior distribution model for sparse coefficients entails that the same column of these separable dictionaries have a common prior distribution. We show that our SBL-based algorithms for solving the SR and DL problems require much lower complexity than that of the corresponding vector-matrix system by reducing the matrix inversion size. The proposed SBL-DL and SBL-SR algorithms are utilized, invoking a tensor virtual channel model, to estimate the channel response of a millimeter wave communication system which employs uniform planar arrays on both sides. The superiority of the resulting channel estimates is verified by computer simulations.


  • Open Access

    Resource Allocation and Node Placement in Multi-Hop Heterogeneous Integrated-Access-and-Backhaul Networks

    by Jiun Y. Lai, Wu-Hsiu Wu, Yu T. Su

    We consider a heterogeneous MIMO-OFDMA based dense small cell (SC) system in which each macro cell base station (MBS) serves its coverage area with the help of small cell base stations (SBSs) through multi-hop wireless connections. The SBSs act as integrated access and backhaul (IAB) nodes that handle both access and backhaul traffics with wireless links. We first develop an optimal (sum-rate maximization) resource allocation (RA) algorithm which considers subcarriers/spatial subchannels assignment and the associated power allocations. We also present two low-complexity suboptimal RA schemes which, as verified by simulations, incur only minor performance loss in the high SNR region. Our RA algorithms can be applied to other multi-hop networks with general UE association rule and node location distributions. We study the channel aging effect caused by the time lag between the time channel state information (CSI) is measured and that when data transmission occurs. We show the benefit of channel prediction and the limit of a centralized RA approach. The advantages of frequency (channel) reuse and the multi-hop architecture are demonstrated as well. A related but perhaps more important system design issue for an IAB cellular network is the IAB node placement problem. With the given UE association rule and UE location distribution, we present systematic approaches to find the optimal node locations. For two special propagation models, we derive closed-form expressions for the node locations that maximizes a spectral efficiency lower bound. Numerical results validate the accuracy of our estimates based on either numerical evaluations or closed-form solutions.


  • Multi-Stage Bit-Flipping Decoding Algorithms for LDPC Codes

    by Tofar C.-Y. Chang, Pin-Han Wang, Yu T. Su

    We present two general multi-stage (MS) bit-flipping (BF) decoding algorithms for low-density parity-check (LDPC) codes. Both algorithms consist of soft-decision (SD) and hard-decision BF decoding parts. In comparison with known MS LDPC decoders, our approach is much simpler as all stages share the same BF structure. The only complexity increase is due to the use of an adaptive stage-switching (SS) mechanism which gives near-optimal SS timing. A new design issue we address is that the first-stage algorithm’s parameter has to be re-tuned to achieve the optimal overall performance. Numerical results demonstrate that the proposed decoding methods can significantly improve the error-rate performance of conventional SD BF decoders.


  • Adaptive Group Shuffled Decoding for LDPC Codes

    by Tofar C.-Y. Chang, Yu T. Su

    We propose new grouping methods for group shuffled (GS) decoding of both regular and irregular low-density parity check cods. These methods are applicable for the belief-propagation as well as the min-sum-based GS decoders. Integer-valued metrics for measuring the reliability of each tentative variable node (VN) decision and the associated likelihood of being corrected are developed. The metrics are used to determine the VN updating priority, so the grouping may vary in each iteration. We estimate the computation complexity needed to adaptively regroup VNs. Numerical results show that our GS algorithms improve the performance of some existing GS belief-propagation decoders.


  • Open Access

    New Signal Designs for Enhanced Spatial Modulation

    by Chien-Chun Cheng, Hikmet Sari, Serdar Sezginer, Yu T. Su

    In this paper, we present three new signal designs for Enhanced Spatial Modulation (ESM), which was recently introduced by the present authors. The basic idea of ESM is to convey information bits not only by the index(es) of the active transmit antenna(s) as in conventional Spatial Modulation (SM), but also by the types of the signal constellations used. The original ESM schemes were designed with reference to single-stream SM and involved one or more secondary modulations in addition to the primary modulation. Compared to single-stream SM, they provided either higher throughput or improved signal-to-noise ratio (SNR). In the present paper, we focus on multi-stream SM (MSM) and present three new ESM designs leading to increasing SNR gains when they are operated at the same spectral efficiency. The secondary signal constellations used in the first two designs are based on a single geometric interpolation step in the signal constellation plane, while the third design also makes use of additional constellations derived through a second interpolation step. The new ESM signal designs are described for MIMO systems with four transmit antennas two of which are active, but we also briefly present extensions to higher numbers of antennas. Theoretical analysis and simulation results indicate that the proposed designs provide a significant SNR gain over MSM.