Error Detection and Correction On-Board Nanosatellites Using Hamming Codes

Abstract

The field of nanosatellites is constantly evolving and growing at a very fast speed. This creates a growing demand for more advanced and reliable EDAC systems that are capable of protecting all memory aspects of satellites. The Hamming code was identified as a suitable EDAC scheme for the prevention of single event effects on-board a nanosatellite in LEO. In this paper, three variations of Hamming codes are tested both in Matlab and VHDL. The most effective version was Hamming [16, 11, 4]2. This code guarantees single-error correction and double-error detection. All developed Hamming codes are suited for FPGA implementation, for which they are tested thoroughly using simulation software and optimized.

An Analytical Approach of Error Detection and Correction for On-board Nano Satellite

“…[2] proposed a parity check matrix and a calculated syndrome of error detection and correction on board nano satellites. The scheme can self-detect and self-correct any single event effects error that occurs during transmission [2]. Cryptographic protection is used to secure transmissions from being hacked.…”

“…From Earth's surface, EO Satellites applies high resolution image sensors to watch and get data on the earth's surface and utilizes infrared for underneath observation. By watching earth from space EO satellites give fundamental data on climate observing, urban checking, natural disaster, rural development checking, and natural checking etc [2]. Error detection and correction devices nanosatellites aim to perform secured and error-less information transmission between satellite and ground station.…”

The Impact of Hamming Code and Cyclic Code on MPSK and MQAM Systems over AWGN Channel: Performance Analysis

“…Generator matrix G is used when encoding the information data to form the codeword. G(k × n) is defined as the combination of an identity matrix I of size k × k and a parity-matrix P of size k × n [15], [21] G…”

“…For any linear code we can find an matrix H, which is called the parity check matrix and its rows are linearly independent [15], [21]. In systematic form, the columns of H are arranged in the following form:…”

“…For a positive integer m ≥ 3, there exists a Hamming code with the following parameters [3], [14] Figure 5 presents Venn diagrams for the relationship between the parity check bits and the data bits in Hamming codes. The diagram describes which data bits are protected by each parity bit [21].…”