The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
As high-throughput sequencing technologies are generating vast amounts of data, there is urgent need to develop efficient algorithms for sequencing data compression. Existing methods usually dispatch the similar sequences into the same bucket based on their same minimizer, that is the lexicographical smallest k-mer within the sequence, for data compression. However, when the sequencing error existed...
Vehicular network standard demands a short range reliable vehicle-to-vehicle (V2V) communication with high mobility, also increasing amount of downloaded data in short encounters. Satisfying demands of clients with minimum number of transmissions using index coding has proven notable significance in wireless ad-hoc networks. The proper encoding at the server with side information leads to simultaneous...
Deep neural networks (DNNs) usually demand a large amount of operations for real-time inference. Especially, fully-connected layers contain a large number of weights, thus they usually need many off-chip memory accesses for inference. We propose a weight compression method for deep neural networks, which allows values of +1 or −1 only at predetermined positions of the weights so that decoding using...
The naming of local variables is usually at the programmer's discretion. Thus, there is a diversity in naming local variables and this may cause variations in the code quality. Many coding conventions say that the name of a local variable can/should be short. This paper focuses on such conventions, and aims to explore the trends of local variables' names in Java and examine if abnormal local variables...
Polar coding is a low-complexity method for communication over noisy classical channels, which is capable of providing highly reliable data transmission. This paper proposes an enhanced polar codec scheme for mission critical applications in train-to-ground wireless communications. Firstly, we develop an enhanced polar coding scheme to support reliable data transmission under time-varying channel...
Encoding spatio-temporally varying textures is challenging for standardised video encoders, with significantly more bits required for textured blocks compared to non-textured blocks. It is therefore beneficial to understand video textures in terms of both their spatio-temporal characteristics and their encoding statistics in order to optimize coding modes and performance. To this end, we examine the...
Nowadays, Rate-Distortion Optimization (RDO) is commonly used in hybrid video coding to maximize coding efficiency. Usually, the rate distortion tradeoff is explicitly computed in offline encoder implementations whereas R(D) model are used in live encoders to select the best decisions at a lower computational cost. For sake of simplicity, this (mathematical) modelling is often performed for each coding...
By hiding messages inside existing network protocols, anti-censorship tools could empower censored users to visit blocked websites. However, existing solutions generally suffer from two limitations. First, they usually need the support of ISP or the deployment of many customized hosts to conceal the communication between censored users and blocked websites. Second, their manipulations of normal network...
This paper presents a new perspective on the adaptive Golomb Rice codes that is especially suitable for sources having a highly variable distribution in time. Instead of adapting the Golomb Rice parameter, the encoder adapts the order of the symbols based on a count of occurrences measure. The proposed order adaptive Golomb Rice method is compared against different versions of adaptive arithmetic...
We investigate the problem of index coding, where a sender transmits distinct packets over a shared link to multiple users with side information. The aim is to find an encoding scheme (linear combinations) to minimize the number of transmitted packets, while providing each user with sufficient amount of data for the recovery of the desired parts. It has been shown that finding the optimal linear index...
Recent work in video compression has shown that using multiple 2D transforms instead of a single transform in order to de-correlate residuals provides better compression efficiency. These transforms are tested competitively inside a video encoder and the optimal transform is selected based on the Rate Distortion Optimization (RDO) cost. However, one needs to encode a syntax to indicate the chosen...
Decentralized coded caching is applicable in scenarios where the server does not have enough knowledge about the entire cache network to perform centralized coordination during prefetching, such as when the server is uninformed of the number of active users and their identities in a wireless or mobile environment. Most of known decentralized strategies use random uncoded prefetching followed by coded...
Need for end-to-end secure voice communication under the cyber security threats are increasing day by day. This paper describes a method of establishing secure VOIP system in which the voice encoded with the SYMPES [1] coding technique and encryption set with an open standard encryption algorithm. Voice can be transmitted from point to point within a secure IP network. A Graphic Processing Unit (GPU)...
Sub-carrier Index modulated OFDM is an innovative technique that has recently gained popularity in the area of visible light communication. The technique is meritorious in that it offers a better BER performance than conventional OFDM, but it still suffers from high CCDF of PAPR distribution as in conventional case. In this paper an experimental study for a novel method of SIM OFDM modified with selective...
This paper proposes a color attribute compression method for MPEG Point Cloud Compression (PCC) by exploiting the spatial redundancy among the adjacent points. With the increased interest in representing real-world surface as 3D point clouds, compressing the attributes (i.e., colors and normal directions) of point cloud has attracted great attention in MPEG. The proposed method is based on grouping...
Orthogonal frequency division multiplexing with index modulation (OFDM-IM) is a newly proposed technique, which achieves significantly improved performance in comparison with classical OFDM by using the indices of active subcarriers to carry additional information bits. In this paper, we propose two power allocation (PA) algorithms for the sake of further improving the bit error rate (BER) performance...
Information exchange in a vehicular network between autonomous vehicles and the roadside infrastructure is important for improving road safety. These autonomous vehicles, equipped with a sensor suite, are capable of obtaining road map data that can be used to inform other vehicles and update the central road map repository through roadside units. The roadside infrastructure nodes act as local databases...
We study the problem of constructing good spacetime codes for broadcasting K independent messages over a MIMO network to L users, where each user demands all the messages and already has a subset of messages as side information. As a first attempt, we consider the 2 × 2 case and propose golden-coded index coding by partitioning the golden codes into K subcodes, one for each message. The proposed scheme...
A promising area that has recently emerged, is on how to use index coding to improve the communication efficiency in distributed computing systems, especially for data shuffling in iterative computations. In this paper, we posit that pliable index coding can offer a more efficient framework for data shuffling, as it can better leverage the many possible shuffling choices to reduce the number of transmissions...
Using a broadcast channel to transmit clients' data requests may impose privacy risks. In this paper, we tackle such privacy concerns in the index coding framework. We show how a curious client can infer some information about the requests and side information of other clients by learning the encoding matrix used by the server. We propose an information-theoretic metric to measure the level of privacy...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.