Filtyp
In this paper we synthesise previous sedimentological studies and new, high resolution, digital elevation models from southern Småland to investigate the evolution of a deglacial landscape. Starting approximately at the deglacial highest shoreline, there is a 20-40 km wide zone of ribbed and hummocky moraine that can be connected to the predominantly subaqueous Göteborg moraine. North of this ther
This paper presents the hardware implementation of a wavelet based event detector for cardiac pacemakers. A high level energy estimation flow was applied to evaluate energy efficiency of standard-cell based designs, over several CMOS technology generations, from 180 to 65 nm, operated in the sub-threshold domain. The simulation results indicate a 65 nm low-leakage high-threshold (LL-HVT) CMOS tech
Abstract in UndeterminedAs standards and regulatory codes are issued by third party organizations and committees, the project organization can neither control the content of all standards that the projects should adhere to, nor negotiate or make changes to them that can make the project development easier. Moreover, large infrastructure projects require compliance with hundreds of standards of reg
Decision-making in requirements engineering often needs to be done in the presence of uncertainty. Rigorous methods can help to increase the probability of making the most appropriate decisions under the given circumstances. Robustness is a measure for the degree of stability of a solution in case of changes in the problem parameters. This paper presents a method (called DECIDERelease) that applie
In this paper, we present a method of constructing new families of LDPC block code ensembles formed by terminating irregular protograph-based LDPC convolutional codes. Using the accumulate-repeat-by-4-jagged-accumulate (AR4JA) protograph as an example, a density evolution analysis for the binary erasure channel shows that this flexible design technique gives rise to a large selection of LDPC block
Background: There is a need for ecient regression testing in most software development organizations. Often the proposed solutions involve automation. However, despite this being a well researched area, research results are rarely applied in industrial practice. Aim: In this paper we aim to bridge the gap between research and practice by providing examples of how evidence-based regression testing
Pattern reconfigurability is a desirable feature of mobile handset antennas, as it enables the antennas to adapt to non-stationary propagation environments. However, it is difficult to vary the radiation pattern of a handset antenna at frequencies below 1 GHz because the entire chassis commonly acts as the main radiator. Hence, designing pattern reconfigurability based on the antenna element (seco
Critical systems must comply with safety standards in many application domains. This involves gathering safety evidence in the form of artefacts such as safety analyses, system specifications, and testing results. These artefacts can evolve during a system’s lifecycle, and impact analysis might be necessary to guarantee that system safety and compliance are not jeopardised. Although extensive rese
Product codes, due to their relatively large minimum distance, are often seen as a natural solution for applications requiring low error floors. In this paper, we show by means of an ensemble weight enumerator analysis that the minimum distance multiplicities of product codes are much higher than those obtainable by other generalized LDPC (GLDPC) constructions employing the same component codes. W
Background. When delivering an embedded product, such as a mobile phone, third party products, like games, are often bundled with it in the form of Java MIDlets. To verify the compatibility be- tween the runtime platform and the MIDlet is a labour-intensive task, if input data should be manually generated for thousands of MIDlets. Aim. In order to make the verification more efficient, we investiga
Network re-optimization is a process that must be triggered periodically in order to improve the inefficient resource allocation of online routing heuristics due to the uncertainty of online lightpath demand arrivals and departures. Network re-optimization involves two tasks: a) finding new lightpaths for a (sub)set of current demands, i.e. rerouting, and b) migrating the current traffic to the ne
Families of asymptotically regular LDPC block code ensembles can be formed by terminating (J, K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles with varying code rates, minimum distance that grows linearly with block length, and capacity approaching iterative decoding thresholds, despite the fact that t
In this paper we investigate the frame-error correcting performance of two newly developed, non-binary belief propagation based, soft-in/soft-out decoding algorithms when decoding Reed-Solomon codes. We present results for the AWGN channel indicating that non-binary belief propagation can come close to the performance of the binary adaptive Belief-Propagation algorithm or even slightly better when
Window decoding schedules are very attractive for message passing decoding of spatially coupled LDPC codes. They take advantage of the inherent convolutional code structure and allow continuous transmission with low decoding latency and complexity. In this paper we show that the decoding complexity can be further reduced if suitable message passing schedules are applied within the decoding window.
In this paper we present an algorithm for finding low-weight multiples of polynomials over the binary field using coding theoretic methods. The code defined by the public polynomial is cyclic, allowing an attacker to search for any shift of the sought codeword. Therefore, a code with higher length and dimension is used, having a larger number of low-weight codewords. Additionally, since the degree of
In this paper, we perform an iterative decoding threshold analysis of LDPC block code ensembles formed by terminating (J,K)-regular and irregular AR4JA-based LDPC convolutional codes. These ensembles have minimum distance growing linearly with block length and their thresholds approach the Shannon limit as the termination factor tends to infinity. Results are presented for various ensembles and te
We deal with the important applicative problem of distributed cameras calibration. We model a network of N cameras as an undirected graph in which communicating cameras can measure their relative orientation in a noisy way. These measures can be used in order to minimize a suitable cost function. The shape of this cost function depends on a vector of integers K. We propose two algorithms which in
China’s state-run archives offer some interesting surprises to students of history looking eastward from a European vantage point in 2006. Beijing’s Municipal Archive, for example, is something quite unlike what one might expect if all one knew were the archives of Eastern Europe’s now “former” communist states. Particularly noteworthy is the use of the internet as a tool of interactive communicat
