Search results

MacKay-Neal (MN) and Hsu-Anastasopoulos (HA) low-density parity-check (LDPC) codes are known to achieve the capacity of memoryless binary-input symmetric-output channels under maximum likelihood (ML) decoding with bounded col- umn and row weight in their associated parity-check matrices. Recently, Kasai and Sakaniwa showed that spatially coupled (SC) versions of the MN and HA LDPC codes have belie

It has previously been shown that ensembles of terminated protograph-based low-density parity-check (LDPC) convolutional codes have a typical minimum distance that grows linearly with block length and that they are capable of achieving capacity approaching iterative decoding thresholds on the binary erasure channel (BEC). In this paper, we review a recent result that the dramatic threshold improve

Our objective in this article is to assess the relation between long-term treatments of depressive episodes and attempted or completed suicide in patients who had had a severe depression at index admission. A blind record evaluation of 96 suicides with a primary severe depression and matched controls has been performed. Out of those, 57 and 33, respectively, bad made suicide attempts. Occurrence o

Wnt-5a is a secreted glycoprotein which has been shown to be involved in the regulation of cell adhesion and motility, processes which are of importance in metastasis formation by cancer cells. We here present an initial study aiming at evaluating whether small interfering RNA (siRNA) in combination with cisplatin can be used to modulate protein expression levels under in vitro conditions. For thi

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

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

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

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

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

As average packet sizes in wireless networks shrink and data rates increase, the fundamental CSMA mechanism in the 802.11 protocol family is put under stress. With the emerg- ing 802.11ax standard, the carrier sensing mechanism is low- ering the efficiency of the protocol to the level of random access (ALOHA), and as future-generation 802.11 standards emerge, CSMA-based protocols will fall below t

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