User Tools

Site Tools


tanszek:oktatas:techcomm:syntax

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
tanszek:oktatas:techcomm:syntax [2024/10/08 06:01] – kneheztanszek:oktatas:techcomm:syntax [2026/10/19 17:51] (current) – knehez
Line 10: Line 10:
  
 Explains various methods for encoding integers, focusing on binary representation and how to handle both positive and negative numbers using sign-magnitude and two's complement methods. It includes practical examples, such as converting between decimal and binary systems and performing arithmetic with binary numbers. Explains various methods for encoding integers, focusing on binary representation and how to handle both positive and negative numbers using sign-magnitude and two's complement methods. It includes practical examples, such as converting between decimal and binary systems and performing arithmetic with binary numbers.
- 
-[[BCD encoding]] 
- 
-Representing each decimal digit (0-9) with a 4-bit binary sequence, BCD simplifies conversion between binary and decimal 
- 
-[[Fixed-Point Number Representation]] 
- 
-A method for encoding real numbers where the decimal point's position is fixed, offering hardware simplicity and uniform precision. 
  
 [[Floating-Point representation]] [[Floating-Point representation]]
  
 Explains how real numbers are stored using the IEEE 754 standard. The number is divided into sign, exponent, and mantissa for efficient handling of large or small values. Explains how real numbers are stored using the IEEE 754 standard. The number is divided into sign, exponent, and mantissa for efficient handling of large or small values.
 +
 +[[BCD encoding]]
 +
 +Representing each decimal digit (0-9) with a 4-bit binary sequence, BCD simplifies conversion between binary and decimal
  
 [[Parity Check]] [[Parity Check]]
Line 30: Line 26:
  
 Techniques like Elias-style block protection and Hamming codes are explained, focusing on detecting and correcting single-bit errors to maintain data integrity during transmission Techniques like Elias-style block protection and Hamming codes are explained, focusing on detecting and correcting single-bit errors to maintain data integrity during transmission
 +
 +[[Checksum]]
 +
 +A checksum is a small value calculated from a sequence of data. It helps us detect accidental changes during storage or transmission.
 +
 +[[Luhn algortithm to protect Credit card numbers|Luhn algorithm to protect Credit card numbers]]
 +
 +We can use the Luhn algorithm to check if a credit card number is valid. 
tanszek/oktatas/techcomm/syntax.1728367269.txt.gz · Last modified: by knehez