A Scalable and Accurate Chessboard-based AMC Algorithm with Low Computing Demands Data & Code

Citation Author(s):
Yuqin
Zhao
The University of Sheffield
Bill
Gavin
The University of Sheffield
Tiantai
Deng
The University of Sheffield
Edward
Ball
The University of Sheffield
Luke
Seed
The University of Sheffield
Submitted by:
Tiantai Deng
Last updated:
Mon, 07/08/2024 - 15:58
DOI:
10.21227/6rk7-4m23
Data Format:
License:
0
0 ratings - Please login to submit your rating.

Abstract 

Automatic Modulation Classification (AMC) is a technique used to identify signal modulations in applications like cognitive radar, software-defined radio, and electronic warfare. With future communication systems like 6G operating at higher transmission frequencies than 5G, AMC algorithms need to be more complex yet suitable for embedded devices with limited resources. Although current AMC algorithms deliver high accuracy, they require substantial computing power, making them unsuitable for such devices. This paper introduces the novel Chessboard-based Automatic Modulation Classification (CAMC) algorithm, which is scalable and demands less computing power. Test results reveal that CAMC achieves 86% accuracy under a 3dB SNR condition and 100% above 5dB SNR. It offers comparable performance to state-of-the-art AMC algorithms, classifying mainstream modulations like BPSK, QPSK, 8PSK, and 16QAM, but requires less computing power than existing algorithms. Additionally, CAMC is hardware-friendly due to its inherent parallelism and scalability. 

Instructions: 

This zip file contains code and test result to the paper: A Scalable and Accurate Chessboard-based AMC Algorithm with Low Computing Demands. The code is in Matlab. The information can be also found in the following github link: https://github.com/RainChinChao/ChessboardAMC