scholarly journals POLYPARAMETRIC BLOCK CODING

2021 ◽  
Vol 11 (1) ◽  
pp. 50-53
Author(s):  
Julia Milova ◽  
Yuri Melnik
Keyword(s):  
Parametric Method ◽  
Block Code ◽  
Number System ◽  
Block Codes ◽  
Information Coding ◽  
Natural Sequence ◽  
Code Combination ◽  
Channel Errors ◽  
The Given ◽  
Vector Shift

The principles of poly-parametric information coding have been considered. The methods for developing poly-parametric codes have been presented. It is shown that the protection of block codes from channel interference using check patterns can be developed by a mono- or poly-parametric method. A special type of block codes has been presented, the check patterns of which are formed on the basis of their neighbours, which are functionally related to the given code combination. Such codes have been called poly-parametric. Binary poly-parametric ring codes, the check patterns of which are designed to detect and correct channel errors, are developed using the properties of Galois fields and on the basis of the vector shift indicators of the codewords. To obtain digital poly-parametric block codes, the properties and features of the normalized natural sequence are used. It is shown that each codeword of a binary block code can be represented as a certain positive integer in the decimal number system, which is an element of the natural sequence. Its elements on an interval that equals the norm acquire a functional dependency.

Study on Quasi-Orthogonal Space Time Block Code Based on Amplify-and-Forward Relay Networks

2012 ◽  
Vol 433-440 ◽  
pp. 6014-6018
Author(s):  
Xue Yi Zhang ◽  
Jie Sun
Keyword(s):  
Relay Networks ◽  
Block Code ◽  
Space Time ◽  
Time Block ◽  
Amplify And Forward ◽  
Decoding Algorithm ◽  
Space Time Block Code ◽  
Orthogonal Space ◽  
Orthogonal Code ◽  
The Given

A kind of quasi-orthogonal space time block code for amplify-and-forward relay networks is analyzed in this paper. At the source, 4 single-antenna users transmit the quasi-orthogonal space time block code matrix. At the relay node, fast maximum-likelihood decoding algorithm is adopted and the decoded symbols are then encoded into quasi-orthogonal code which is transmitted through transmit antenna. At the destination, pair-wise decoding algorithm is utilized. Finally we compare the performance of the quasi-orthogonal space time block code in relay networks with that of the quasi-orthogonal space time block code in traditional communication system. Simulation results show that at the given BER of 10-3, the new code can provide about gain of 4dB and 1 dB comparing with that for the traditional quasi-orthogonal code, respectively. And at the given BER of 10-5, the new code can provide about gain of 4.6dB and 2.6dB comparing with that for the old quasi-orthogonal code, respectively.

Performance Evaluation of Full Diversity QOSTBC MIMO Systems with Multiple Receive Antenna

2013 ◽  
pp. 274-284
Author(s):  
Hardip K. Shah ◽  
Tejal N. Parmar ◽  
Nikhil Kothari ◽  
K. S. Dasgupta
Keyword(s):  
Communication Systems ◽  
Mimo Systems ◽  
Block Code ◽  
Block Codes ◽  
Space Time ◽  
Least Square ◽  
Time Block ◽  
Space Time Block Codes ◽  
Full Diversity ◽  
Full Rate

Multipath fading is inherent in wireless communication systems. Diversity is the technique which takes advantage of multipath to mitigate the effect of fading and increase signal strength. Space Time Block codes (STBC) are used in MIMO systems to improve the performance by maximizing transmit and/or receive diversity. Among different schemes based on STBC, Quasi Orthogonal Space Time Block Code (QOSTBC) is able to achieve full rate transmission for more than two transmit antennas. Constellation Rotation QOSTBC (CR-QOSTBC) achieves full diversity and improves performance further along with full rate, to overcome the limitation of QOSTBC, which is unable to maintain orthogonality amongst the codes transmitted by different antennas. Higher diversity can be achieved by increasing uncorrelated paths between transmitter and receivers using higher number of receive antennas. This paper examines improvement in BER with reference to a number of receive antennas. Simulations were carried out under ideal as well as realistic environments, using least square technique with four antennas at transmitter side and variable receive antennas. Results of simulations presented in this paper indicate performance improvement of CR-QOSTBC over QOSTBC in flat fading channel environment. Simulation results also show performance degradation in BER when channel is estimated at the receiver.

