scholarly journals Effect of a Binary Symmetric Channel on the Synchronisation Recovery of Variable Length Codes

1989 ◽  
Vol 32 (3) ◽  
pp. 246-251 ◽  
Author(s):  
M. Rahman
Keyword(s):  
Variable Length ◽  
Binary Symmetric Channel ◽  
Symmetric Channel ◽  
Variable Length Codes

scholarly journals 4 Maximum Likelihood Decoder for Variable Length Codes

2012 ◽  
Vol 1 (1) ◽  
pp. 5
Author(s):  
Syed Misbahuddin ◽  
Mohammed Talal Simsim
Keyword(s):  
Error Propagation ◽  
Hardware Implementation ◽  
Variable Length ◽  
Digital Information ◽  
Description Language ◽  
Probability Of Occurrence ◽  
Symmetric Channel ◽  
Short Period ◽  
Hardware Description ◽  
Variable Length Codes

Variable Length Codes (VLC) are used to transfer same amount of digital information in relatively short period of time. In variable length coding, the characters with higher probability of occurrence are assigned shorter bits sequence and the characters with less probability of occurrence are assigned relatively longer bits sequence. However, due to variable length nature of codes, the decoding circuitry at the receiving end loses the synchronization due to single or multiple bit inversions. This typically happens when data is transmitted through a Binary Symmetric Channel (BSC). This paper investigates synchronizing scheme to control the error propagation due to single or multiple bit inversions through BSC. The hardware implementation of the proposed algorithm has been presented using a hardware description language. The functional level simulation of the implementation is discussed to test the proposed algorithm.

scholarly journals 4 Maximum Likelihood Decoder for Variable Length Codes

2012 ◽  
Vol 2 (1) ◽  
pp. 5
Author(s):  
Syed Misbahuddin ◽  
Mohammed Talal Simsim
Keyword(s):  
Error Propagation ◽  
Hardware Implementation ◽  
Variable Length ◽  
Digital Information ◽  
Description Language ◽  
Probability Of Occurrence ◽  
Symmetric Channel ◽  
Short Period ◽  
Hardware Description ◽  
Variable Length Codes

Variable Length Codes (VLC) are used to transfer same amount of digital information in relatively short period of time. In variable length coding, the characters with higher probability of occurrence are assigned shorter bits sequence and the characters with less probability of occurrence are assigned relatively longer bits sequence. However, due to variable length nature of codes, the decoding circuitry at the receiving end loses the synchronization due to single or multiple bit inversions. This typically happens when data is transmitted through a Binary Symmetric Channel (BSC). This paper investigates synchronizing scheme to control the error propagation due to single or multiple bit inversions through BSC. The hardware implementation of the proposed algorithm has been presented using a hardware description language. The functional level simulation of the implementation is discussed to test the proposed algorithm.

Soft-input soft-output decoding of variable length codes

2002 ◽  
Vol 50 (5) ◽  
pp. 689-692 ◽  
Author(s):  
Jiangtao Wen ◽  
J. Villasenor
Keyword(s):  
Variable Length ◽  
Variable Length Codes

scholarly journals Digital Link—A

2021 ◽  
pp. 115-142
Author(s):  
Jean Walrand
Keyword(s):  
Decision Making ◽  
Decision Problem ◽  
False Negative ◽  
Main Tool ◽  
Maximum Likelihood Estimates ◽  
Modulation Scheme ◽  
Bayes Rule ◽  
Binary Symmetric Channel ◽  
Symmetric Channel ◽  
Complex Modulation

AbstractIn a digital link, a transmitter converts bits into signals and a receiver converts the signals it receives into bits. The receiver faces a decision problem that we study in Sect. 7.1. The main tool is Bayes’ Rule. The key notions are maximum a posteriori and maximum likelihood estimates. Transmission systems use codes to reduce the number of bits they need to transmit. Section 7.2 explains the Huffman codes that minimize the expected number of bits needed to transmit symbols; the idea is to use fewer bits for more likely symbols. Section 7.3 explores a commonly used model of a communication channel: the binary symmetric channel. It explains how to calculate the probability of errors. Section 7.4 studies a more complex modulation scheme employed by most smartphones and computers: QAM. Section 7.5 is devoted to a central problem in decision making: how to infer which situation is in force from observations. Does a test reveal the presence of a disease; how to balance the probability of false positive and that of false negative? The main result of that section is the Neyman–Pearson Theorem that the section illustrates with many examples.

scholarly journals Transmission of Hidden Cipher Text over a Binary Symmetric Channel

2012 ◽  
Vol 53 (15) ◽  
pp. 40-43
Author(s):  
Arun Rana ◽  
Nitin Sharma ◽  
Parveen Malik
Keyword(s):  
Binary Symmetric Channel ◽  
Cipher Text ◽  
Symmetric Channel

An efficient algorithm for testing immutability of variable-length codes

1989 ◽  
Vol 35 (6) ◽  
pp. 1310-1314 ◽  
Author(s):  
R.M. Capocelli ◽  
L. Gargano ◽  
U. Vaccaro
Keyword(s):  
Efficient Algorithm ◽  
Variable Length ◽  
Variable Length Codes
Sign in / Sign up

Export Citation Format

Share Document