Nested Tail-Biting Convolutional Codes Construction for Short Packet Communications
نویسندگان
چکیده
منابع مشابه
On the Performance of Short Tail-Biting Convolutional Codes for Ultra-Reliable Communications
Motivated by the increasing interest in powerful short channel codes for low-latency ultra-reliable communications, we analyze the performance of tail-biting convolutional codes with different memories, block lengths and code rates over the additive white Gaussian noise channel. The analysis is carried out both through Monte Carlo simulations and by upper bounding the error probability via Polt...
متن کاملTwo-Dimensional Tail-Biting Convolutional Codes
The multidimensional convolutional codes are an extension of the notion of convolutional codes (CCs) to several dimensions of time. This paper explores the class of twodimensional convolutional codes (2D CCs) and 2D tail-biting convolutional codes (2D TBCCs ), in particular, from several aspects. First, we derive several basic algebraic properties of these codes, applying algebraic methods in o...
متن کاملCharacteristic Matrices and Trellis Reduction for Tail-Biting Convolutional Codes
Basic properties of a characteristic matrix for a tail-biting convolutional code are investigated. A tail-biting convolutional code can be regarded as a linear block code. Since the corresponding scalar generator matrix G has a kind of cyclic structure, an associated characteristic matrix also has a cyclic structure, from which basic properties of a characteristic matrix are obtained. Next, usi...
متن کاملAlgebraic Construction of Tail-Biting Trellises for Linear Block Codes
In this paper, we present an algebraic construction of tail-biting trellises. The proposed method is based on the state space expressions, i.e., the state space is the image of the set of information sequences under the associated state matrix. Then combining with the homomorphism theorem, an algebraic trellis construction is obtained. We show that a tailbiting trellis constructed based on the ...
متن کاملA Coset Construction for Tail-Biting Trellises
A coset construction is presented for tail-biting trellises which for a given linear block code C computes a non-mergeable linear trellis representing C. This construction is analogous to the Forney construction for minimal conventional trellises. Unlike the case of conventional trellises where the Forney construction and the Kschischang-Sorokine (KS) product construction give isomorphic trelli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Radioengineering
سال: 2021
ISSN: ['1805-9600', '1210-2512']
DOI: https://doi.org/10.13164/re.2021.0540