부산대학교 도서관

Though various coding systems exist in the communication field, there ought to be a system or software where we can easily define elements of the nodes of the Tanner graph and the connection between these nodes as per the requirements of the user. Though this project does not extend any theory of coding, it gives real value to the research community using which they can test any idea of coding quickly. This work uses a Python Graphical user interface (GUI) to design a simulator. It accepts the parity-check matrix of any error-correcting code, generates codewords, and transmits it through an optical or additive white Gaussian noise (AWGN) channel (based on the user’s channel selection). In our work, a Tanner graph-based decoder is implemented, which consists of a set of bit-nodes and check-nodes where iterative decoding is performed. The simulator is equipped with repetition codes (RC), single parity-check (SPC), Reed-muller (RM), and Repeat-accumulate (RA) based decoding techniques. Users can select the type of decoding technique (either one or two) for each set of bit-nodes and check-nodes. Perform the decoding operation on the received codeword and get the analysis result from the bit error rate (BER) curve and BER vs. signal-to-noise ratio (SNR) table.