[P13] 'U-UV Structural Codes for New Generation Communication Networks' (面向新一代通信网络的编码：U-UV码), funded by the National Natural Science Foundation
of China (NSFC), project ID: 62471503, 2025.1 -- 2028.12, Role: principle investigator (PI). [Summary]
The next generation communication networks will present the technical visions of connecting intelligences and universal coverage. They will support the new communication scenarios including extended reality and integrated sensing and communications. These new scenarios require not only ultra-reliable low-latency information transmission, but also low power consumption and with a more personalized manner. They bring brand new challenges for channel coding techniques. Designing short-to-medium length (SML) channel codes with a good error-correction capability and an elastic feature becomes the key for solving the challenges. This project proposes the research of U-UV structural codes. The U-UV codes are constructed through coupling several algebraic components codes in a superposition-and-concatenation manner. This construction can be extended recursively, resulting in a new type of channel codes that not only have a strong error-correction capability but also being flexible in adjusting their length and dimension. The U-UV codes are good performing SML codes. Their design integrates the capacity polarization theory and the classical coding theory. In a U-UV code, the algebraic component codes are transmitted over the polarized subchannels, overcoming the incomplete capacity polarization that arises for the SML polar codes. In addition, their codeword length and dimension can be adjusted by changing the number of construction levels, supporting the vision of personalized information transmission. This project will conduct the comprehensive research on U-UV codes, including the construction and systematic design of binary and non-binary U-UV codes, their low-complexity low-latency successive cancellation list (SCL) decoding, as well as their decoding performance analysis and evaluation. This project is hopeful in delivering the key channel coding techniques for the next generation communication networks.
[P12] 'A Novel Channel Coding Technique Towards 6G Communications' (面向6G网络的新型编码技术), funded by the Guangdong National Science Foundation (GDNSF), project ID: 2024A1515010213, 2024.1 -- 2026.12, Role: principle investigator (PI).
[P11] 'Efficient Algebraic Decoding of Elliptic Codes and Its Applications' (椭圆码的高效代数译码与应用), funded by the National Natural Science Foundation
of China (NSFC), project ID: 62071498, 2021.1 -- 2024.12, Role: principle investigator (PI). [Summary]
Reed-Solomon (RS) codes have been widely used in data communication and storage systems. However, their codeword length cannot exceed the size of finite field, limiting their error-correction (EC) capability. This project investigates a new coding scheme -- elliptic codes, which have the potential of replacing RS codes in future. Comparing with RS codes defined over the same finite field, elliptic codes have larger codeword length resulting in a stronger EC capability. They can reach the optimal tradeoff between the EC capability, efficiency and complexity. Elliptic codes can also be utilized for structured coding in forging competent short-to-medium length codes. This will be the essential technique for realizing the progression from ‘ultra-reliable’ to ‘ultra low latency’ for the next generation wireless communication networks. This project will investigate the design of elliptic codes, its algebraic decoding and applications. The code’s algebraic properties, including its minimum Hamming distance and weight spectrum, will be characterized. Its advanced algebraic decoding approaches that are empowered by module minimization interpolation, progressive interpolation and re-encoding transform will be proposed. It will also be utilized for structured coding, spinning new coding techniques for wireless communication, deep space communication, optical fiber communication and data storage systems. Since elliptic curves have been widely used for data encryption, this research enables a common algebraic foundation for both data encryption and coded transmission, facilitating the structural integration of future communication systems.
[P10] 'Coding Technology for Satellite Communications' (对卫星通信编译码技术的研究), funded by Shenzhen Municipal Commission of Science and Innovation, 2019.1 -- 2021. 12. Role: Principle Investigator (PI).
[P9] 'New algebraic soft decoding for RS and AG codes' (对RS和AG码新型软判决代数译码的研究), funded by the National Natural Science Foundation
of China (NSFC), project ID: 61671486, 2017.1 -- 2020.12, Role: principle investigator (PI). [Summary]
The algebraic decoding for Reed-Solomon (RS) and algebraic-geometric (AG) codes can correct errors beyond half of the code’s minimum Hamming distance. Hence, it has attracted many research interests. However, its high decoding complexity prevents a sooner implementation in industry. This is mainly caused by the interpolation process. Addressing this challenge, this project investigates a new interpolation approach, the module minimisation (MM). Based on MM, we will propose two low-complexity algebraic soft decoding algorithms, the algebraic Chase decoding (ACD) and the Koetter-Vardy (KV) decoding, namely the ACD-MM and the KV-MM algorithms. Re-encoding transform and progressive interpolation techniques will be further deployed to facilitate the ACD-MM and the KV-MM algorithms. The former reduces the MM interpolation complexity and the latter enables the decoding computation adapt to the quality of the received information. Moreover, this project also investigates powerful short-to-medium length codes to realise the modern communication vision of 'high transmission reliability and low energy consumption'. Utilising RS or AG codes, we can construct different structured codes that benefit a stronger decoding. This research may inspire an earlier industralisation of the algebraic decoding for RS and AG codes.
[P8] 'Spectrum and energy efficient multi-user
cooperative communications' (高谱效高能效多用户协作通信技术的研究), funded by the National Natural Science Foundation
of China (NSFC), project ID: 61372079, 2014.1 -- 2017.12, Role: principle investigator (PI). [Summary]
Modern wireless communication networks provide pervasive information services. Cooperative communication that motivates network users to collaborate for signal transmission is a crucial technology to realize reliable and efficient communications. It is a flexible communication mechanism, creating multi-path signal transmission and hence introducing diversity gains for the communication system. It also enables the network resources to be better utilized and improves the network coverage. Therefore, it plays an important role in many areas, including commercial and military communications and disaster managements. However, multi-user cooperative communication is at the expenses of spectral efficiency, energy consumption and information routing. Aiming to solve those challenges, this project investigates the spectrum and energy efficient communication technologies for multi-user cooperative networks. This project proposes the message partitioning based cooperative communications (MPBCC) and the nonorthogonal opportunistic cooperative communications (NOCC) schemes, both of which achieve a high spectrum efficiency and alleviate the energy consumption. Information theoretic performance of the two communication schemes will be analyzed as well as their spectrum and energy efficiencies. Design of channel codes for the cooperative channels will be proposed. In order to provide reliable communications, yet maintaining high throughput and spectral efficiency, this project will also investigate the design of network-channel-coded modulation (NCCM) scheme that integrates the network coding, channel coding and coded modulation as a single entity. Its applications for multi-user cooperative networks will be further explored. This research project can provide the key technologies for realizing spectrum and energy efficient signal transmission in the next generation wireless communication networks.
[P7] 'Research on optimal decoding approaches
for linear block codes' (对线性分组码译码算法的研究), funded by the Guangzhou Municipal Bureau of Science and
Information, 2013.1 -- 2014.12, Role: PI.
[P6] 'Research on high speed mobile wideband
communication networks' (高移动性宽带无线通信网络重点基础理论研究), National 973 project, funded by the Ministry of Science
and Technology (MOST) of China, 2012.1 -- 2016.12, Role: co-investigator (CI). Project collaborators: Southwest Jiaotong Univ.,
Tsinghua Univ., Shanghai Jiaotong Univ., Zhejiang Univ. and Xidian Univ..
[P5] 'Advanced coding technology for
future storage devices' (对未来存储系统编码译码技术的研究), funded by National Natural Science Foundation of China (NSFC),
project ID: 61001094, 2011.1 -- 2013.12, Role: PI.
[Summary]
Future storage devices require high storage capacity and high data transfer rate, resulting them being more sensitive to data errors introduced by surface scratches and system noise. Therefore, stronger error-correction codes will be necessary to maintain a good system performance. The currently used Reed-Solomon (RS) code and its decoding algorithm fail to meet such a demand. Addressing this issue, this project proposes the the noval algebraic-geometric (AG) code and its complexity reducing list decoding algorithm to replace the currently used system. The construciton of AG code based on different algebraic curves will be investigated, requiring the knowledge of the pole basis and affine points of the curve. The suitable AG code will then be constructed for future storage devices, providing both high error-correction capacity and efficiency. Although the list decoding system can offer a stronger error-correction capability, it is more complex to implement. This project proposes an adaptable list decoding system which can adjust its decoding capacity as well as complexity according to the quality of received word. The outcome of this project provides an insight into the advantage and feasibility of implementing AG code and list decoding system for future storage devices.
[P4] 'Research on the adaptable list decoding
system' (自适应列表译码系统的研究), funded by Guangdong National Science Foundation (GDNSF),
project ID:
10451027501005078, 2010.10 -- 2012.10, Role: PI.
[P3] 'Research and application of algebraic-geometric
codes' (代数几何码的研究与应用), funded by Young Academics Funding of Sun Yat-sen University, project
ID:
101gpy29, 2010.10 -- 2013.10, Role: PI.
[P2] 'Bai Ren Program (百人计划)',
a special scheme issued by Sun Yat-sen University for outstanding academics, 2010.2 -- 2012.2.
[P1] 'Node cooperation for fixed wireless access' (),
funded by UK Engineering and
Physical Science Research Council (EPSRC), Research partner: University of Cambridge, project ID: EP/E012108/1, 2007.3 -- 2010.2, Role: Research Associate (RA).