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 compressive sensing theory indicates that robust reconstruction of signals can be obtained from far fewer measurements than those required by the Nyquist theorem. Thus, it has great potential in video acquisition and processing in that it can tremendously save the complex compression required by traditional video coding standards. In this paper, we consider reconstruction of compressive-sensed...
The model predictive control problem of linear systems with integer inputs results in an integer optimization problem. In case of a quadratic objective function, the optimization problem can be cast as an integer least-squares (ILS) problem. Three algorithms to solve this problem are proposed in this paper. Optimality can be traded in to reduce the computation time. An industrial case study—an inverter-driven...
In this paper, we propose to optimize the distribution of the average relay energy in a Cooperative Automatic Repeat reQuest (C-ARQ) scheme. We consider wireless transmissions over Rayleigh fading channels between two sources nodes, one relay node and one destination node. We propose to use specific relay and destination treatment for different possible cases. When only one received packet is detected...
A class of rate-compatible (RC) quasi-cycle low-density parity-check (QC-LDPC) codes that have linear encodable complexity and low error floor is presented. To ensure linear encoding complexity, a lower triangular (LT) form for the parity part of the mother parity-check matrix is designed. By the designed LT form, a recursive encoding strategy is proposed. This encoding strategy can achieve linear...
With the increasing demand of transmission speed and more robust quality of service, the capacity constrained backhaul gradually becomes bottleneck in cooperative wireless networks, e.g. in Joint Processing mode of LTE-Advanced Pro. This paper focuses the fact of resource allocation with limited backhaul capacity in uplink cooperative networks, where two base stations (BS) equipped with single-antenna...
Search algorithms that reduce the time to solve the direct model predictive control (MPC) problem are proposed in this paper. By allowing for suboptimal solutions, the computational complexity of the underlying optimization problem can be significantly reduced, albeit by sacrificing (to a certain degree) optimality. Two approaches are presented and discussed. The first approach requires quadratic...
Tree based optimization problems stand for those paradigms where solutions can be arranged within a tree-like graph whose nodes represent the optimization variables of the problem at hand and their interconnecting edges topological and/or hierarchical relationships between such variables. In this context, a research line of increasing interest during the last decade focuses on the derivation of intelligent...
Erasure codes are widely deployed in storage systems and the encoding/decoding process is a common operation in erasure-coded systems. Parity-check matrix method is a general method employed in erasure codes to conduct encoding/decoding process. However, the process is serial and generates high computational cost in dealing with matrix operations, and hence, causes low encoding/decoding performance...
The second-order coding rate for source-channel codes with m levels of unequal message protection (UMP) is derived. The second-order coding rate takes the form of an optimization problem which reduces to separate source-channel coding rate for m = 2. A procedure for solving the given optimization problem is proposed. The proposed procedure exploits the structure of the problem to reduce the optimization...
We firstly extend the interpretation of feedback communication over stationary finite dimensional Gaussian channels as feedback control systems by showing that, the problem of finding stabilizing feedback controllers with maximal reliable transmission rate over Youla parameters coincides with the problem of finding strictly causal filters to achieve feedback capacity recently derived in [1]. The aforementioned...
Compute-and-forward is an emerging technique to increase throughput in interference networks. It allows the relays to decode an equation of codewords instead of each single codeword. Choosing the appropriate equation plays a crucial role on the performance. While there are several algorithms that solve this optimization problem, they all perform a local optimization. In large relay networks this can...
We present optimization algorithm for relay (RLY) selection and, source (SRC) and RLY power allocations in a cooperative multicast millimeter-wave (mmWave) system with non-line-of-sight (non-LoS) sensing. We show that there is a significant benefit to the system outage performance by allocating powers for the SRC and the RLYs selected from the candidates availing of line-of-sight (LoS) paths. Specifically,...
In this paper, we study the effect of optimal power allocation on the performance of communication systems using hybrid-automatic repeat request (HARQ) protocols with a limited maximum number of transmission rounds. We formulate the optimization problem aiming to minimize the total average power consumption in order to achieve a target performance constraint, where the total power consumption stands...
Reducing the complexity of decoding algorithms for LDPC codes is an important prerequisite for their practical implementation. In this work we propose a reduction of computational complexity targeting the highly reliable codeword bits and show that this approach can be seamlessly merged with the forced convergence scheme. We also show how the minimum achievable complexity of the resulting scheme for...
Brain-machine interfaces (BMIs) are human-machine integration systems that provide an interface between the brain and a machine to sense cortical neuronal activity for the purpose of restoring impaired motor tasks. In our previous work [1], an optimal design of BMIs based on artificial sensory feedback was developed using model predictive control which relied on neuronal activity in the form of spiking...
We discuss the optimization of staircase code parameters based on density evolution. An extension of the original code construction is proposed, leading to codes with steeper waterfall performance.
High Efficiency Video Coding (HEVC) is the new video compression standard, reducing bitrates nearly at half compared to H.264, offering potentially significant power savings for wireless video transmission at the network interface. This reduction in bitrate is achieved by a series of computationally expensive algorithms, thus making imperative to optimize HEVC decoding in order to provide a low-power...
This work demonstrates the distributed joint selfoptimization of power and decoding order, to alleviate uplink intercell interference in a heterogeneous network, with signal to interference ratio constraints. This problem can be formulated as a potential game of coupled action space among the basestations. However, best response dynamics of this game require global channel knowledge at all cells....
This paper considers the problem of reducing the broadcast delay of wireless networks using instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In D2D-enabled networks, devices help hasten the recovery of the lost packets of devices in their transmission range by sending network coded packets. To solve the problem, the different events occurring at each device are...
The achievable rate region of a K-user Gaussian multiple access channel (GMAC) is well known. Several schemes have been proposed to achieve some points in this region with minimal encoding and decoding complexities such as successive interference cancelation and successive integer forcing. But these schemes require coordination among the nodes or with the base station for choosing the rates of transmission...
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.