bandwidth requirement
Recently Published Documents


TOTAL DOCUMENTS

79
(FIVE YEARS 13)

H-INDEX

8
(FIVE YEARS 1)

Author(s):  
Imjae Hwang ◽  
Juwon Yun ◽  
Woonam Chung ◽  
Jaeshin Lee ◽  
Cheong-Ghil Kim ◽  
...  

In a computing environment, higher resolutions generally require more memory bandwidth, which inevitably leads to the consumption more power. This may become critical for the overall performance of mobile devices and graphic processor units with increased amounts of memory access and memory bandwidth. This paper proposes a lossless compression algorithm with a multiple differential pulse-code modulation variable sign code Golomb-Rice to reduce the memory bandwidth requirement. The efficiency of the proposed multiple differential pulse-code modulation is enhanced by selecting the optimal differential pulse code modulation mode. The experimental results show compression ratio of 1.99 for high-efficiency video coding image sequences and that the proposed lossless compression hardware can reduce the bus bandwidth requirement.


Telecom ◽  
2021 ◽  
Vol 2 (1) ◽  
pp. 28-41
Author(s):  
Ioannis D. Moscholios

In this paper, a link of fixed capacity is considered that services calls from different service-classes. Calls arrive in the link according to a Poisson process, have an initial (peak) bandwidth requirement while their service time is exponentially distributed. We model this system as a multirate loss system and analyze two different multirate loss models. In the first model, named probabilistic retry loss model, if there is no available link bandwidth, a new call is blocked but retries with a lower bandwidth requirement and increased service time. To allow for the fact that a blocked call may be impatient, we assume that it retries with a probability. In the second model, named probabilistic threshold loss model, a call may reduce its bandwidth requirement (before blocking occurs) based on the occupied link bandwidth. To determine call blocking probabilities in both multirate loss models, we show that approximate but recursive formulas do exist that provide quite satisfactory results compared to simulation.


2020 ◽  
Vol 9 (5) ◽  
pp. 2206-2212
Author(s):  
Ali Khalid Jassim ◽  
Malik Jasim Farhan ◽  
Alaa Fadhil Fahad

Design and simulation of antenna with performance operating at bandwidth (4.5-6.5) GHz, with center frequency 5.5 GHz. This antenna constriction from two cylindrical antenna shapes and four cylindrical resonators with include iris to matching impedance, to enhancement sharp edge band and four tuned between coupling sidewall to removed distortions. Improving the frequency selection of the bandwidth requirement antenna is by adjusting the cylinder length of the antenna The proposed antenna is operating ideal filter because the edge of the band rejection is matched the edge of the bandwidth requirement which makes it perform well including broad edges for the band rejection and sharp edges of the bandwidth requirement together with a little insertion between two types and good return loss of the bandwidth requirement. CST software used to investigate and simulated results.


Visual Cryptography algorithm primarily ensures lossless recovery of the secret image, by breaking the secret message into multiple shares before sending through a channel, which increases the bandwidth requirement of the channel due to increase in the size. The proposed algorithm deals with this problem by using two exclusive locks on the image to be shared which are applied once on the sender side and once on the receiver side. Thereafter sender and receiver open’s their individual locks to finally retrieve the secret image at the receiver end.


Sign in / Sign up

Export Citation Format

Share Document