9 research outputs found
Binomial Number System
This paper presents and first scientifically substantiates the generalized theory of binomial number systems (BNS) and the method of their formation for reliable digital signal processing (DSP), transmission, and data storage. The method is obtained based on the general theory of positional number systems (PNS) with conditions and number functions for converting BNS with a binary alphabet, also allowing to generate matrix BNS, linear-cyclic, and multivalued number systems. Generated by BNS, binomial numbers possess the error detection property. A characteristic property of binomial numbers is the ability, on their basis, to form various combinatorial configurations based on the binomial coefficients, e.g., compositions or constant-weight (CW) codes. The theory of positional binary BNS construction and generation of binary binomial numbers are proposed. The basic properties and possible areas of application of BNS researched, particularly for the formation and numbering of combinatorial objects, are indicated. The CW binomial code is designed based
on binary binomial numbers with variable code lengths. BNS is efficiently used to develop error detection digital devices and has the property of compressing information
FPGA-Implemented Fractal Decoder with Forward Error Correction in Short-Reach Optical Interconnects
Forward error correction (FEC) codes combined with high-order modulator formats, i.e., coded modulation (CM), are essential in optical communication networks to achieve highly efficient and reliable communication. The task of providing additional error control in the design of CM systems with high-performance requirements remains urgent. As an additional control of CM systems, we propose to use indivisible error detection codes based on a positional number system. In this work, we evaluated the indivisible code using the average probability method (APM) for the binary symmetric channel (BSC), which has the simplicity, versatility and reliability of the estimate, which is close to reality. The APM allows for evaluation and compares indivisible codes according to parameters of correct transmission, and detectable and undetectable errors. Indivisible codes allow for the end-to-end (E2E) control of the transmission and processing of information in digital systems and design devices with a regular structure and high speed. This study researched a fractal decoder device for additional error control, implemented in field-programmable gate array (FPGA) software with FEC for short-reach optical interconnects with multilevel pulse amplitude (PAM-M) modulated with Gray code mapping. Indivisible codes with natural redundancy require far fewer hardware costs to develop and implement encoding and decoding devices with a sufficiently high error detection efficiency. We achieved a reduction in hardware costs for a fractal decoder by using the fractal property of the indivisible code from 10% to 30% for different n while receiving the reciprocal of the golden ratio
Estimating the indivisible error detecting Ρodes based on an average probability method
Given the need to improve the efficiency of data transfer, there are requirements to ensure their reliability and quality under interference. One way to improve data transfer efficiency is to use noise-resistant codes,
which include a closed-form expression of the Fibonacci code, a parity check code, and
a constant weight code. The result of applying these types of coding produces interference-resistant end-to-end processing and transmission of information, which is a promising approach to improving the efficiency of
telecommunications systems in today's environment. This paper reports the estimation of the error detecting code capability of the Fibonacci code in a closed-form expression, as well as its comparative characteristic with
a parity check code and a constant weight code for a binary symmetrical channel without memory. To assess an error detecting capability of the Fibonacci code in a closed-form expression, the probability of Fibonacci code
combinations moving to the proper, allowable, and prohibited classes has been determined.
The comparative characteristic of the indivisible error-detecting codes is based on an average probability method, for the criterion of an undetectable error probability, employing the MATLAB and Python software. The method has demonstrated the simplicity, versatility, and reliability of estimation, which is close to
reality. The probability of an undetectable error in the Fibonacci code in a closed-form expression is V=5Γ10-7; in a code with parity check, V=7.7Γ10-15; and in a constant weight code, V=1.9Γ10-15, at p10=3Γ10-9. The use of the average probability method makes it possible to effectively use indivisible codes for detecting
errors in telecommunications systems
Relation between the petrographic and chemical properties of weakly reduced and reduced coals of donets basin
Low-rank coals of the same rank level but of different genetic types and different tendency to self-ignition have been studied by means of coal chemistry. It has been shown that oxygen- and sulphur-containing functional groups, especially bridge-bonds, are responsible for the structure and properties of pyrolysis products
Estimating the Indivisible Error Detecting Π‘odes Based on an Average Probability Method
Given the need to improve the efficiency of data transfer, there are requirements to ensure their reliability and quality under interference. One way to improve data transfer efficiency is to use noise-resistant codes, which include a closed-form expression of the Fibonacci code, a parity code, and a permanent weight code. The result of applying these types of coding produces interference-resistant end-to-end processing and transmission of information, which is a promising approach to improving the efficiency of telecommunications systems in today's environment. This paper reports the estimation of the error detecting code capability of the Fibonacci code in a closed-form expression, as well as its comparative characteristic with a parity code and a permanent weight code for a binary symmetrical channel without memory. To assess an error detecting capability of the Fibonacci code in a closed-form expression, the probability of Fibonacci code combinations moving to the proper, allowable, and prohibited classes has been determined. The comparative characteristic of the indivisible error-detecting codes is based on an average probability method, for the criterion of an undetectable error probability, employing the MATLAB and Python software. The method has demonstrated the simplicity, versatility, and reliability of estimation, which is close to reality. The probability of an undetectable error in the Fibonacci code in a closed-form expression is V=5Γ10-7; in a code with parity check, V=7.7Γ10-15; and in a permanent weight code, V=1.9Γ10-15, at p10=3Γ10- 9. The use of the average probability method makes it possible to effectively use indivisible codes for detecting errors in telecommunications system