scholarly journals Efficient Optimal RCPC Code Rate Allocation With Packet Discarding for Pre-Encoded Compressed Video

2010 ◽  
Vol 17 (5) ◽  
pp. 505-508 ◽  
Author(s):  
Ting-Lan Lin ◽  
P.C. Cosman
Keyword(s):  
Rate Allocation ◽  
Code Rate ◽  
Compressed Video ◽  
Packet Discarding

scholarly journals Optimal Data Transmission and Channel Code Rate Allocation in Multipath Wireless Networks

2011 ◽  
Vol 60 (8) ◽  
pp. 3963-3974 ◽  
Author(s):  
Keivan Ronasi ◽  
Amir-Hamed Mohsenian-Rad ◽  
Vincent W. S. Wong ◽  
Sathish Gopalakrishnan ◽  
Robert Schober
Keyword(s):  
Wireless Networks ◽  
Data Transmission ◽  
Rate Allocation ◽  
Code Rate ◽  
Channel Code

scholarly journals Optimal Data Transmission and Channel Code Rate Allocation in Multi-Path Wireless Networks

2011 ◽  
Author(s):  
Keivan Ronasi ◽  
Amir-Hamed Mohsenian-Rad ◽  
Vincent W. S. Wong ◽  
Sathish Gopalakrishnan ◽  
Robert Schober
Keyword(s):  
Wireless Networks ◽  
Data Transmission ◽  
Rate Allocation ◽  
Code Rate ◽  
Channel Code

scholarly journals On the Performance of Video Resolution, Motion and Dynamism in Transmission Using Near-Capacity Transceiver for Wireless Communication

Entropy ◽  
2021 ◽  
Vol 23 (5) ◽  
pp. 562
Author(s):  
Nasru Minallah ◽  
Khadem Ullah ◽  
Jaroslav Frnda ◽  
Laiq Hasan ◽  
Jan Nedoma
Keyword(s):  
Video Coding ◽  
Video Sequence ◽  
Performance Metrics ◽  
Code Rate ◽  
Space Time ◽  
Transmission Mechanism ◽  
Superior Performance ◽  
Compressed Video ◽  
Error Protection ◽  
High Efficient

This article investigates the performance of various sophisticated channel coding and transmission schemes for achieving reliable transmission of a highly compressed video stream. Novel error protection schemes including Non-Convergent Coding (NCC) scheme, Non-Convergent Coding assisted with Differential Space Time Spreading (DSTS) and Sphere Packing (SP) modulation (NCDSTS-SP) scheme and Convergent Coding assisted with DSTS and SP modulation (CDSTS-SP) are analyzed using Bit Error Ratio (BER) and Peak Signal to Noise Ratio (PSNR) performance metrics. Furthermore, error reduction is achieved using sophisticated transceiver comprising SP modulation technique assisted by Differential Space Time Spreading. The performance of the iterative Soft Bit Source Decoding (SBSD) in combination with channel codes is analyzed using various error protection setups by allocating consistent overall bit-rate budget. Additionally, the iterative behavior of SBSD assisted RSC decoder is analyzed with the aid of Extrinsic Information Transfer (EXIT) Chart in order to analyze the achievable turbo cliff of the iterative decoding process. The subjective and objective video quality performance of the proposed error protection schemes is analyzed while employing H.264 advanced video coding and H.265 high efficient video coding standards, while utilizing diverse video sequences having different resolution, motion and dynamism. It was observed that in the presence of noisy channel the low resolution videos outperforms its high resolution counterparts. Furthermore, it was observed that the performance of video sequence with low motion contents and dynamism outperforms relative to video sequence with high motion contents and dynamism. More specifically, it is observed that while utilizing H.265 video coding standard, the Non-Convergent Coding assisted with DSTS and SP modulation scheme with enhanced transmission mechanism results in Eb/N0 gain of 20 dB with reference to the Non-Convergent Coding and transmission mechanism at the objective PSNR value of 42 dB. It is important to mention that both the schemes have employed identical code rate. Furthermore, the Convergent Coding assisted with DSTS and SP modulation mechanism achieved superior performance with reference to the equivalent rate Non-Convergent Coding assisted with DSTS and SP modulation counterpart mechanism, with a performance gain of 16 dB at the objective PSNR grade of 42 dB. Moreover, it is observed that the maximum achievable PSNR gain through H.265 video coding standard is 45 dB, with a PSNR gain of 3 dB with reference to the identical code rate H.264 coding scheme.

Extension Program Delivery for Greenhouse Growers Using Compressed Video Technology

HortScience ◽  
1998 ◽  
Vol 33 (3) ◽  
pp. 507d-507
Author(s):  
Steven E. Newman ◽  
Karen L. Panter
Keyword(s):  
Best Management Practices ◽  
Management Practices ◽  
Compressed Video ◽  
Educational Programming ◽  
Video Technology ◽  
Best Management ◽  
Personal Interaction ◽  
Session Evaluations ◽  
Greenhouse Growers ◽  
Extension Program

There is a need for educational programming for greenhouse growers on effective uses of biorational pesticides and biological controls of insect and mite pests, diseases, and alternatives to herbicide sprays in confined areas; however, in many states, travel for specialists for programming and workshops is becoming prohibitive. A series of programs outlining Best Management Practices (BMP) for the greenhouse industry outlining techniques and practices reducing pesticide use were conducted at multiple sites in Colorado simultaneously using interactive compressed video technology. This conferencing technology is gaining wide acceptance in many venues and provides an opportunity for wider participation of clientele without travel. Participants in the programs reported in post-session evaluations that they did miss the personal interaction with the speakers, but did acknowledge that not having to drive 5 hours to attend a seminar was quite beneficial.

scholarly journals Source Symbol Purging-Based Distributed Conditional Arithmetic Coding

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 983
Author(s):  
Jingjian Li ◽  
Wei Wang ◽  
Hong Mo ◽  
Mengting Zhao ◽  
Jianhua Chen
Keyword(s):  
Posterior Probability ◽  
Side Information ◽  
Code Rate ◽  
Arithmetic Coding ◽  
Distributed Arithmetic ◽  
Context Model ◽  
Error Performance ◽  
Codeword Length ◽  
Simulation Results ◽  
Correlation Strength

A distributed arithmetic coding algorithm based on source symbol purging and using the context model is proposed to solve the asymmetric Slepian–Wolf problem. The proposed scheme is to make better use of both the correlation between adjacent symbols in the source sequence and the correlation between the corresponding symbols of the source and the side information sequences to improve the coding performance of the source. Since the encoder purges a part of symbols from the source sequence, a shorter codeword length can be obtained. Those purged symbols are still used as the context of the subsequent symbols to be encoded. An improved calculation method for the posterior probability is also proposed based on the purging feature, such that the decoder can utilize the correlation within the source sequence to improve the decoding performance. In addition, this scheme achieves better error performance at the decoder by adding a forbidden symbol in the encoding process. The simulation results show that the encoding complexity and the minimum code rate required for lossless decoding are lower than that of the traditional distributed arithmetic coding. When the internal correlation strength of the source is strong, compared with other DSC schemes, the proposed scheme exhibits a better decoding performance under the same code rate.

Sign in / Sign up

Export Citation Format

Share Document