Dr Jing Cai PhD
Research Student
Brief biographical information
A Study of Erasure Correcting Codes
This work focus on erasure codes, particularly those that of high performance, and the related decoding algorithms, especially with low computational complexity. The work is composed of different pieces, but the main components are developed within the following two main themes.
Dr Jing Cai
Ideas of message passing are applied to solve the erasures after the transmission. Efficient matrix-representation of the belief propagation (BP) decoding algorithm on the BEC is introduced as the recovery algorithm. Gallager's bit-flipping algorithm are further developed into the guess and multi-guess algorithms especially for the application to recover the unsolved erasures after the recovery algorithm.
A novel maximum-likelihood decoding algorithm, the In-place algorithm, is proposed with a reduced computational complexity. A further study on the marginal number of correctable erasures by the In-place algorithm determines a lower bound of the average number of correctable erasures. Following the spirit in search of the most likable codeword based on the received vector, we propose a new branch-evaluation-search-on-the-code-tree (BESCT) algorithm, which is powerful enough to approach the ML performance for all linear block codes.
To maximize the recovery capability of the In-place algorithm in network transmissions, we propose the product packetisation structure to reconcile the computational complexity of the In-place algorithm. Combined with the proposed product packetisation structure, the computational complexity is less than the quadratic complexity bound. We then extend this to application of the Rayleigh fading channel to solve the errors and erasures. By concatenating an outer code, such as BCH codes, the product-packetised RS codes have the performance of the hard-decision In-place algorithm significantly better than that of the soft-decision iterative algorithms on optimally designed LDPC codes.
Director of studies: Prof. Martin Tomlinson
Other supervisors: Dr Marcel Ambroze, Dr Mohammed Zaki Ahmed
Journal papers
Analysis of the distribution of the number of erasures correctable by a binary linear code and the link to low-weight codewords |
1 Journal papers
Conference papers
Extended optimum decoding for LDPC codes based on exhaustive tree search algorithm | |
A tree-based ML decoding algorithm with adaptive thresholding | |
Advances in Iterative Decoding and Maximum Likelihood Decoding for the Packet Network with Comparisons to Fountain Codes over the Erasure Channel | |
Comparison of Concatenated Reed-Solomon Coding with Hard-decision to Soft-decision LDPC Coding for the Rayleigh Fading Channel | |
Analysis on Decoding Algorithms Based on Sectionalised Trellises of Block Codes and Their Dual | |
Erasure correcting codes, network congestion, multicast and broadcast |
6 Conference papers
Patents granted
A system for the correction of missing or deleted symbols |
1 Patents granted
Patents filed
Detection System and Method for Railway Track Circuits Using BPSK Modulated Coding |
1 Patents filed
Presentations
Developing a new Train Detection system - Can Industry and Academia work together? |
1 Presentations
10 publication(s) - all categories.