Learn More
An iterative decoding threshold analysis for terminated regular LDPC convolutional (LDPCC) codes is presented. Using density evolution techniques, the convergence behavior of an iterative belief propagation decoder is analyzed for the binary erasure channel and the AWGN channel with binary inputs. It is shown that for a terminated LDPCC code ensemble, the(More)
—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(More)
We present a family of protograph based LDPC codes that can be derived from permutation matrix based regular (J,K) LDPC convolutional codes by termination. In the terminated protograph, all variable nodes still have degree J but some check nodes at the start and end of the protograph have degrees smaller than K. Since the fraction of these stronger nodes(More)
—Generalized frequency division multiplexing is a non-orthogonal, digital multicarrier transmission scheme with attractive features that address the requirements of emerging applications of wireless communications systems in areas like cognitive radio and machine-to-machine communication. In this paper, first a linear system description is obtained for the(More)
—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(More)
In this paper, we construct protograph-based spatially coupled low-density parity-check (LDPC) codes by coupling together a series of L disjoint, or uncoupled, LDPC code Tanner graphs into a single coupled chain. By varying L , we obtain a flexible family of code ensembles with varying rates and frame lengths that can share the same encoding and decoding(More)
We derive explicit density evolution equations for protograph-based generalized LDPC codes on the binary erasure channel. They are obtained from an analysis of multi-dimensional input/output transfer functions of the component decoders. Belief propagation decoding with optimal component APP decoders is considered. Based on the resulting transfer functions,(More)