Search

First, a counter example is constructed to show that for any given positive integer K ≥ 2 and for any (1/√K + 1) ≤ t < 1, there always exists a K‐sparse x and a matrix A with the restricted isometry constant δK+1 = t such that the orthogonal matching pursuit (OMP) algorithm fails in K iterations. Secondly, it is shown that even when δK + 1 = (1/(√K + 1)), the OMP algorithm can also perfectly recover every K‐sparse vector x from y = Ax in K iterations. This improves the best existing results which were independently given by Mo and Shen and Wang and Shim. [ABSTRACT FROM AUTHOR]

The recently introduced spatially coupled turbo‐like codes are attractive in trading‐off performances between the error‐floor region and the water‐fall region. This letter is concerned with the construction of spatially coupled serially concatenated codes. Particularly, a new construction of spatially coupled serially concatenated codes is presented, in which a portion of the encoding output of the previous inner encoder is taken as the input of the current inner encoder. The authors show that by proper selection of the component codes and the re‐encoding ratio, performance gain about 0.25 dB is obtained with the proposed construction. [ABSTRACT FROM AUTHOR]

The complementary error function is a fundamental function in statistics and plays a central role in numerous applications. Its upper bound is essential for simplifying many performance analysis in communications. This Letter develops a new upper bound, which is sharper than existing upper bounds, on the complementary error function. Simulation tests are also performed to illustrate the sharpness of the new upper bound. [ABSTRACT FROM AUTHOR]

The complementary error function is a fundamental function in statistics and plays a central role in numerous applications. Its upper bound is essential for simplifying many performance analysis in communications. This Letter develops a new upper bound, which is sharper than existing upper bounds, on the complementary error function. Simulation tests are also performed to illustrate the sharpness of the new upper bound. [ABSTRACT FROM AUTHOR]