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.
Dynamic dataflow models of computation (MoCs) have been introduced to provide designers with enough expressive power to capture increasing levels of dynamism in modern streaming applications. Among dynamic dataflow MoCs, parametrized dataflow MoCs hold an important place as they integrate dynamic parameters and run-time adaptation of parameters in a structured way. In this work, we analyze the temporal...
It is widely believed that future small-cell unmanaged wireless networks will be dominated by interference caused by packet collisions and not by signal-to-noise issues. In such a network, a large fraction of the collisions are caused by hidden terminals. Here we present the design and evaluation of RoXOR, a system that can effectively combat random collisions caused by bursty traffic from hidden...
Traditional audio codecs based on real-valued transforms utilize separate and largely independent algorithmic schemes for parametric coding of noise-like or high-frequency spectral components as well as channel pairs. It is shown that in the frequency-domain part of coders such as Extended HE-AAC, these schemes can be unified into a single algorithmic block located at the core of the modified discrete...
According to published literature for turbo decoding, SOVA and log-MAP algorithms share common operations. This paper shows that the improved reconfigurable SOVA/log-MAP turbo decoder can be implemented in LTE standard for uncorrelated Rayleigh fading channel. We concentrate on physical shared channel and use pipeline turbo decoder architecture with 12 iterations. We examine two data rates and for...
In this paper, we propose a new rateless code based on overlapped generations. This proposed scheme works very well especially in a broadcast scenario, where channels with different characteristics are involved in the system. In the proposed scheme, we allow the adjacent generations to overlap. Our main focus is on the design of rateless codes to make any receiver able to recover all the source file...
Wireless sensor networks (WSN) provide attractive solutions for data exchange in a variety of applications from military surveillance to medical and environmental monitoring. The commonality in all such applications is that the data collected in some nodes of the network is needed at some other nodes, for instance in a data collector node. The nodes are typically limited in terms of power, memory,...
In the communication of source-coded messages, certain dependency structures often exist among the messages, where a source model is proposed to model arbitrary dependency structure of such kind. Under a message-dependency model, the problem of communicating dependent messages subject to certain delay constraint is formulated as the problem of maximizing the average utility at the receiver. In this...
This paper studies the problem of minimum delay scheduling in wireless networks with multi-packet transmission capability. Specifically, we assume that the network employs superposition coding at the physical layer in order to implement multi-packet transmission. While most studies on superposition coding assume that unbounded number of packets can be coded together, physical and MAC layer limitations...
We consider zero-delay analog coding of a Gaussian source over a Gaussian channel with additive correlated Gaussian interference known to the transmitter. The receiver aims to jointly estimate the source signal and the state interference. We propose a layered parametric analog coding scheme based on linear and sawtooth mappings. We derive an upper bound on the distortion for the parametric scheme...
Application of hardware description languages (e.g. Verilog, VHDL) to create design model and logic synthesis tools to generate its physical implementation is preferred design paradigm. In this paper it is examined how the modeling style used to implement the thermometer-to-binary encoder influence parameters of the synthesized circuit. It is demonstrated that badly chosen language statements and...
The rapid growth of video in wireless networks is a crucial issue to be addressed by content providers. Nowadays, an emerging and promising trend is the development of solutions aimed at maximizing the quality of experience (QoE) of end users. However, the prediction of the QoE perceived by users in different conditions remains a major challenge. In this paper, we propose a two-layer hierarchical...
Network coding tends to increase not only the end-to-end delay due to unavoidable buffering of packets, but it also increases the inter-packet delay variations (jitter) due to batching. While an increase in delay does not necessarily adversely affect throughput, sudden delay spikes may interfere with TCP’s congestion avoidance mechanism. Such spikes are a common phenomenon in coded packet networks...
Marginal failure is common in failure analysis in which the failure is dependant to voltage or timing. Instead of using conventional die top microprobing to isolate the failure location, Laser Assisted Device Alteration (LADA) together with modified test pattern to isolate the failure location by incorporating Atomic Force Probe (AFP) and Transmission Electron Microscopy (TEM) to determine the failure...
We consider a setting in which a sender wishes to broadcast a block of K data packets to a set of wireless receivers, where each of the receivers already has a subset of the data packets available to it (e.g., from prior transmissions) and wants to obtain the rest of the packets in the block. Our goal is to find a linear network coding scheme that yields the minimum average packet decoding delay (APDD),...
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...
LDPC codes are typically decoded by running a synchronous message passing algorithm over the corresponding bipartite factor graph (made of variable and check nodes). More specifically, each synchronous round consists of 1) updating all variable nodes based on the information received from the check nodes in the previous round, and then 2) updating all the check nodes based on the information sent...
In a recently proposed asynchronous communication setup, the receiver observes mostly pure background noise except for a brief and a priori unknown period of time when data is transmitted. Capacity per unit cost and minimum communication delay were characterized and shown to be unaffected by a sparse sampling at the receiver as long as the number of samples represents a constant fraction of the total...
In this paper, we propose algorithms for computing Walsh-Hadamard transform with arbitrary K-sparse support. When K is sublinear in the dimension N of the time-domain signal, the algorithms achieve vanishing error probability as K increases without bound and involve sublinear computational complexity. Specifically, under the noiseless setting, an algorithm based on random hashing and successive cancellation...
The coherence time of a wireless channel is often smaller than the delay with which channel state information is available at transmitters. In this paper, we aim to find the most important subset of the channel state information that transmitters need to learn with delay. We characterize the capacity region of the two-user interference channel with local delayed channel state information at transmitters...
The column Hamming distance of a convolutional code determines the error correction capability when streaming over a class of packet erasure channels. We show that the column sum rank parallels column Hamming distance when streaming over a network with link failures. We prove rank analogues of several column distance properties and introduce a new family of convolutional codes that maximize the column...
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.