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.
Hybrid ARQ (HARQ) and link adaptation (LA) are two powerful techniques to improve the data throughput in wireless communication systems. However, when integrated with LA, conventional HARQ does not provide much gain over LA without significantly increasing the number of retransmissions and initial coding rate. In this paper, we explore the feasibility of achieving high throughput by combining HARQ...
In this paper, we study a spectrum allocation mechanism of Cognitive Radio Networks based on multi-backpack problem, and then propose a discrete hybrid leapfrog algorithm and a spectrum allocation method based on this algorithm. This algorithm uses the integer coding method and designs the corresponding algorithm search strategy, using the crossover and mutation operator to improve the algorithm performance...
In this paper, highly efficient practical concatenated coding schemes with multiple short length polar codes and single-parity-check codes are proposed. As for hardware complexity, required memory space is significantly reduced by utilizing small decoding units geared to serialized decoding of short-length component polar codes. In theoretic analysis, each component short polar code shows much improved...
In this paper, we propose an effective complexity control approach for video conferencing scenarios on HEVC platform. A complexity control formulation is established to determine the number of depth-constrained largest coding units (LCUs) according to the target complexity. By limiting the maximum depths of different LCUs to different levels, the encoding complexity can be controlled with high accuracy...
In the G.fast frequency range with strong levels of crosstalk, nonlinear precoding (NLP) is proposed as a near-optimal technique for crosstalk precompensation in downstream transmission. While existing methods for multi-tone NLP user encoding ordering (UEO) are rather heuristic in how they approach fairness and suffer from substantial suboptimality, we develop a novel algorithm for joint dynamic spectrum...
In this paper, an energy efficient coding scheme for the multiple access relay channel at a fixed desired sum rate is analyzed. We first introduce a coding scheme, then, derive an optimal set of power allocation, which minimizes the network energy consumption while maintaining a desired sum rate. The results show that this scheme significantly outperforms direct and two-hop transmission. Moreover,...
We propose a linear transceiver scheme for the symmetric two-user broadcast channel with additive Gaussian noise and quantized feedback. The quantized feedback link is modeled as an information bottleneck subject to a rate constraint. We introduce a superposition scheme that splits the transmit power between an Ozarow-like linear-feedback code and a conventional code that ignores the feedback. The...
In this work, we propose a link adaptation scheme called truncated channel inversion (TCI) as an effective power allocation strategy for block adaptive modulation, coding, and spatial mode (AMCS). Since water-filling based power allocation is no longer optimal to minimize bit error rate (BER) in block modulation system, block AMCS is considered as a practical link adaptation scheme. We first investigate...
This paper investigates resource allocation algorithms that use limited communication - where the supplier of a resource broadcasts a coordinating signal using one bit of information to users per iteration. Rather than relay anticipated consumption to the supplier, the users locally compute their allocation, while the supplier measures the total resource consumption. Since the users do not compare...
Nonorthogonal multiple access (NOMA) transmission is a popular candidate technology for the next generation broadband mobile communication systems because of high spectrum efficiency. In this paper, we proposed two beamforming scheme, namely, matched-to-the-stronger-channel (MSC) beamforming and optimal beamforming schemes for a two-user downlink NOMA system. Moreover, we also develop optimal power...
In this paper, we examine message prioritization in terms of both rate and reliability in the two-way relay channel using decode-forward relaying. Each source sends both a low priority message and a high priority message. We design a scheme that routes the high priority messages through the relay and direct link but the low priority message is only decoded by the destination. For fixed message priorities,...
The Internet is facing the accelerating growth of routing table size. Backbone routers' routing table has already reached 512k entries, which has a negative effect on the scalability of the Internet. Hierarchical addressing and locator/ID separation solutions have been proposed to address the scalability issue. However, there has been little focus on how to efficiently represent hierarchical location...
The rapid penetration of cloud and distributed computing technology is accelerating the need for one-to-many file transfers for sharing and duplicating data and applications among distributed data centers in an efficient manner. The purpose of our work is to develop a scheme to transfer a largesized file from a single sender to multiple receivers over an OpenFlow-based network as quickly as possible...
The inclusion of a previously non-existent traffic class required by the Smart Grid poses many difficulties on OFDMA based wireless communication systems. In this paper, we develop a resource allocation algorithm based on the ecological research Lotka-Volterra equations. Each class of traffic is modelled as a species and they compete over the telecommunications resources. Constraints were then placed...
We consider the broadcast channel with confidential messages (BCCM) over N parallel Gaussian channels. The transmitter aims at maximizing the sum-rate. The system has two combating jammers, each aiming to enhance the secure rate to one receiver only, while hurting the other receiver by sending Gaussian jamming signals. We cast the problem as an extensive-form game and derive the optimal jamming policy...
A parallel genetic algorithm (GA) implemented on GPU clusters is proposed to solve the Uncapacitated Single Allocation Hub Location problem. The GA uses binary and integer encoding with genetic operators adapted to this problem. Our GA is improved by initially locating hubs at middle nodes. In our implementation we use the power of the GPU to compute in parallel several initial solutions, varying...
Coded caching is a technique that receives much attention in the network literature, since it is able to achieve significant gains compared to the conventional uncoded caching schemes. In this paper, we first identify a family of placement and delivery schemes. Then we derive a lower bound on the average rate for the identified schemes. Based on the clue in deriving the lower bound, a new delivery...
Based on analog joint source-channel coding (JSCC) scheme, SoftCast approach can gracefully avoid the cliff effect. And SoftCast is outperformed by the DCast scheme which combines JSCC scheme with distributed source coding (DSC) theory. Considering the disproportionate distribution of frequency coefficients, we propose an optimized power allocation SoftCast (OPA-SoftCast) scheme which has a significant...
This paper presents a parallel motion estimation algorithm on Graphics Processing Units (GPU) with a GPU-based fast Coding Unit (CU) splitting mechanism for speeding up the execution speed of High Efficiency Video Coding (HEVC). Parallel motion estimation algorithms only offer motion vectors to HEVC encoder, but CU splitting decision in HEVC still needs more information to speed up the encoder. Therefore,...
The growing demand for smarter high-performance embedded systems leads to the integration of multiple functionalities in on-chip systems with tens (even hundreds) of cores. This trend opens a very challenging question about the optimal resource allocation in those manycore systems. Answering this question is key to meet the performance and energy requirements. This paper deals with a learning technique...
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.