MODIFIED MODULUS PROJECTION ALGORITHM FOR ERROR CONTROL IN REDUNDANT RESIDUE NUMBER SYSTEM CODE

2017 ◽  
Vol 15 (1) ◽  
pp. 130-142
Author(s):  
K A AMUSA ◽  
O O NUGA
Keyword(s):  
Error Control ◽  
Recovery Process ◽  
Number System ◽  
Residue Number System ◽  
Block Codes ◽  
Projection Algorithm ◽  
Speed Up ◽  
Redundant Residue Number System ◽  
Error Detecting ◽  
Maximum Minimum

This paper presents a modified modulus projection algorithm for decoding Redundant Residue Num-ber System (RRNS) codes. RRNS code is maximum-minimum distance block codes. RRNS has found wider applications in the field of signal processing especially for error control. The essence of this modification is to reduce the required computation overhead and speed up operation. The proposed method involves conversion of received residues into mixed radix form. Based on the error detecting capability of RRNS code under study, moduli projection is carried out iteratively to determine the corre-sponding integers. The proposed algorithm considerably reduces the number of required iterations involved in the recovery process, therefore improving the speed of decoding operation.

scholarly journals Joint IA and SFBC Macrocells and Small-Cells Coexistence under Minor Information Exchange

2016 ◽  
Vol 2016 ◽  
pp. 1-10
Author(s):  
Syed Saqlain Ali ◽  
Daniel Castanheira ◽  
Adão Silva ◽  
Atílio Gameiro
Keyword(s):  
Information Exchange ◽  
Current Trend ◽  
Interference Alignment ◽  
Block Code ◽  
Cell Types ◽  
Block Codes ◽  
Base Station ◽  
System Capacity ◽  
Small Cells ◽  
Space Frequency

The deployment of small-cells within the boundaries of a macrocell is considered to be an effective solution to cope with the current trend of higher data rates and improved system capacity. In the current heterogeneous configuration with the mass deployment of small-cells, it is preferred that these two cell types will coexist over the same spectrum, because acquiring additional spectrum licenses for small-cells is difficult and expensive. However, the coexistence leads to cross-tier/intersystem interference. In this context, this contribution investigates interference alignment (IA) methods in order to mitigate the interference of macrocell base station towards the small-cell user terminals. More specifically, we design a diversity-oriented interference alignment scheme with space-frequency block codes (SFBCs). The main motivation for joint interference alignment with SFBC is to allow the coexistence of two systems under minor intersystem information exchange. The small-cells just need to know what space-frequency block code is used by the macrocell system and no intersystem channels need to be exchanged, contrarily to other schemes recently proposed. Numerical results show that the proposed method achieves a performance close to the case where full cooperation between the tiers is allowed.

scholarly journals Synchronized Motion Profiles for Inverse-Dynamics-Based Online Control of Three Inextensible Segments of Trunk-Type Robot Actuators

2021 ◽  
Vol 11 (7) ◽  
pp. 2946
Author(s):  
Mindaugas Matukaitis ◽  
Renaldas Urniezius ◽  
Deividas Masaitis ◽  
Lukas Zlatkus ◽  
Benas Kemesis ◽  
...  
Keyword(s):  
Spatial Orientation ◽  
Inverse Kinematics ◽  
Inverse Dynamics ◽  
Parametric Method ◽  
Black Box ◽  
Soft Constraint ◽  
Numeric Simulation ◽  
Novel Method ◽  
The Given ◽  
State Configuration

This study proposes a novel method for the positioning and spatial orientation control of three inextensible segments of trunk-type robots. The suggested algorithm imposes a soft constraint assumption for the end-effector’s endpoint and a mandatory constraint on its direction. Simultaneously, the algorithm by-design enforces nonholonomic features on the robot segments in the form of arcs. An approximate robot spine curve is the key to the final robot state configuration based on the given conditions. The numeric simulation showed acceptable (less than 1 s) performance for single-core processing tasks. The parametric method finds the best proximate robot state solution and represents the gray box model in addition to existing learning or black-box inverse dynamics approaches. This study also shows that a multiple inverse kinematics answer constructs a single inverse dynamics solution that defines the robot actuators’ motion profiles, synchronized in time. Finally, this text presents rotational expressions and their outlines for controlling the manipulator’s tendons.

