Filtyp
Concepts of cognitive radio are yet in an early stage of development. They aim at improving the efficiency of spectrum utilization by exploiting locally and temporally vacant parts of the spectrum. When hierarchical spectrum access is considered, secondary users are authorized to use spectrum white spaces on a non-interfering basis, where minimal impact on the primary systems has to be ensured. GF
Bytecode folding is an effective technique for speeding up execution in Java virtual machines. This paper investigates a hardware implementation of the aforementioned technique on BlueJEP, a Java embedded processor. Since BlueJEP is a micro-programmed stack machine, we adopt a micro-instruction oriented approach, folding up to four microinstructions (corresponding to up to four bytecodes, on occas
We study the well known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. In order to do this, we recall the analogy between Markov Chains and electrical resistive networks. By exploiting this analogy, we are able to rewrite the performance cost as the average effective resistance on a suitable network
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
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
The southern slopes of the mountain ridge Kolmarden along the northern border of the province Ostergotland ill south-eastern Sweden have a very rich flora and varied geomorphology. Several rare and locally endemic microspecies of Hieracium have been described or reported from the area but no hieraciologist has visited the region since c. 1930. In 2004, the present author walked c. 50 km in this ar
Popular Abstract in Swedish Idag har patienter med blodcancer (leukemi) eller genetiskt betingade blodsjukdomar (sickelcellanemi etc.) begränsad tillgång till behandlingar som effektivt och riskfritt botar sjukdomstillståndet. Detta arbete inkluderar forskningsresultat ämnade att bidra till utveckling av konceptuellt nya behandlingsmetoder för olika typer av blodsjukdomar. Ett fungerande blodsysteThere is a pressing need for compatible Hematopoietic Stem Cells (HSCs), in high quantities and of good clinical quality, to ensure optimal treatment for patients with various blood malignancies. Pluripotent Stem Cells (PSCs) have the potential to be a source for generating HSCs. The indefinite expansion capacity of PSCs, combined with the possibility of creating these cells from patient-specific
Generalized frequency division multiplexing (GFDM) is a new digital multicarrier concept. The GFDM modulation technique is extremely attractive for applications in a fragmented spectrum, as it provides the flexibility to choose a pulse shape and thus allows reduction of the out-of-band leakage of opportunistic cognitive radio signals into incumbent frequency space. However, this degree of freedom
Generalized frequency division multiplexing (GFDM) is a new concept that can be seen as a generalization of traditional OFDM. The scheme is based on the filtered multi-carrier approach and can offer an increased flexibility, which will play a significant role in future cellular applications. In this paper we present the benefits of the pulse shaped carriers in GFDM. We show that based on the FFT/I
Codes constructed from connected spatially coupled low-density parity-check code (SC-LDPCC) chains are proposed and analyzed. It is demonstrated that connecting coupled chains results in improved iterative decoding performance. The constructed protograph ensembles have better iterative decoding thresholds compared to an individual SC-LDPCC chain and require less computational complexity per bit wh
In this paper the impact of different meals and rapid insulin were estimated as Finite Impulse Response Models from a data set of 18 patients. Based on these models short-term individualized predictors were tested for 20 and 60 minute prediction. The predictors were evaluated using Clarke Grid Analysis and had on average more than 94 % and 75 % in the A zone and less than 1 % and 3 % in the erroro
Development and optimization of the production of lactic acid bacteria (LAB) and their attendant 'natural' inhibitors as biopreservatives to control undesirable bacteria currently remains a primary focus of several laboratories involved in research concerning food safety and quality. Strategies utilized to study incorporation of biopreservatives into food include either direct use of LAB-strains o
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
A threshold analysis of terminated braided block codes (BBCs) is presented for the binary erasure channel. Protograph based BBCs (PG-BBCs) are considered, which can be derived by lifting the Tanner graph of a tightly braided block code. They can be interpreted as GLDPC convolutional codes that are structured in a particular way. It is shown that the terminated PG-BBCs have better thresholds than t
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 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
