Discover published sets by community

Hamming Code is an FEC technique that uses check bits placed at certain positions to identify and correct single-bit errors. Example: With 4 data bits and 3 Hamming bits, an error in one can be detected and corrected.

SNR measures the level of signal power compared to the level of noise power, expressed in decibels (dB). Example: An SNR of 20 dB indicates the signal power is 100 times greater than the noise power.

CRC is a type of hash function used to detect accidental changes to raw data. Data is divided by a predetermined polynomial leaving a remainder which is the 'CRC'. Example: The CRC of a data string might be sent alongside it and checked by the receiver.

The Nyquist Rate is the minimum rate at which a signal can be sampled without introducing errors, twice the highest frequency of the signal. Example: For a signal with a 20 kHz frequency, the Nyquist Rate would be 40 kHz.

A parity check adds a single bit to data to make the number of 1s either always odd (odd parity) or always even (even parity). Example: In even parity, if the data is '1010', a '0' is added, making it '10100'.

Block codes encode data in blocks, adding redundant bits to facilitate error detection and correction. Example: A (7,4) block code takes 4 bits of data and adds 3 redundancy bits, creating a 7-bit block.

Convolutional codes are FEC techniques that apply a series of convolutional operations to the input bits to generate redundant bits. Example: A convolutional encoder might take a sequence of input bits and apply different shift-register taps to produce coded output.

Interleaving is a technique to rearrange the data sequence to reduce the impact of burst errors on data transmission. Example: Data is arranged in a matrix and then read column-wise to spread out errors.

BER is the percentage of bits that have errors relative to the total number of bits received in a transmission, usually expressed as ten to a negative power. Example: If 1 out of 1000 bits is erroneous, BER would be $1 imes 10^{-3}$.

The checksum is a simple method for error detection that adds up the binary values in a block of data and stores the sum. Example: The sum of a data block is sent along with the data and compared at the destination to the recalculated sum.

Burst error refers to a contiguous sequence of bits received in error due to a temporary malfunction in the transmission channel. Example: A noise spike corrupting several bits in a row would constitute a burst error.

CIRC is an error correction technique combining Reed-Solomon coding with interleaving, used in CDs. Example: The technique scatters error over a wide area, which allows for easier correction by the Reed-Solomon algorithm.

Echo cancellation is the process of eliminating echo from voice communications to improve clarity. Example: In a teleconferencing system, echo cancellation algorithms remove reflected sounds picked up by the microphone.

FEC is a technique where the sender adds redundant data to the messages, allowing the receiver to detect and correct errors. Example: If a code adds 2 bits redundancy for every 4 bits of data, it can correct a 1-bit error in those 4 bits.