scholarly journals Construction method of space-time code in MIMO-VLC system

2021 ◽  
Vol 336 ◽  
pp. 04017
Author(s):  
Chengnan Sun
Keyword(s):  
Visible Light ◽  
Mimo System ◽  
Visible Light Communication ◽  
Block Code ◽  
Block Codes ◽  
Space Time ◽  
Design Criterion ◽  
Time Block ◽  
Space Time Block Code ◽  
Space Time Block Codes

In the recent years, the design of any order of space-time block code did not appear in the previous. In this paper, we investigate the criterion that how to design the space-time block code in Multiple input multiple output(MIMO) visible light communication(VLC) system. Based on the second order space-time block code, we give the design criterion of space-time block code of arbitrary order. Then we discuss the space-time block difference between traditional MIMO system and optical system. It is found that the space-time block codes of visible light system can be modified by the traditional space-time block codes and it can also realize independent decoding at the receiving end. In addition, in the receiver, how to realize fast calculation of the estimated value of the transmitted signal and a unified independent decoding scheme is presented.

scholarly journals Subsystems, Perron numbers, and continuous homomorphisms of Bernoulli shifts

1989 ◽  
Vol 9 (3) ◽  
pp. 561-570 ◽  
Author(s):  
Selim Tuncel
Keyword(s):  
Finite Type ◽  
Bernoulli Shift ◽  
Block Code ◽  
Block Codes ◽  
Probability Vector ◽  
Finiteness Conditions ◽  
Subshift Of Finite Type ◽  
Bernoulli Shifts ◽  
Subshifts Of Finite Type ◽  
Markov Measures

AbstractLet S, T be subshifts of finite type, with Markov measures p, q on them, and let φ: (S, p) → (T, q) be a block code. Let Ip, Iq denote the information cocycles of p, q. For a subshift of finite type ⊂T, the pressure of equals that of . Applying this to Bernoulli shifts and using finiteness conditions on Perron numbers, we have the following. If the probability vector p = (p1…, pk+1) is such that the distinct transcendental elements of {p1/pk+1…pk/pk+1) are algebraically independent then the Bernoulli shift B(p) has finitely many Bernoulli images by block codes.

scholarly journals Soft Decision Fano Decoding of Block Codes Over Discrete Memoryless Channel Using Tree Diagram

2012 ◽  
Vol 63 (1) ◽  
pp. 59-64 ◽  
Author(s):  
H. Kumar ◽  
Udupi Sripati ◽  
K. Shetty ◽  
B. Shankarananda
Keyword(s):  
Block Code ◽  
Low Complexity ◽  
Block Codes ◽  
Tree Structure ◽  
Soft Decision ◽  
Error Performance ◽  
Tree Construction ◽  
Tree Diagram ◽  
Minimum Number ◽  
Metric Function

Soft Decision Fano Decoding of Block Codes Over Discrete Memoryless Channel Using Tree DiagramA novel low complexity soft decision technique which allows the decoding of block codes with tree structure is proposed. These codes are shown to have a convenient tree structure that allows Fano decoding techniques to be used to decode them. The Fano algorithm searches through the tree structure of the block code for a path which has the optimal value of the Fano metric function. When a new candidate codeword is found, an optimality check is performed on it by using the threshold. If checked successfully, the candidate codeword is the most likely codeword and the search stops. The basic idea of this approach is to achieve a good error performance progressively in a minimum number of steps. For each decoding step, the error performance is tightly bounded and the decoding is terminated at the stage where either optimum or near optimum error performance is achieved. As a result, more flexibility in the trade off between performance and decoding complexity is provided. Some examples of the tree construction and the soft decision Fano decoding procedure are discussed.

Sign in / Sign up

Export Citation Format

Share Document