Parity Bit Calculator — Even & Odd Parity
Enter any binary word and choose even or odd parity to find the parity bit that makes your data word valid. The calculator counts the 1s in your data, determines the required parity bit and shows you the complete transmitted word.
Binary data
Enter 0s and 1s only
Parity type
Append this bit to make the word satisfy the chosen parity rule
- 1
Count of 1s in data
4Total number of 1 bits in the input word. - 2
Even parity bit
4 mod 2 = 0
Come funziona questo calcolatore?
Count the 1s in your binary data word. For even parity, the parity bit = (count of 1s) mod 2 — it is 1 if you need an extra 1 to make the total even, else 0. Append the parity bit to form the transmitted word. Odd parity is simply the complement.
Formula
How this is calculated
A parity bit is a single extra bit added to a binary data word to enable simple single-bit error detection. For even parity, the parity bit is chosen so that the total number of 1s in the word (data bits + parity bit) is even. For odd parity, the total is made odd. If a single bit flips during transmission, the parity of the received word will be wrong, and the receiver knows an error occurred — though it cannot say which bit flipped.
To compute even parity: count the 1s in the data word. If the count is already even, the parity bit is 0; if odd, the parity bit is 1 (it "fixes" the parity). Odd parity is the inverse. The parity bit is typically appended to the most-significant or least-significant end of the word — convention varies by protocol.
Parity checking detects only single-bit (or any odd number of) errors. It cannot detect two bits flipping simultaneously, because the parity balance is restored. For stronger protection, schemes like CRC (Cyclic Redundancy Check) or Hamming codes are used. The optional bit-width padding field lets you pre-pad the input with leading zeros to match a fixed-width register before computing parity.
Domande frequenti
With even parity the total count of 1s in the full word (data + parity bit) is always even; with odd parity it is always odd. Either convention works equally well — what matters is that sender and receiver agree on which one to use.
No. A single parity bit detects any single-bit error (or any odd number of bit flips), but if two bits flip simultaneously the parity appears correct and the error goes undetected. For more reliable detection, use CRC checksums, Hamming codes, or Reed-Solomon codes.
Parity bits appear in serial communication protocols (UART, RS-232), older RAM chips (ECC is the modern successor), PS/2 keyboards and many legacy storage interfaces. Modern systems rely on more robust error-correcting codes, but parity remains a foundational concept in data communication.
Conosciuto anche come
TG we-Calculate Editorial Team. (2026). Parity Bit Calculator — Even & Odd Parity [Online calculator]. TG we-Calculate. https://we-calculate.com/it/calculator/parity-calculator
TG we-Calculate Editorial Team. "Parity Bit Calculator — Even & Odd Parity." TG we-Calculate. 2026. https://we-calculate.com/it/calculator/parity-calculator.
TG we-Calculate Editorial Team, "Parity Bit Calculator — Even & Odd Parity," TG we-Calculate, 2026. [Online]. Available: https://we-calculate.com/it/calculator/parity-calculator
@misc{wecalculate_parity_calculator, title = {Parity Bit Calculator — Even & Odd Parity}, author = {{TG we-Calculate Editorial Team}}, howpublished = {\url{https://we-calculate.com/it/calculator/parity-calculator}}, year = {2026}, note = {TG we-Calculate} }
Questo calcolatore ti è stato utile?