Sökresultat

Braided convolutional codes (BCCs) are a class of spatially coupled turbo-like codes that can be described by a (2), (3)-regular compact graph. In this paper, we introduce a family of (d v , d c )-regular GLDPC codes with convolutional code constraints (CC-GLDPC codes), which form an extension of classical BCCs to arbitrary regular graphs. In order to characterize the performance in the waterfall

Propagation models constitute a fundamental building block of wireless communications research. Before we build and operate real systems, we must understand the science of radio propagation, and develop channel models that both reflect the important propagation processes and allow a fair comparison of different systems. In the past five decades, wireless systems have gone through five generations,

Ray-Triangle intersection is a fundamental computation in most ray tracing algorithms. The prohibitive cost of the ray-triangle test algorithms, however, limits the utilization of these algorithms in settings with low power budgets, such as mobile systems. In this work, we analyze the precision requirements for ray-triangle intersection and observe that for most of the rays a low-precision is suff

Radio based positioning or tracking solutions typically require wideband signals or phase coherent antennas. In this paper, we present a target tracking method based on received non-coherent signal strength differences (RSSDs) between antennas for outdoor Internet-of-things (IoT) scenarios. We introduce an RSSD model based on classical path-loss models. With known antenna patterns and antenna arra

In this paper, we introduce two new methods of mit- igating decoder error propagation for low-latency sliding window decoding (SWD) of spatially coupled low-density parity-check (SC- LDPC) codes. Building on the recently introduced idea of check node (CN) doping of regular SC-LDPC codes, here we employ variable node (VN) doping to fix (set to a known value) a subset of variable nodes in the coupli

Given a Boolean formula, the problem of counting seeks to estimate the number of solutions of F while the problem of uniform sampling seeks to sample solutions uniformly at random. Counting and uniform sampling are fundamental problems in computer science with a wide range of applications ranging from constrained random simulation, probabilistic inference to network reliability and beyond. The pas

The use of ultra-low power wake-up receivers (WuRx) can significantly reduce idle listening energy cost. To tailor a WuRx scheme to orthogonal frequency division multiplexing (OFDM) based systems, such as LTE-MTC or IEEE 802.11, the wake-up signal (WUS) also needs to follow OFDM principles to avoid interfering with other transmissions in the same shared bandwidth. Here, we address this particular

Cellular radio based localization can be an important complement or alternative to other localization technologies, as base stations continuously transmit signals of opportunity with beneficial positioning properties. In this paper, we use the long term evolution (LTE) cell-specific reference signal for this purpose. The multipath component delays are estimated by the ESPRIT algorithm, and the est

A (Formula presented.) -configuration is a set of (Formula presented.) blocks on (Formula presented.) points. For Steiner triple systems, (Formula presented.) -configurations are of particular interest. The smallest nontrivial such configuration is the Pasch configuration, which is a (Formula presented.) -configuration. A Steiner triple system of order (Formula presented.), an STS (Formula present

We show exponential lower bounds on resolution proof length for pigeonhole principle (PHP) formulas and perfect matching formulas over highly unbalanced, sparse expander graphs, thus answering the challenge to establish strong lower bounds in the regime between balanced constant-degree expanders as in [Ben-Sasson and Wigderson'01] and highly unbalanced, dense graphs as in [Raz'04] and [Razborov'03

We give a significantly simplified proof of the exponential separation between regular and general resolution of Alekhnovich et al. (2007) as a consequence of a general theorem lifting proof depth to regular proof length in resolution. This simpler proof then allows us to strengthen the separation further, and to construct families of theoretically very easy benchmarks that are surprisingly hard f

Building on [Clegg et al.’96], [Impagliazzo et al.’99] established that if an unsatisfiable k-CNF formula over n variables has a refutation of size S in the polynomial calculus resolution proof system, then this formula also has a refutation of degree k + O(n log S). The proof of this works by converting a small-size refutation into a small-degree one, but at the expense of increasing the proof si

A Scania 13 1 engine modified for single cylinder operations was run using nine fuels in the boiling point range of gasoline, but very different octane number, together with PRF20 and MK1-diesel. The eleven fuels were tested in a load sweep between 5 and 26 bar gross IMEP at 1250 rpm and also at idle (2.5 bar IMEP, 600 rpm). The boost level was proportional to the load while the inlet temperature

Network Function Virtualization (NFV) has shifted communication networks towards more adaptable software solutions, but this transition raises new security concerns, particularly in public cloud deployments. While Intel’s Software Guard Extensions (SGX) offers a potential remedy, it requires complex application adaptations. This paper investigates AMD’s Secure Encrypted Virtualization (SEV) as an

The introduction of standardized APIs for ray tracing, together with hardware acceleration, opens up possibilities for physically based lighting in real-time rendering. Light importance sampling is one of the fundamental operations in light transport simulations, applicable to both direct and indirect illumination. This chapter describes a bounding volume hierarchy data structure and associated sa