NeoFlock/neonucleus
2
0
Fork 0
mirror of https://github.com/NeoFlock/neonucleus.git synced 2025-09-24 09:03:32 +02:00
Code Issues Packages Projects Releases Wiki Activity

small tweak

Browse Source
This commit is contained in:
IonutParau 2025-07-14 18:12:35 +02:00
parent 62a142df6d
commit 7a43ed0727
1 changed files with 3 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
specs/data.md
View File

@ -11,7 +11,7 @@ This also means when decoding, the length must be even.
A byte is split into 2 nibbles, with the one comprised of the lowest bits first. A byte is split into 2 nibbles, with the one comprised of the lowest bits first.
Each nibble is ECC encoded separately. Each nibble is ECC encoded separately.
In a nibble there are 4 bits d0, d1, d2 and d3, where dN refers to the bit with value 2^N (2 to the N). In a nibble there are 4 bits d0, d1, d2 and d3, from lowest to highest.
In the output, there are p0, p1, p2, p3 bits, where p1 and above represent hamming code parity data, and p0 is a parity check on the whole block. In the output, there are p0, p1, p2, p3 bits, where p1 and above represent hamming code parity data, and p0 is a parity check on the whole block.
### Nibble arrangement ### Nibble arrangement
@ -27,4 +27,6 @@ In the output, there are p0, p1, p2, p3 bits, where p1 and above represent hammi
| p3 | d1 | d2 | d3 | | p3 | d1 | d2 | d3 |
``` ```
The bits are arranged such that p0 is the lowest bit and d3 is the highest.
This creates a fairly generic hamming code structure. Do note that p0 is the bit for checking the whole block's parity. This creates a fairly generic hamming code structure. Do note that p0 is the bit for checking the whole block's parity.