اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدWave-Like Solutions of General One-Dimensional Spatially Coupled Systems
50
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We establish the existence of wave-like solutions to spatially coupled graphical models which, in the large size limit, can be characterized by a one-dimensional real-valued state. This is extended to a proof of the threshold saturation phenomenon for all such models, which includes spatially coupled irregular LDPC codes over the BEC, but also addresses hard-decision decoding for transmission over general channels, the CDMA multiple-access problem, compressed sensing, and some statistical physics models. For traditional uncoupled iterative coding systems with two components and transmission over the BEC, the asymptotic convergence behavior is completely characterized by the EXIT curves of the components. More precisely, the system converges to the desired fixed point, which is the one corresponding to perfect decoding, if and only if the two EXIT functions describing the components do not cross. For spatially coupled systems whose state is one-dimensional a closely related graphical criterion applies. Now the curves are allowed to cross, but not by too much. More precisely, we show that the threshold saturation phenomenon is related to the positivity of the (signed) area enclosed by two EXIT-like functions associated to the component systems, a very intuitive and easy-to-use graphical characterization. In the spirit of EXIT functions and Gaussian approximations, we also show how to apply the technique to higher dimensional and even infinite-dimensional cases. In these scenarios the method is no longer rigorous, but it typically gives accurate predictions. To demonstrate this application, we discuss transmission over general channels using both the belief-propagation as well as the min-sum decoder.
قيم البحث
اقرأ أيضاً
A circulant-based spatially-coupled (SC) code is constructed by partitioning the circulants in the parity-check matrix of a block code into several components and piecing copies of these components in a diagonal structure. By connecting several SC co
des, multi-dimensional SC (MD-SC) codes are constructed. In this paper, we present a systematic framework for constructing MD-SC codes with notably better cycle properties than their one-dimensional counterparts. In our framework, the multi-dimensional coupling is performed via an informed relocation of problematic circulants. This work is general in the terms of the number of constituent SC codes that are connected together, the number of neighboring SC codes that each constituent SC code is connected to, and the length of the cycles whose populations we aim to reduce. Finally, we present a decoding algorithm that utilizes the structures of the MD-SC code to achieve lower decoding latency. Compared to the conventional SC codes, our MD-SC codes have a notably lower population of small cycles, and a dramatic BER improvement. The results of this work can be particularly beneficial in data storage systems, e.g., 2D magnetic recording and 3D Flash systems, as high-performance MD-SC codes are robust against various channel impairments and non-uniformity.
In this paper, we propose a non-uniform windowed decoder for multi-dimensional spatially-coupled LDPC (MD-SC-LDPC) codes over the binary erasure channel. An MD-SC-LDPC code is constructed by connecting together several SC-LDPC codes into one larger c
ode that provides major benefits over a variety of channel models. In general, SC codes allow for low-latency windowed decoding. While a standard windowed decoder can be naively applied, such an approach does not fully utilize the unique structure of MD-SC-LDPC codes. In this paper, we propose and analyze a novel non-uniform decoder to provide more flexibility between latency and reliability. Our theoretical derivations and empirical results show that our non-uniform decoder greatly improves upon the standard windowed decoder in terms of design flexibility, latency, and complexity.
Spatially coupled turbo-like codes (SC-TCs) have been shown to have excellent decoding thresholds due to the threshold saturation effect. Furthermore, even for moderate block lengths, simulation results demonstrate very good bit error rate performanc
e (BER) in the waterfall region. In this paper, we discuss the effect of spatial coupling on the performance of TCs in the finite block-length regime. We investigate the effect of coupling on the error-floor performance of SC-TCs by establishing conditions under which spatial coupling either preserves or improves the minimum distance of TCs. This allows us to investigate the error-floor performance of SC-TCs by performing a weight enumerator function (WEF) analysis of the corresponding uncoupled ensembles. While uncoupled TC ensembles with close-to-capacity performance exhibit a high error floor, our results show that SC-TCs can simultaneously approach capacity and achieve very low error floor.
As a typical example of bandwidth-efficient techniques, bit-interleaved coded modulation with iterative decoding (BICM-ID) provides desirable spectral efficiencies in various wireless communication scenarios. In this paper, we carry out a comprehensi
ve investigation on tail-biting (TB) spatially coupled protograph (SCP) low-density parity-check (LDPC) codes in BICM-ID systems. Specifically, we first develop a two-step design method to formulate a novel type of constellation mappers, referred to as labeling-bit-partial-match (LBPM) constellation mappers, for SC-P-based BICM-ID systems. The LBPM constellation mappers can be seamlessly combined with high-order modulations, such as M-ary phase-shift keying (PSK) and M-ary quadrature amplitude modulation (QAM). Furthermore, we conceive a new bit-level interleaving scheme, referred to as variable node matched mapping (VNMM) scheme, which can substantially exploit the structure feature of SC-P codes and the unequal protection-degree property of labeling bits to trigger the wave-like convergence for TB-SC-P codes. In addition, we propose a hierarchical extrinsic information transfer (EXIT) algorithm to predict the convergence performance (i.e., decoding thresholds) of the proposed SC-P-based BICM-ID systems. Theoretical analyses and simulation results illustrate that the LBPM-mapped SC-P-based BICM-ID systems are remarkably superior to the state-of-the-art mapped counterparts. Moreover, the proposed SC-P-based BICM-ID systems can achieve even better error performance with the aid of the VNMM scheme. As a consequence, the proposed LBPM constellation mappers and VNMM scheme make the SC-P-based BICM-ID systems a favorable choice for the future-generation wireless communication systems.
Although millimeter wave (mmWave) systems promise to offer larger bandwidth and unprecedented peak data rates, their practical implementation faces several hardware challenges compared to sub-6 GHz communication systems. These hardware constraints ca
n seriously undermine the performance and deployment progress of mmWave systems and, thus, necessitate disruptive solutions in the cross-design of analog and digital modules. In this article, we discuss the importance of different hardware constraints and propose a novel system architecture, which is able to release these hardware constraints while achieving better performance for future millimeter wave communication systems. The characteristics of the proposed architecture are articulated in detail, and a representative example is provided to demonstrate its validity and efficacy.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
