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.
While feasibility and obtaining a solution of a given network coding problem are well studied, the decoding procedure and complexity have not garnered much attention. We consider the decoding problem in a network wherein the sources generate multiple messages and the sink nodes demand some or all of the source messages. We consider both linear and non-linear network codes over a finite field and propose...
Online compression of I/O-data streams in general purpose computing will enhance the effective I/O bandwidth of processors, the bandwidth of the computer network as well as the storage capacity and the read/write performance of the storage. In this paper, a self-adaptive dynamic partial reconfigurable architecture for the online compression of data streams is introduced. The proposed architecture...
Polar codes are an exciting new class of error correcting codes that achieve the symmetric capacity of memoryless channels. Many decoding algorithms were developed and implemented, addressing various application requirements: from error-correction performance rivaling that of LDPC codes to very high throughput or low-complexity decoders. In this work, we review the state of the art in polar decoders...
Online compression of I/O-data streams in Custom Computing Machines will enhance the effective network band-width of computing systems as well as storage bandwidth and capacity. In this paper a self-adaptive dynamic partial reconfigurable architecture for online compression is proposed. The proposed architecture will bring new possibilities in online compression due to its adaptivity to dynamic environments...
Rise in bandwidth requirement for multimedia processing is forcing designers to use complex or wider buses in SOCs. Compression schemes using bit serial codes offer a low complexity encoding solution to such problems. However, their inherent sequential nature makes it challenging to achieve real time throughput at the decoder end. Conventionally, this problem is addressed by high frequency application...
In this paper, we propose a novel detection algorithm for random multiple access, which combines slot based decoding and frame based decoding to recover users' messages. For the slot based decoding, we exploit a linear physical-layer network coding (LPNC) algorithm to decode the linear combinations of collided packets at each slot. By designing the coefficient matrix of linear combinations, we have...
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...
We study the uplink multi-user multiple-input multiple-output (UL MU-MIMO) channel in a wireless local area network (WLAN) with multiple access points (APs) and multiple stations (STAs). APs are allocated with different orthogonal frequency-division multiplexing (OFDM) subcarriers. Each AP has multiple antennas and applies zero-forcing successive interference cancellation (ZF-SIC) as in [1] for spatial...
Distributed storage systems aim at providing reliable access to data that is spread across multiple nodes typically at different physical locations to provide better data safety and/or improve the data access speed. By using an erasure code and spreading coded fragments of the data onto the nodes, faster and more reliable access to the data can be guaranteed. By using Random Linear Network Coding...
In this paper we investigate the coded slotted ALOHA (CSA) schemes with repetition codes and maximum distance separable (MDS) codes over erasure channels. We derive the extrinsic information transfer (EXIT) functions of the CSA schemes over erasure channels, which allow an asymptotic analysis of the packet recovering process. Moreover, we define a traffic load threshold provided that the recovered...
In recent years, studies of DPI have been carried out actively. HTTP packets, which are a kind of DPI target, include GZIP compressed packets, and multi-streamed GZIP compressed HTTP cannot be analyzed directly on routers. Moreover, wire-rate processing is required to achieve on-router analysis. In this paper, HTTP decompressing architecture on routers supporting 40Gbps network is considered, and...
In this paper, we study the performance of wireless information and power transfer in the presence of statistical queuing constraints. We consider harvest-then-transmit protocol in which users first harvest energy from a dedicated source and then transmit information through an uplink multiple access channel (MAC). Each user is subject to limitations on the buffer overflow probability, specified by...
In this paper, decentralized heuristic access policies are designed for two secondary users (SUs) in an underlay cognitive radio network in which the PU employs Type-I Hybrid ARQ. Exploiting the redundancy in PU retransmissions, each SU receiver applies interference cancellation (IC) to remove a successfully decoded PU message in the subsequent PU retransmissions. There is no central control unit...
Spatially-coupled low-density parity-check (SC-LDPC) codes have been shown to be superior in performance than LDPC block codes. In order to comply with the practical constraints on latency, SC-LDPC codes are decoded using a window decoder that reduces the decoder latency and complexity compared to traditional block-wise decoding. However, so far the literature only considers the structural decoding...
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...
We consider an energy harvesting two-way channel with decoding costs. In this system, each node spends energy to transmit data to the other user, and also to decode data coming from the other user; that is, each user divides its harvested energy for transmission and reception. The power needed for decoding the incoming data is a function of the incoming data rate. We determine the optimal offline...
In this work, the stability region of the broadcast channel (BC) is explored, where the receiver, for which the packets need to be kept secret from the other receiver has full-duplex (FD) capability. The effect of self-interference on the stability region has also been investigated. In particular, the stability region is characterized under two types of decoding schemes: (a) both the receivers perform...
Network Coding is a packet encoding technique which has recently been shown to improve network performance (by reducing delays and increasing throughput) in broadcast and multicast communications. The cost for such an improvement comes in the form of increased decoding complexity (and thus delay) at the receivers end. Before delivering the file to higher layers, the receiver should first decode those...
In this paper, we consider a multiple-access broadcast channel (MABC) with ARQ feedback, in which M endusers wish to exchange messages with a central node or basestation. In this scenario, an end-user may overhear other endusers' messages prior to the re-transmission phase. We propose a new network coded (NCed)-ARQ scheme with reverse-link-assistance (RLA) that exploits this overheard information...
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.
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.