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.
This paper introduces a new theoretical framework, akin to the use of imprecise message storage in Low Density Parity Check (LDPC) decoders, which is seen as an enabler for cost-effective hardware designs. The proposed framework is the one of Non-Surjective Finite Alphabet Iterative Decoders (NS-FAIDs), and it is shown to provide a unified approach for several designs previously proposed in the literature...
In this paper, the energy efficiency (EE) of a cooperative diversity system with maximum diversity network coding (MDNC) is studied. In the considered system, channel state information (CSI) is only available at the receivers for all the channels. We formulate the problem of maximizing the EE under the constraint on the outage probability. The problem is NP-hard due to the non-convexity of the outage...
The neighbor discovery (ND) procedure is typically performed during the network setup and allows nodes to learn about the existence of neighbors, exploiting the transmission of broadcast messages. Battery powered nodes impose many constraints on the ND protocol, such as low latency and energy efficiency. This calls for the deployment of dedicated and efficient ND protocols allowing nodes to be idle...
We study a wireless-powered uplink communication system with non-orthogonal multiple access (NOMA), consisting of one base station and multiple energy harvesting users. We focus on data rates optimization and fairness increase. We show that the formulated optimization problems can be optimally and efficiently solved by either linear programming methods or convex optimization, which means that the...
Both scalar and vector quantization are studied when Compress and Forward (CF) is performed in the Two Way Relay Channels. The optimization schemes of these two kinds of quantizers aiming to maximize the sum rate are proposed. The optimization schemes are a combination of the Information Bottleneck (IB) method and the Bi- Section method. The performance of these two types of quantizers are compared...
In this paper, we investigate energy cooperation among sustainable cooperative relay nodes, which adopt decode- and-forward (DF) relaying. The relay nodes work on either information decoding (ID) mode or energy harvesting (EH) mode when receiving the signal from the source. Due to different harvested energy at the relay nodes, effective energy cooperation can benefit the energy efficiency, but suffer...
The compression step of the Cloud Radio Access Networks (C-RAN) is studied in this paper. In order to maximize the achievable sum rate in the uplink of C-RAN, constrained by the finite-capacity fronthaul links to the Central Processor (CP) in the cloud, an optimization algorithm of quantizers used for compression is proposed. In C-RAN, there are multiple Radio Units (RUs) compressing and forwarding...
We introduce an optimisation problem to maximise the throughput of class of rateless codes subject to a delay constraint for a point to point erasure packet channel with delayed feedback. We show that this problem is convex. Using the formulation for point to point communication, we extend our approach to the communication of multiple unicast flows in a network.
Energy harvesting has emerged as a promising technique which helps to increase the sustainability of wireless networks. In this paper, we consider a network with a single source, single destination and a single relay equipped with multiple antennas. We develop an optimization framework that exploits the energy harvested from the source radio frequency signals with smart antenna selection schemes at...
Consider a radio access network wherein a basestation is required to deliver a set of order-constrained messages to a set of users over independent erasure channels. This paper studies the delivery time reduction problem using instantly decodable network coding (IDNC). Motivated by time-critical and order-constrained applications, the delivery time is defined, at each transmission, as the number of...
Selective encryption approaches for efficient multimedia content protection is proposed in wireless multimedia sensor networks (WMSNs) by many authors. Apart from these methodologies, the other important aspect which is discussed in some literatures is the combined optimization of multimedia quality, content protection and energy issues pertaining to communication. However in these joint optimization...
In this paper we consider the Two Way Relay Channel (TWRC) where Noisy Network Coding (NNC) is performed. We propose an optimization scheme in terms of the sum rate by combining the Information Bottleneck (IB) method and the Bi-Section method. Then we compare the performance of the quantizer optimized by the proposed algorithm with other quantizers. We also compare and analyse the maximized sum rate...
Spatially coupled low-density parity-check (SC-LDPC) codes can achieve the channel capacity under low-complexity belief propagation (BP) decoding, however, there is a non-negligible rate-loss because of termination effects for practical finite coupling lengths. In this paper, we study how we can approach the performance of terminated SC-LDPC codes by random shortening of tail-biting SC-LDPC codes...
The problem of a lossy compression of a vector Gaussian source with correlated side information at decoders is considered. We characterize the rate-distortion function when the decoders' reconstructions are subject to small trace error covariance distortion constraints.
This paper proposes guided-colorization-based image coding that utilizes a guide image for encoding chroma components. Up to now, several colorization-based image coding techniques have been proposed. In those techniques, the luma component is encoded by a standard encoder, while the two chroma components by colorization. Namely, the encoder selects representative chroma samples and the decoder recovers...
Finding the best possible encoding decisions for compressing a video sequence is a highly complex problem. In this work, we propose a multi-objective Design Space Exploration (DSE) method to automatically find HEVC encoder implementations that are optimized for several different criteria. The DSE shall optimize the coding mode evaluation order of the mode decision process and jointly explore early...
Classically, the quantization of the soft information supplied to a finite-precision decoder is chosen to optimize a certain criterion which does not depend on the characteristics of the existing code. This work studies code-aware quantizers, for finite-precision min-sum decoders, which optimize the noise threshold of the existing family of Low-Density Parity-Check (LDPC) codes. We propose a code-aware...
The adoption of HLS has been driven by the need to tackle growing verification costs in traditional RTL design flows. This paper presents an overview of design, optimization and verification using HLS. It also outlines some of the requirements for HLS design to fit into existing design and verification flows and ways in which such flows might be adapted as HLS is more widely deployed.
The evolution of multimedia encoding techniques allows efficiently provisioning video services at different quality levels. However, resulting streams lead to different energy consumptions making it difficult to simultaneously satisfy both energy consumption and quality requirements. In order to deal with the resulting trade-off, in this paper we propose a novel joint optimization method of energy...
In this paper, we use the physical aspect of the simulated annealing method in order to propose a modified simulated annealing algorithm. The main idea of the algorithm is based to find the optimal solution of a combinatorial optimization problem by switching between two different subsystems of treatment; using so called degeneration of atoms energy. This new algorithm is named Degeneration Simulated...
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.