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.
The use of multiple radio access technologies (RATs) is inevitable in future heterogeneous cellular networks. Various RATs can offer different throughputs, and thus RAT selection plays an important role in quality of service provisioning. In this paper, considering a heterogeneous network with two throughput classes, we introduce a new practical probabilistic RAT selection approach. In contrary to...
The robots having 3G/LTE capability can cooperate with others by using link-aggregation when one needs to send unexpected huge data in high bandwidth to the remote center office. To do so, the robot distributes its data to other robots with IEEE802.11 WLAN. They can move close to the robot to prevent from the situation where the WLAN communication becomes a bottleneck because they are too far to get...
In the ultra dense network (UDN), user-centric virtual cell (VC) has been proposed to weaken the traditional concept of base station centric cell, where each user is served by several transmit points (TPs). The overlapped VCs in UDN will result in severe inter-VC interference and degrade the system throughput. Merging overlapped VCs can transform the serious inter-VC interference into intra-VC interference,...
A new high-performance VLSI architecture for least mean square (LMS) adaptive filter using distributed arithmetic (DA) is presented. It is based on storing possible filter partial products in a look-up table (LUT) followed by a shiftaccumulation (SA) unit. Usually, all the address location of LUT need to be re-calculated in every iteration. In this paper, we proposed a new strategy for updating the...
State-of-the-art CNN models for Image recognition use deep networks with small filters instead of shallow networks with large filters, because the former requires fewer weights. In the light of above trend, we present a fast and efficient FPGA based convolution engine to accelerate CNN models over small filters. The convolution engine implements Winograd minimal filtering algorithm to reduce the number...
In this work, we study a practical resource allocation (RA) scheme that considers heterogeneous services in OFDMA femtocell networks. Heterogeneous services include guarantees of the minimum data-rate for delay-sensitive (DS) users and the fairness for delay-tolerant (DT) users. The RA problem is formulated to maximize the total throughput of all femtocells while satisfying the constraints of cross-tier...
Device-to-Device (D2D) communications can increase the spectral efficiency of future cellular networks when sharing part of the cellular spectrum. Radio resource allocation mechanisms are then necessary to control the interference that D2D and cellular transmissions can generate to each other. Most of the existing allocation schemes rely on the knowledge of the channel gain of all possible links between...
Nowadays, most of the geographical areas are covered by multiple heterogeneous networks. Moving terminals within these areas usually switch from a network to another for different motivations, such as enhancing quality of service, improving throughput, reducing monetary cost, etc. Terminal switching, aka handover, may occur to a spectrum band where the terminal is unlicensed as implied in the cognitive...
This paper develops a control framework for a network of energy harvesting nodes connected to a Base Station (BS) over a multiple access channel. Due to fluctuations in energy availability and, possibly, energy outages, the number of nodes attempting channel access is random and varies over time. Thus, each node must carefully adapt its access probability to the network state to optimize network performance...
We study the resource allocation problem in RAN-level integrated HetNets. This emerging HetNets paradigm allows for dynamic traffic splitting across radio access technologies for each client, and then for aggregating the traffic inside the network to improve the overall resource utilization. We focus on the max-min fair service rate allocation across the clients, and study the properties of the optimal...
The objective of this paper is to illustrate how to monetize infrastructures and services. This is achieved by a combination of measuring consumption, applying pricing strategies and client invoicing. Furthermore, a range of billing solutions are available in order to cover the Rating, Charging and Billing process. The focus here is on the comparison of solution based suitability, which depends on...
This work analyses the actual throughput of the Discrete Sine Transform (DST) stage in a realistic HEVC encoder, which executes the rate-distortion optimization algorithm to achieve high compression quality. Then, a low complexity DST factorization, where all the integer multiplications are substituted with add-and-shift operations, is exploited to design an efficient 1D-DST core. The proposed 1D-DST...
This paper presents the first systematic study on co-scheduling independent jobs on integrated CPU-GPU systems with power caps considered. It reveals the performance degradations caused by the co-run contentions at the levels of both memory and power. It then examines the problem of using job co-scheduling to alleviate the degradations in this less understood scenario. It offers several algorithms...
High-radix routers with low latency and high bandwidth play an increasingly important role in the design of large-scale interconnection networks such as those used in super-computers and datacenters. The tile-based crossbar approach partitions a single large crossbar into many small tiles and can considerably reduce the complexity of arbitration while providing throughput higher than the conventional...
In this paper, we consider the uplink of cell-free massive MIMO systems, where a large number of distributed single antenna access points (APs) serve a much smaller number of users simultaneously via limited backhaul. For the first time, we investigate the performance of compute-and-forward (C&F) in such an ultra dense network with a realistic channel model (including fading, pathloss and shadowing)...
This work is focused on FPGA based implementations of the SHA-3 hash functions. The existing literature classifies the existing implementations according to the adopted structural optimization techniques, namely: folding, pipelining and unrolling. Several structures have been proposed in the state-of-the-art, which vary mainly in the level of folding and the number of pipeline stages. While unfolded...
Multiple-input multiple-output (MIMO) communication is an important technique to increase the transmission capacity, but the increased antenna number does not necessarily increase the throughput because of more antenna interference and decoding complexity. An iterative detector-and-decoder (IDD) can effectively improve transmission performance by exchanging reliability information such as log likelihood...
The decoding performance of polar codes strongly depends on the decoding algorithm used, while also the decoder throughput and its latency mainly depend on the decoding algorithm. In this work, we implement the powerful successive cancellation list (SCL) decoder on a GPU and identify the bottlenecks of this algorithm with respect to parallel computing and its difficulties. The inherent serial decoding...
Spinal codes are a recently proposed capacity-achieving rateless code. While hardware encoding of spinal codes is straightforward, the design of an efficient, high-speed hardware decoder poses significant challenges. We present the first such decoder. By relaxing data dependencies inherent in the classic M-algorithm decoder, we obtain area and throughput competitive with 3GPP turbo codes as well as...
This paper studies the problem of cooperative communications in cognitive radio networks where the secondary user is equipped with finite length relaying queue as well as finite length battery queue. The major hurdle towards fully characterizing the stable throughput region stems from the sheer complexity associated with solving the two-dimensional Markov Chain (MC) model for both finite queues. Motivated...
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.