Long Low Iterations

Modified Noor iterations for infinite family of strict pseudo-contraction mappings

Low Complexity Belief Propagation Polar Code Decoders

Since its invention, polar code has received a lot of attention because of its capacity-achieving performance and low encoding and decoding complexity. Successive cancellation decoding (SCD) and belief propagation decoding (BPD) are two of the most popular approaches for decoding polar codes. SCD is able to achieve good error-correcting performance and is less computationally expensive as compa...

On Constructing Low-Density Parity-Check Codes

This thesis focuses on designing Low-Density Parity-Check (LDPC) codes for forward-error-correction. The target application is real-time multimedia communications over packet networks. We investigate two code design issues, which are important in the target application scenarios, designing LDPC codes with low decoding latency, and constructing capacity-approaching LDPC codes with very low error...

STABILITY OF D-WAVE SUPERCONDUCTIVITY IN THE t−J MODEL

We use a recently developed technique, which allows to perform few Lanczos steps on a given wavefunction even for large system sizes, to investigate the t−J model in the physical parameter region and to check the stability of the BCS d-wave variational wavefunction [1]. Our statistical Lanczos algorithm, which extends and improves the one Lanczos step proposed in Ref. [2], has been extensively ...

Double Sequence Iterations for Strongly Contractive Mapping in Modular Space

In this paper, we consider double sequence iteration processes for strongly $rho$-contractive mapping in modular space. It is proved, these sequences, convergence strongly to a fixed point of the strongly $rho$-contractive mapping.