Full-Time
 
Home → Faculty → Dr. Yu-Chih Huang Professor
Dr. Yu-Chih Huang
Dr. Yu-Chih Huang
Professor
Group:
Wireless Communications
Office:
ED834
Phone:
03-5712121 ext.54582
E-mail:
jerryhuang@nycu.edu.tw
Website:
https://sites.google.com/site/ycjerryhuang/
Research:
Wireless Communication Technology, Error-Control Coding, Information Theory
  • Biography
    Y.-M. Huang ((Member, IEEE) received the Ph.D. degree in electrical and computer engineering from Texas A&M University (TAMU) in 2013. From 2013 to 2015, he was a Postdoctoral Research Associate with TAMU. In 2015, he joined the Department of Communication Engineering, National Taipei University, Taiwan, as an Assistant Professor and was promoted to an Associate Professor in 2018. In 2020, he joined the Institute of Communications Engineering, National Yang Ming Chiao Tung University (NYCU), Taiwan, where he is currently an associate professor. His research interests are in information theory, coding theory, wireless communications, and statistical signal processing. He received the 2018 IEEE Information Theory Society Taipei Chapter and IEEE Communications Society Taipei/Tainan Chapter’s Best Paper Award for Young Scholars and was a recipient of the MOST Young Scholar Fellowship 2020.

    Personal Information:

    NYCU Academic Hub: https://scholar.nycu.edu.tw/zh/persons/yu-chih-huang
    My personal webpage: https://sites.google.com/site/ycjerryhuang/
    Personal E-mail: jerryhuang@nctu.edu.tw
     

  • Experience, Honors and Awards

    Honors and Awards

    • Associate Professor (2020/02~)
    • Institute of Communications Engineering
    • National Yang Ming Chiao Tung University
    • Associate Professor (2018/02~2020/01)
    • Department of Communication Engineering
    • National Taipei University
    • Assistant Professor (2015/02~2018/01)
    • Department of Communication Engineering
    • National Taipei University
    • Postdoctoral Research Associate (2013/07~2015/01)
    • Department of Electrical and Computer Engineering
    • Texas A&M University, College Station, TX
    • Research Intern (2012/06~2012/08)
    • Bell Labs, Alcatel-Lucent, NJ
    • Research Assitant (2009/09~2013/05)
    • Department of Electrical and Computer Engineering
    • Texas A&M University, College Station, TX
    • Full-time Research Assistant (2007/07~2008/08)
    • Computer & Communication Research Center
    • National Tsing Hua University

    Professional Experience

    • 2023 MOST 電信學門計畫成果發表會優良研究成果展示
    • 2022 Excellent Teaching Award, NYCU
    • 2022 MOST 電信學門計畫成果發表會優良研究成果展示
    • 2021 Exemplary Editor, IEEE Communications Letters
    • 2021 Exemplary Reviewer (top 2%), IEEE Transactionss on Communications
    • 2021 Higher Education Academy (UK) Fellow
    • 2021 MOST 電信學門計畫成果發表會優良研究成果展示- 特優獎
    • 2020 MOST Young Scholar Fellowship – Columbus Project
    • 2020 Exemplary Editor, IEEE Communications Letters
    • 2019 National Taipei University Excellent Teaching Award (top 4%)
    • 2018 Exemplary Reviewer (top 3%), IEEE Wireless Communications Letters
    • 2018 Excellent Research Award, College of EECS, NTPU
    • 2018 IEEE Information Theory Society Taipei Chapter and IEEE Communications Society Taipei/Tainan Chapters Best Paper Award for Young Scholars
    • 2018 Universities Recruiting Special Outstanding Scholars Award, funded by Ministry of Science and Technology, R.O.C.
    • 2017 Universities Recruiting Special Outstanding Scholars Award, funded by Ministry of Science and Technology, R.O.C.
    • 2016 Universities Recruiting Special Outstanding Scholars Award, funded by Ministry of Science and Technology, R.O.C.
    • 2016 National Taipei University Excellent Teaching Award (top 4%)
    • 2015 Universities Recruiting Special Outstanding Scholars Award, funded by Ministry of Science and Technology, R.O.C.

  • Research Highlights

    B5G/6G Communications


    Our team has been involved in many researches related to post-5G and 6G communications. The main research directions are: 1. Physical layer coding modulation design of non-orthogonal multiple access (NOMA) systems. 2. Design novel random access technology for massive machine-type communication (mMTC) with heterogeneous equipment. The details are as follows:
    ychuang_1.png


    NOMA is an important candidate technology for post-5G and 6G communication systems. It has higher spectrum usage efficiency than the current OMA system, but these advantages come with higher complexity and decoding latency. The main reason is that traditional NOMA systems all use some form of sequential interference cancellation (SIC), which will significantly increase the decoding complexity and decoding delay at the receiving end. In this series of papers [1-1]- [1-4], we proposed a novel encoding method. In the NOMA system, the interference signal originates from other users' data and therefore has a strong structure. This design transmission mechanism cleverly utilizes the structure of the interference signal to achieve a design that only requires a single user decoder. Both theoretical proof and simulation results show that this method can approach the theoretical limit of NOMA without using SIC, and thus greatly reducing the complexity of NOMA in actual systems.ychuang_2.png


    In [1-5] we further discuss the NOMA system when ultra-reliable low latency communication (URLC) and enhanced mobile broadband (eMBB) applications coexist. Since the delay and reliability requirements of the two applications are different, we are bound to face a situation where the code lengths of the two mutually interfering signals do not match, causing the SIC to fail to operate. We propose a novel physical layer coding modulation design and rigorously analyze its performance theoretical limit under limited code length. Our analysis and simulation results show that our proposed method can approach the theoretical limit of performance under heterogeneous finite code lengths without using SIC.

     
    Most traditional communication systems are designed for communication between people, but in future applications such as IoT, machine-to-machine communication will become mainstream. In this FMTC transmission, the traditional method of first requesting a channel from the base station and then transmitting will be very inefficient, so grant-free or uncoordinated random access becomes crucial. Under this premise, based on the iterative collision resolution for slotted ALOHA (IRSA) system, our team proposed in [6] which devices in the network are heterogeneous. The heterogeneity can be used to achieve large Improved performance of the IRSA system. Simulation and theoretical analysis results show that this novel method can achieve gains of more than 40% and 70% when there are 2 and 3 types of heterogeneous users in the system
     S.-L. Shieh and Y.-M. Huang, “A simple scheme for realizing the promised gains of downlink non-orthogonal multiple access,” IEEE Transactions on Commun., vol.64, no. 4, pp.1624-1635, Apr. 2016. M. Qiu, Y.-M. Huang, S.-L. Shieh, and J. Yuan, “A lattice-partition framework of downlink non-orthogonal multiple access without SIC,” IEEE Transactions on Commun., vol. 66, no. 6, pp. 2532-2546, June, 2018.
     [1-1] S.-L. Shieh and Y.-M. Huang, “A simple scheme for realizing the promised gains of downlink non-orthogonal multiple access,” IEEE Transactions on Commun., vol.64, no. 4, pp.1624-1635, Apr. 2016. (IEEEXplore)
    [1-2] M. Qiu, Y.-M. Huang, S.-L. Shieh, and J. Yuan, “A lattice-partition framework of downlink non-orthogonal multiple access without SIC,” IEEE Transactions on Commun., vol. 66, no. 6, pp. 2532-2546, June, 2018. (IEEEXplore)
    [1-3] M. Qiu, Y.-M. Huang, and J. Yuan, “Downlink non-orthogonal multiple access without SIC for block fading channels: An algebraic rotation approach,” IEEE Transactions on Wireless Commun., vol. 18, no. 8, pp. 3903-3918, Aug. 2019. (IEEEXplore)
    [1-4] M. Qiu, Y.-M. Huang, J. Yuan, and C.-L. Wang, “Lattice-partition-based downlink non-orthogonal multiple access without SIC for slow fading channels,” IEEE Transactions on Commun., vol. 67, no. 2, pp. 1166-1181, Feb. 2019. (IEEEXplore)
    [1-5] M. Qiu, Y.-M. Huang, and J. Yuan, “Downlink transmission with heterogeneous URLLC services: Discrete signaling with single-user decoding,” IEEE J. on Sel. Areas in Commun., accepted, 2023. (IEEEXplore)
    [6] Y.-M. Huang, S.-L. Shieh, Y.-P. Hsu, and H.-P. Cheng, “Iterative collision resolution for slotted ALOHA with NOMA for heterogeneous devices,” IEEE Transactions on Commun., vol. 69, no. 5, pp. 2948-2961, May 2021. (IEEEXplore)

    Lattice Algebra


    Lattice is a special algebraic structure that has been studied in the fields of algebra and geometry for hundreds of years and has many applications in many fields. In the field of telecommunications, lattice codes built on lattice also have many applications. From early trellis coded modulation to more recent diversity coding and space-time codes, specific applications of lattice codes can be seen everywhere. Traditional lattice code construction methods can be divided into two methods: one is to construct a large-dimensional linear code first in the prime number field and then expand the linear code into a large-dimensional lattice code through Construction A. This construction method takes advantage of large-dimensional linear codes to effectively achieve coding gain. Research has proven that this construction method can construct the best lattice code that reaches the channel theoretical limit (such as Shannon limit and Poltyrev limit). The second category is to find an appropriate ideal in a ring of algebraic integers and then embed it into the Euclidean space. This construction method usually selects an algebraic integral ring with an appropriate algebraic structure based on the channel characteristics and constructs a lattice code on this ring so that it has the expected algebraic properties. For example, diversity coding mostly uses this method to construct small-dimensional high diversity gain lattice. Most of the research of this team focuses on novel application environments, using the special algebraic structure of lattice codes to construct the best codes that can prove their optimality and are easy to implement. The following list is all about research on this topic, and each result will be described below:

    ychuang_3.png

    In [2-1], our team proposed solutions to the shortcomings of the first type of construction method mentioned above. Our team found that this construction method relies on the ring homomorphism between the integer ring and the prime field. In order to achieve ring homomorphism and construct the optimal lattice code, previous research has used Construction A. The method constructs the lattice code in a large prime number field. This inevitably greatly increases the complexity of encoding and decoding. Therefore, our team proposed an innovative lattice code construction method called Construction πA. This construction method cleverly uses the Chinese remainder theorem to construct a lattice code that can be encoded and decoded with extremely low complexity. This paper further rigorously proves that the lattice code constructed using this method can reach the Poltyrev limit of the optimal coding gain. The concept of this lattice construction method is quite new. After its conference version was published in 2014, many internationally renowned scholars have used this lattice concept to design coding methods for other applications.
     
    In [2-2], our team breaks through the constrain and proposes a lattice construction method that unifies the above two methods, successfully constructing the best lattice code with both large- and small-dimensional characteristics. This construction method perfectly unifies the two construction methods that were clearly separated in the past, and provides future researchers with a novel way to construct lattice codes. Through this method, the designer can select an appropriate ring of algebraic integers based on the algebraic structure required by the problem, and then use the construction method provided in [2-2] to construct a large dimension of dot matrix under these algebraic integers. In this way, a lattice code can be constructed that has both the required algebraic structure and coding gain. Take the application of compute and forward as an example. Compute forward is a novel and highly efficient forwarding technology that utilizes the special structure of lattice codes in wireless relay networks. To realize this technology, the lattice code must have a linear combination that can efficiently decode several messages, and ring homomorphism is an algebraic structure that can achieve this effect. However, the lattice code constructed using the traditional method only has ring homomorphism with the integer ring, so in the operation forwarding, only integer multiple linear combinations of the lattice code words can be operated. In [2-2], our team used the novel construction method proposed in this article to construct a large-dimensional lattice code on imaginary quadratic integers, and proved that this lattice code can achieve the best Coding gain and shaping gain enable it to decode more possible linear combinations during operation forwarding, thereby further improving the performance of operation forwarding.
     
    Papers [2-3] propose novel optimal coding designs when there are receiver-side messages in the broadcast channel. The special algebraic structure of the lattice is used to construct a lattice index code that can achieve the best side information gain and diversity gain under any side information situation. Such environments can be found in retransmissions of satellite communications, wireless relay networks, communications with LTE side links, etc. This type of propagation environment may also occur in wireless caching technology, where the receiving end already has some information temporarily stored in the cache memory, has been very popular in recent years. In order to construct this optimal lattice index code, our team first uses an algebraic integer- ring to construct a diversity code, and then cleverly uses the Chinese remainder theorem to divide the algebraic integer ring to provide the best side information no matter what the situation to boost gain of messages. Although both use the Chinese remainder theorem as [2-1], the issues discussed in these two papers are completely different, and the lattice codes constructed are also very different. For example, [2-3] introduced a characteristic in algebraic number theory, that is, in the algebraic integer ring, two prime ideals (prime ideals) are mutually prime, which does not mean that the corresponding integers must be mutually prime. Therefore, we can use the Chinese remainder theorem to divide an ideal into multiple ideal construction lattice index codes that are mutually prime, but each message can be in the same prime number field. [2-3] Further use Hilbert class filed theory to construct an infinitely extending Hilbert class field tower, breaking through the limitation that the information in the previous lattice index code must be in different prime number fields, allowing us to construct that all the information is in the same prime number. The lattice index code of the field, so it is easier to implement.
     
    In [2-4], our team continue the work of [2-3] and try to construct a perfect space-time index block code that can provide the best side message gain in a multi-antenna system. However, perfect space-time block codes are constructed in cyclic division algebra and cannot be processed by the construction method based on algebraic integer rings as [2-3]. Unlike algebraic integer rings, cyclic division algebras are not commutative, and thus cannot be divided via the Chinese Remainder Theorem, which greatly increases the difficulty of construction. Our team uses the hierarchical nature of the cyclic division algebra itself to propose an innovative division method, which divides the cyclic division algebra hierarchically to construct a novel perfect space-time index block code. This idea is extremely innovative. In the past literature using cyclic division algebra, we have never seen layer-by-layer processing of cyclic division algebra. Based on the algebraic properties of this novel lattice construction method, our team further proved that this perfect spatio-temporal block index code can achieve the best diversity gain and side information gain for any side information in a multi-antenna system.
    [2-1] Y.-M. Huang and K. R. Narayanan, “Construction πA and πD lattices: Construction, goodness, and decoding algorithms,” IEEE Transactionss on Information Theory, vol. 63, no. 9, pp. 5718-5733, Sep. 2017. (IEEEXplore)
    [2-2] Y.-M. Huang, K. R. Narayanan, and P.-C. Wang, “Lattices over algebraic integers with an application to compute-and-forward,” IEEE Transactionss on Information Theory, vol. 64, no. 10, pp. 6863-6877, Oct. 2018. (IEEEXplore)
    [2-3] Y.-M. Huang, “Lattice index codes from algebraic number fields,” IEEE Transactionss on Information Theory, vol. 63, no. 4, pp. 2098-2112, Apr. 2017. (IEEEXplore)
    [2-4] Y.-M. Huang, Y. Hong, E. Viterbo, and L. Natarajan, “Layered space-time index coding,” IEEE Transactionss on Information Theory, vol. 65, no. 1, pp. 142-158, Jan. 2019. (IEEEXplore)

     

  • Journals
    • M. Qiu, Y.-M. Huang, and J. Yuan, “Downlink transmission with heterogeneous URLLC services: Discrete signaling with single-user decoding,” in IEEE Journal on Selected Areas in Communications, vol. 41, no. 7, pp. 2261-2277, July 2023.
    • H. Dau, R. Gabrys, Y.-M. Huang, C. Feng, Q.-H. Luu, E. Alzahrani, and Z. Tari, “Optimizing the transition waste in coded elastic computing,” 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA, 2020, pp. 174-178. (arXiv)
    • P.-W. Su, Y.-M. Huang, S.-C. Lin, I.-H. Wang, and C.-C. Wang, “Random linear streaming codes in the finite memory length and decoding deadline regime—part I: Exact analysis,” in IEEE Transactions on Information Theory, vol. 68, no. 10, pp. 6356-6387, Oct. 2022. (IEEEXplore)
    • H. Wang, Y.-M. Huang, and S.-C. Lin, “Universal feedback gain for modulo-sum computation over the erasure MAC,” IEEE Transactions on Inf. Theory, vol. 68, no. 4, pp. 2365-2383, Apr. 2022. (IEEEXplore)
    • M. Qiu, Y.-M. Huang, and J. Yuan, “Discrete signaling and treating interference as noise for the Gaussian interference channel,” IEEE Transactions on Inf. Theory, vol. 67, no. 11, pp. 7253-7284, Nov. 2021. (arXiv) (IEEEXplore)
    • S.-L. Shieh, Y.-M. Huang, P.-N. Chen, and Y.-M. Li, “Systematic polar coded modulation for informed receivers,” IEEE Transactions on Commun., vol. 69, no. 10, pp. 6469-6484, Oct. 2021. (IEEEXplore)
    • Y.-M. Huang, Y.-J. Huang, and S.-C. Lin, “Asymptotic optimality in Byzantine distributed quickest change detection,” IEEE Transactions on Inf. Theory, vol. 67, no. 9, pp. 5942-5962, Sep. 2021. (arXiv) (IEEEXplore)
    • Y.-M. Huang, S.-L. Shieh, Y.-P. Hsu, and H.-P. Cheng, “Iterative collision resolution for slotted ALOHA with NOMA for heterogeneous devices,” IEEE Transactions on Commun., vol. 69, no. 5, pp. 2948-2961, May 2021. (arXiv) (IEEEXplore)
    • S.-J. Wang, P.-N. Chen, S.-L. Shieh, and Y.-M. Huang, “Lagrange multiplier optimization of the probabilistic caching policy in the noise-limited network,” IEEE Transactions on Veh. Technol., vol. 70, no. 3, pp. 2684-2698, Mar. 2021. (IEEEXplore)
    • C.-Y. Lin, Y.-M. Huang, S.-L. Shieh, and P.-N. Chen, “Transformation of binary linear block codes to polar codes with dynamic frozen,” in IEEE Open Journal of the Communications Society, vol. 1, pp. 333-341, 2020. (IEEEXplore)
    • M. Qiu, Y.-M. Huang, and J. Yuan, “Downlink non-orthogonal multiple access without SIC for block fading channels: An algebraic rotation approach,” IEEE Transactions on Wireless Commun., vol. 18, no. 8, pp. 3903-3918, Aug. 2019. (IEEEXplore)
    • D. Fang, Y.-M. Huang, G. Geraci, Z. Ding, and H. Claussen, “Enhanced multiuser superposition transmission through structured modulation,” IEEE Transactions on Wireless Commun., vol. 18, no. 5, pp. 2765-2776, May 2019. (IEEEXplore)
    • M. Qiu, Y.-M. Huang, J. Yuan, and C.-L. Wang, “Lattice-partition-based downlink non-orthogonal multiple access without SIC for slow fading channels,” IEEE Transactions on Commun., vol. 67, no. 2, pp. 1166-1181, Feb. 2019.  (IEEEXplore)
    • Y.-M. Huang, Y. Hong, E. Viterbo, and L. Natarajan, “Layered space-time index coding,” IEEE Transactions on Inf. Theory, vol. 65, no. 1, pp. 142-158, Jan. 2019. (arXiv) (IEEEXplore)
    • Y.-M. Huang, K. R. Narayanan, and P.-C. Wang, “Lattices over algebraic integers with an application to compute-and-forward,” IEEE Transactions on Inf. Theory, vol. 64, no. 10, pp. 6863-6877, Oct. 2018. (Old title: Adaptive compute-and-forward with lattice codes over algebraic integers) (arXiv) (IEEEXplore)
    • Y.-M. Huang and S.-L. Shieh, “Polar codes for informed receivers,” IEEE Commun. Lett., vol. 22, no. 10, pp. 2000-2003, Oct. 2018. (IEEEXplore)
    • M. Qiu, Y.-M. Huang, S.-L. Shieh, and J. Yuan, “A lattice-partition framework of downlink non-orthogonal multiple access without SIC,” IEEE Transactions on Commun., vol. 66, no. 6, pp. 2532-2546, June, 2018. (IEEEXplore)
    • Y.-M. Huang and K. R. Narayanan, “Construction πA and πD lattices: Construction, goodness, and decoding algorithms,” IEEE Transactions on Inf. Theory, vol. 63, no. 9, pp. 5718-5733, Sep. 2017. (arXiv) (IEEEXplore)
    • Y.-M. Huang, “Lattice index codes from algebraic number fields,” IEEE Transactions on Inf. Theory, vol. 63, no. 4, pp. 2098-2112, Apr. 2017. (arXiv) (IEEEXplore)
    • S.-L. Shieh, C.-H. Lin, Y.-M. Huang, and C.-L. Wang, “On Gray labeling for downlink non-orthogonal multiple access without SIC,” IEEE Commun. Lett., vol. 20, no. 9, pp. 1721-1724, Sep. 2016. (IEEEXplore)
    • S.-L. Shieh and Y.-M. Huang, “A simple scheme for realizing the promised gains of downlink non-orthogonal multiple access,” IEEE Transactions on Commun., vol.64, no. 4, pp.1624-1635, Apr. 2016. (IEEEXplore)
    • Y. Wang, K. R. Narayanan, and Y.-M. Huang, “Interleaved concatenations of polar codes with BCH and convolutional codes,” IEEE J. on Sel. Areas in Commun., vol. 34, no. 2, pp. 267-277, Feb. 2016. (IEEEXplore)
    • Y.-M. Huang, K. R. Narayanan, and T. Liu, “Coding for parallel Gaussian bi-directional relay channels: A deterministic approach,” IEEE Transactions on Inf. Theory, vol. 62, no. 1, pp. 260-271, Jan. 2016. (IEEEXplore)
    • Y.-M. Huang, U. Niesen, and P. Gupta, “Energy-efficient communication in the presence of synchronization errors,” IEEE Transactions on Inf. Theory, vol. 61, no. 11, pp. 6131-6144, Nov. 2015. (arXiv) (IEEEXplore)
    • N. E. Tunali, Y.-M. Huang, J. J. Boutros, and K. R. Narayanan, “Lattices over Eisenstein integers for compute-and-forward,” IEEE Transactions on Inf. Theory, vol. 61, no. 10, pp. 5306-5321, Oct. 2015. (arXiv) (IEEEXplore)
    • P.-C. Wang, Y.-M. Huang, and K. R. Narayanan, “Asynchronous physical-layer network coding with quasi-cyclic codes,” IEEE J. on Sel. Areas in Commun., vol. 33, no. 2, Feb. 2015. (arXiv) (IEEEXplore)
    • Y.-M. Huang, N. E. Tunali, and K. R. Narayanan, “A compute-and-forward scheme for Gaussian bi-directional relaY. with inter-symbol interference,” IEEE Transactions on Commun., vol. 61, no. 3, pp. 1011-1019, Mar. 2013. (IEEEXplore)
    • Y.-M. Huang and K. R. Narayanan, “Joint source-channel coding with correlated interference,” IEEE Transactions on Commun., vol. 60, no. 5, pp. 1315-1327, May 2012. (IEEEXplore)
    • C.-L. Wang and Y.-M. Huang, “Intercarrier interference cancellation using general phase rotated conjugate transmission for OFDM systems,” IEEE Transactions on Commun., vol. 58, no. 3, pp. 812-819, Mar. 2010. (IEEEXplore)

  • Conference Papers
    • M. Qiu, Y.-M. Huang, and J. Yuan, “Downlink transmission under heterogeneous blocklength constraints: Discrete signaling with single-user decoding,” IEEE ICC, 2023.
    • P.-W. Su, Y.-M. Huang, S.-C. Lin, I.-H. Wang, and C.-C. Wang, “Sequentially mixing randomly arriving packets improves channel dispersion over block-based designs,” 2022 IEEE International Symposium on Information Theory (ISIT), Espoo, Finland, 2022, pp. 2321-2326.
    • Z.-J. Chen, Eduin E. Hernandez, Y.-M. Huang, and S. Rini, “DNN gradient lossless compression: Can GenNorm be the answer?,”  ICC 2022 - IEEE International Conference on Communications, Seoul, Korea, Republic of, 2022, pp. 407-412. (arXiv) 
    • A. Sonee, S. Rini, and Y.-M. Huang, “Wireless federated learning with limited communication and differential privacy,” 2021 IEEE Global Communications Conference (GLOBECOM), Madrid, Spain, 2021, pp. 01-06. (arXiv)
    • P.-W. Su, Y.-M. Huang, S.-C. Lin, I.-H. Wang, and C.-C. Wang, “Random linear streaming codes in the finite memory length and decoding deadline regime,” 2021 IEEE International Symposium on Information Theory (ISIT), Melbourne, Australia, 2021, pp. 730-735.
    • S.-C. Lin, C.-C. Wang, I.-H. Wang, Y.-M. Huang, and Yi-Chun Lai, “On finite-length analysis and channel dispersion for broadcast packet erasure channels with feedback,” 2021 IEEE International Symposium on Information Theory (ISIT), Melbourne, Australia, 2021, pp. 1871-1876.
    • A.-Y Lin, P.-N. Chen, S.-L. Shieh, and Y.-M. Huang, “Generalized Likelihood-Ratio Enabled Machine Learning for UE Detection over Grant-free SCMA,” GLOBECOM 2020 - 2020 IEEE Global Communications Conference, Taipei, Taiwan, 2020, pp. 1-6.
    • M. Qiu, Y.-M. Huang, and J. Yuan, “On discrete signaling and treating interference as noise for complex Gaussian interference channels,” 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA, 2020, pp. 1546-1551.
    • P.-W. Su, Y.-M. Huang, S.-C. Lin, I.-H. Wang, and C.-C. Wang, “Error rate analysis for random linear streaming codes in the finite memory length regime,” 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA, 2020, pp. 491-496.
    • H. Dau, R. Gabrys, Y.-M. Huang, C. Feng, et al., “Optimizing the transition waste in coded elastic computing,” 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA, 2020, pp. 174-178.
    • Y.-P. Hsu, Y.-M. Huang, and S.-L. Shieh, “Scheduling Stochastic Real-Time Jobs in Unreliable Workers,” 2020 IEEE Wireless Communications and Networking Conference (WCNC), Seoul, Korea (South), 2020, pp. 1-6.
    • Che-Fu Chu, Pin-Jui Wu, and Y.-M. Huang, “An efficient algorithm for fully distributed sequential change detection with bandwidth constraints,” 2019 IEEE Global Communications Conference (GLOBECOM), Waikoloa, HI, USA, 2019, pp. 1-6.
    • M. Qiu, Y.-M. Huang, and J. Yuan, “Multiuser MISO broadcast channel with imperfect CSI: Discrete signaling without SIC,” 2019 IEEE Global Communications Conference (GLOBECOM), Waikoloa, HI, USA, 2019, pp. 1-6.
    • Y.-M. Huang, S.-C. Lin, and Y.-J. Huang, “A tight converse to the asymptotic performance of Byzantine distributed sequential change detection,” 2019 IEEE International Symposium on Information Theory (ISIT), Paris, France, 2019, pp. 2404-2408.
    • Y.-J. Huang, S.-C. Lin, and Y.-M. Huang, “On Byzantine distributed sequential change detection with multiple hypotheses,” 2019 IEEE International Symposium on Information Theory (ISIT), Paris, France, 2019, pp. 2209-2213.
    • M. Qiu, Y.-M. Huang, and J. Yuan, “Downlink NOMA without SIC for fast fading channels: Lattice partitions with algebraic rotations,” ICC 2019 - 2019 IEEE International Conference on Communications (ICC), Shanghai, China, 2019, pp. 1-6.
    • M. Qiu, Y.-M. Huang, J. Yuan, and C.-L. Wang, “Downlink lattice-partition-based non-orthogonal multiple access without SIC for slow fading channels,” in IEEE Transactions on Communications, vol. 67, no. 2, pp. 1166-1181, Feb. 2019.
    • Y.-P. Hsu, J.-S. Ho, Y.-M. Huang, and S.-L. Shieh, "Delay-optimal scheduling for heterogeneous users in NOMA networks," 2018 IEEE 88th Vehicular Technology Conference (VTC-Fall), Chicago, IL, USA, 2018, pp. 1-5.
    • Y.-M. Huang, Y. Hong, E. Viterbo, and L. Natarajan, “Layered space-time index coding,” in IEEE Transactions on Information Theory, vol. 65, no. 1, pp. 142-158, Jan. 2019.
    • M. Qiu, Y.-M. Huang, S.-L. Shieh, and J. Yuan, “A Lattice-Partition Framework of Downlink Non-Orthogonal Multiple Access without SIC,” in IEEE Transactions on Communications, vol. 66, no. 6, pp. 2532-2546, June 2018.
    • H. Wang, Y.-M. Huang, and S.-C. Lin, “Role of feedback in modulo-sum computation over K-user erasure multiple-access channels,” 2017 IEEE Information Theory Workshop (ITW), Kaohsiung, Taiwan, 2017, pp. 344-348.
    • R. Qi, C. Feng, and Y.-M. Huang, “A simpler proof for the existence of capacity-achieving nested lattice codes,” 2017 IEEE Information Theory Workshop (ITW), Kaohsiung, Taiwan, 2017, pp. 564-568.
    • Y.-M. Huang, Y. Hong, and E. Viterbo, “Golden-coded index coding,” 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, 2017, pp. 2548-2552. (arXiv)
    • H. Wang, S.-C. Lin, and Y.-M. Huang, “Role of feedback in modulo-sum computation over erasure multiple-access channels,” 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, 2017, pp. 2293-2297.
    • D. Fang, Y.-M. Huang, Z. Ding, G. Geraci, S.-L. Shieh, and H. Claussen, “Lattice partition multiple access: A new method of downlink non-orthogonal multiuser transmissions,” 2016 IEEE Global Communications Conference (GLOBECOM), Washington, DC, USA, 2016, pp. 1-6. (arXiv)
    • P.-C. Wang, Y.-M. Huang, K. R. Narayanan, and J. J. Boutros, "Physical-layer network-coding over block fading channels with root-LDA lattice codes," 2016 IEEE International Conference on Communications (ICC), Kuala Lumpur, Malaysia, 2016, pp. 1-6.
    • C.-H. Chang, R. Y. Chang, and Y.-M. Huang, "A comparative analysis of secrecy rates of wireless two-way relay systems," 2015 IEEE Global Communications Conference (GLOBECOM), San Diego, CA, USA, 2015, pp. 1-6.
    • Y.-M. Huang, “Lattice index codes from algebraic number fields,” 2015 IEEE International Symposium on Information Theory (ISIT), Hong Kong, China, 2015, pp. 2485-2489.
    • Y.-M. Huang, K. R. Narayanan, and P.-C. Wang, “Adaptive compute-and-forward with lattice codes over algebraic integers,” 2015 IEEE International Symposium on Information Theory (ISIT), Hong Kong, China, 2015, pp. 566-570.
    • S. Li, Y.-M. Huang, T. Liu, and H. D. Pfister, “On the limits of treating interference as noise for two-user symmetric Gaussian interference channel,” 2015 IEEE International Symposium on Information Theory (ISIT), Hong Kong, China, 2015, pp. 1711-1715.
    • Y.-M. Huang and K. R. Narayanan, “On decoding algorithms for Construction πA lattices,” 2015 22nd International Conference on Telecommunications (ICT), Sydney, NSW, Australia, 2015, pp. 260-264. (Invited)
    • J. J. Boutros, Nicola di Pietro, and Y.-M. Huang, “Spectral thinning in GLD lattices,” ITA Workshop, 2015. (Invited) (pdf) (slides made by J.)
    • P.-C. Wang, Y.-M. Huang, and K. R. Narayanan, “Asynchronous compute-and-forward/integer-forcing with quasi-cyclic codes,” 2014 IEEE Global Communications Conference, Austin, TX, USA, 2014, pp. 1504-1509.
    • Y.-M. Huang and K. R. Narayanan, “Lattices from codes for harnessing interference: An overview and generalizations 2014 IEEE Information Theory Workshop (ITW 2014), Hobart, TAS, Australia, 2014, pp. 10-14. (Invited) (arXiv)
    • Y.-M. Huang and K. R. Narayanan, “Multistage compute-and-forward with multilevel lattice codes based on product constructions,” 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, 2014, pp. 2112-2116.
    • A. Vem, Y.-M. Huang, K. R. Narayanan, and H. D. Pfister, “Multilevel lattices based on spatially-coupled LDPC codes with applications,” 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, 2014, pp. 2336-2340.
    • Y.-M. Huang and K. R. Narayanan, “Lattice codes based on product constructions over F2q with applications to compute-and-forward,” 2013 IEEE Information Theory Workshop (ITW), Seville, Spain, 2013, pp. 1-5.
    • Y.-M. Huang, U. Niesen, and P. Gupta, “Energy-efficient communication in the presence of synchronization errors,” IEEE ISIT, 2013.
    • N. E. Tunali, K. R. Narayanan, J. J. Butros, and Y.-M. Huang, “Lattices over Eisenstein integers for compute-and-forward,” 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA, 2012, pp. 33-40.
    • Y.-M. Huang, N. E. Tunali, and K. R. Narayanan, “On the exchange rate for bi-directional relaying over inter-symbol interference channels,” 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, Houston, TX, USA, 2011, pp. 1-5.
    • Y.-M. Huang, K. R. Narayanan, and T. Liu, “Coding for parallel Gaussian bi-directional relay channels: A deterministic approach,” in IEEE Transactions on Information Theory, vol. 62, no. 1, pp. 260-271.
    • Y.-M. Huang and K. R. Narayanan, “Joint source-channel coding with correlated interference,” 2011 IEEE International Symposium on Information Theory Proceedings, St. Petersburg, Russia, 2011, pp. 1136-1140.
    • C.-L. Wang, Yan-Wun Huang, and Y.-M. Huang, “An energy-efficient cooperative SIMO transmission scheme for wireless sensor networks,” 2009 IEEE International Conference on Communications, Dresden, Germany, 2009, pp. 1-5.
    • C.-L. Wang and Y.-M. Huang, “Intercarrier interference cancellation using general phase rotated conjugate transmission for OFDM systems,” 2008 IEEE Wireless Communications and Networking Conference, Las Vegas, NV, USA, 2008, pp. 652-656.
    • C.-L. Wang, Y.-M. Huang, and P.-C. Shen, “An intercarrier interference suppression technique using time-domain windowing for OFDM systems,” 2006 IEEE 63rd Vehicular Technology Conference, Melbourne, VIC, Australia, 2006, pp. 2518-2522.

  • Book Chapters
    Y. Wang, Y.-M. Huang, Alister G. Burr, and K. R. Narayanan,  “Multilevel Lattices for Compute-and-Forward and Lattice Network Coding,” in Number Theory Meets Wireless Communications, Editors: Victor Beresnevich, Alister Burr, Bobak Nazer, and Sanju Velani, Publisher: Springer, 2020.

  • Patents
    • S.-L. Shieh and Y.-M. Huang, “Method and transmitter for non-orthogonal multiple access communication system” US patent #10,630,455, Apr., 2020
    • U. Niesen, P. Gupta, and Y.-M. Huang, “Joint synchronization and modulation scheme for energy-efficient communication,” US patent #‎9,048,935, June, 2015
BACK