Journal articles: 'Binary bch block code'

1

Baldi, Marco, and Franco Chiaraluce. "A Simple Scheme for Belief Propagation Decoding of BCH and RS Codes in Multimedia Transmissions." International Journal of Digital Multimedia Broadcasting 2008 (2008): 1–12. http://dx.doi.org/10.1155/2008/957846.

Full text

Abstract:

Classic linear block codes, like Bose-Chaudhuri-Hocquenghem (BCH) and Reed-Solomon (RS) codes, are widely used in multimedia transmissions, but their soft-decision decoding still represents an open issue. Among the several approaches proposed for this purpose, an important role is played by the iterative belief propagation principle, whose application to low-density parity-check (LDPC) codes permits to approach the channel capacity. In this paper, we elaborate a new technique for decoding classic binary and nonbinary codes through the belief propagation algorithm. We focus on RS codes included in the recent CDMA2000 standard, and compare the proposed technique with the adaptive belief propagation approach, that is able to ensure very good performance but with higher complexity. Moreover, we consider the case of long BCH codes included in the DVB-S2 standard, for which we show that the usage of “pure” LDPC codes would provide better performance.

APA, Harvard, Vancouver, ISO, and other styles

2

Saravanakumar, N., K. Sakthi Sudhan, K. N. Vijeyakumar, and S. Saranya. "Design and Implementation of Reduced Power Energy Efficient Binary Coded Decimal Adder." International Journal of Reconfigurable and Embedded Systems (IJRES) 8, no. 3 (November 1, 2019): 185. http://dx.doi.org/10.11591/ijres.v8.i3.pp185-193.

Full text

Abstract:

<p>This paper presents a novel architecture for low power energy binary represented decimal addition. The proposed BCD adder uses Binary to Excess Six Converter (BESC) block for constant correction to adjusts binary outputs exceeding 9 to correct decimal values and exploits the inherent advantage of reduced delay and switching, due to elimination of long carry propagation in second stage addition as in conventional design and switching OFF of the BESC block for decimal outputs less than 9. The proposed BESC-BCD adder has been designed using VHDL code and synthesized using Altera Quartus II. Experimental results demonstrates that the proposed decimal adder can lead to significant power savings and delay reduction compared to existing BCD adders which is realised in better power-delay product(PDP) performance. For example the PDP saving of the proposed BESC-BCD adder for a 1 digit and 2 digit addition implementations are 11.6% and 16.05% respectively, compared to the best of the designs used for comparison.</p>

APA, Harvard, Vancouver, ISO, and other styles

3

SHAH, TARIQ, MUBASHAR KHAN, and ANTONIO A. DE ANDRADE. "A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code." Anais da Academia Brasileira de Ciências 85, no. 3 (September 2013): 863–72. http://dx.doi.org/10.1590/s0001-37652013000300002.

Full text

Abstract:

For a given binary BCH code Cn of length n = 2 s - 1 generated by a polynomial of degree r there is no binary BCH code of length (n + 1)n generated by a generalized polynomial of degree 2r. However, it does exist a binary cyclic code C (n+1)n of length (n + 1)n such that the binary BCH code Cn is embedded in C (n+1)n . Accordingly a high code rate is attained through a binary cyclic code C (n+1)n for a binary BCH code Cn . Furthermore, an algorithm proposed facilitates in a decoding of a binary BCH code Cn through the decoding of a binary cyclic code C (n+1)n , while the codes Cn and C (n+1)n have the same minimum hamming distance.

APA, Harvard, Vancouver, ISO, and other styles

4

Wang, Jiafeng, Yang Yue, and Jun Yao. "Statistical Recognition Method of Binary BCH Code." Communications and Network 03, no. 01 (2011): 17–22. http://dx.doi.org/10.4236/cn.2011.31003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Ansari, A. S., T. Shah, Zia Ur-Rahman, and Antonio A. Andrade. "Sequences of Primitive and Non-primitive BCH Codes." TEMA (São Carlos) 19, no. 2 (September 12, 2018): 369. http://dx.doi.org/10.5540/tema.2018.019.02.369.

Full text

Abstract:

In this work, we introduce a method by which it is established that; how a sequence of non-primitive BCH codes can be obtained by a given primitive BCH code. For this, we rush to the out of routine assembling technique of BCH codes and use the structure of monoid rings instead of polynomial rings. Accordingly, it is gotten that there is a sequence $\{C_{b^{j}n}\}_{1\leq j\leq m}$, where $b^{j}n$ is the length of $C_{b^{j}n}$, of non-primitive binary BCH codes against a given binary BCH code $C_{n}$ of length $n$. Matlab based simulated algorithms for encoding and decoding for these type of codes are introduced. Matlab provides built in routines for construction of a primitive BCH code, but impose several constraints, like degree $s$ of primitive irreducible polynomial should be less than $16$. This work focuses on non-primitive irreducible polynomials having degree $bs$, which go far more than 16.

APA, Harvard, Vancouver, ISO, and other styles

6

Башкиров, А. В., И. В. Свиридова, М. В. Хорошайлова, and О. В. Свиридова. "STOCHASTIC DECODING OF LINEAR BLOCK CODES USING CHECK MATRIX." ВЕСТНИК ВОРОНЕЖСКОГО ГОСУДАРСТВЕННОГО ТЕХНИЧЕСКОГО УНИВЕРСИТЕТА, no. 6 (January 10, 2021): 79–84. http://dx.doi.org/10.36622/vstu.2020.16.6.011.

Full text

Abstract:

Для итеративного декодирования на графах используется новый альтернативный подход - это стохастическое декодирование. Возможность стохастического декодирования была недавно предложена для декодирования LDPC-кодов. Эта статья расширяет применение стохастического подхода для декодирования линейных блочных кодов с помощью проверочных матриц (PCM), таких как коды Боуза - Чоудхури - Хоквингема (BCH), коды Рида - Соломона (RS) и блочные турбокоды на основе компонентов кодов BCH. Показано, как стохастический подход способен генерировать информацию мягкого выхода для итеративного декодирования с мягким входом и мягким выходом Soft - Input Soft - Output (SISO). Описывается структура стохастических переменных узлов высокой степени, используемых в кодах с помощью проверочных матриц PCM. Результаты моделирования для кода BCH (128, 120), кода RS (31, 25) и RS (63, 55) и турбокода блока BCH (256, 121) и (1024, 676) демонстрируют эффективность декодирования при закрытии к итеративному декодеру SISO с реализацией с плавающей запятой. Эти результаты показывают производительность декодирования, близкую к адаптивному алгоритму распространения доверия и/или турбо-ориентированному адаптированному алгоритму распространения доверия Stochastic decoding capability has recently been proposed for decoding LDPC codes. This paper expands on the application of the stochastic approach to decoding linear block codes using parity check matrices (PCMs) such as Bose-Chowdhury-Hawkingham (BCH) codes, Reed-Solomon (RS) codes, and BCH component-based block turbo codes. We show how the stochastic approach is able to generate soft-output information for iterative decoding with soft-input and soft-output Soft-Input Soft-Output (SISO). We describe the structure of high degree stochastic node variables used in codes using PCM parity check matrices. Simulation results for BCH code (128, 120), RS code (31, 25) and RS (63, 55), and BCH block turbo code (256, 121) and (1024, 676) demonstrate the decoding efficiency on close to SISO iterative decoder with floating point implementation. These results show decoding performance close to the adaptive trust propagation algorithm and / or turbo-oriented adapted trust propagation algorithm

APA, Harvard, Vancouver, ISO, and other styles

7

Janosov, Martin, Martin Husak, Peter Farkas, and Ana Garcia Armada. "New $[47,15,16]$ Linear Binary Block Code." IEEE Transactions on Information Theory 54, no. 1 (January 2008): 423–24. http://dx.doi.org/10.1109/tit.2007.909110.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Zhou, Jing, and Zhiping Huang. "Blind Recognition of Binary BCH Codes for Cognitive Radios." Mathematical Problems in Engineering 2016 (2016): 1–6. http://dx.doi.org/10.1155/2016/3013504.

Full text

Abstract:

A novel algorithm of blind recognition of Bose-Chaudhuri-Hocquenghem (BCH) codes is proposed to solve the problem of Adaptive Coding and Modulation (ACM) in cognitive radio systems. The recognition algorithm is based on soft decision situations. The code length is firstly estimated by comparing the Log-Likelihood Ratios (LLRs) of the syndromes, which are obtained according to the minimum binary parity check matrixes of different primitive polynomials. After that, by comparing the LLRs of different minimum polynomials, the code roots and generator polynomial are reconstructed. When comparing with some previous approaches, our algorithm yields better performance even on very low Signal-Noise-Ratios (SNRs) with lower calculation complexity. Simulation results show the efficiency of the proposed algorithm.

APA, Harvard, Vancouver, ISO, and other styles

9

Kushnerov, Alexander V., and Valery A. Lipnitski. "Generic BCH codes. Polynomial-norm error decoding." Journal of the Belarusian State University. Mathematics and Informatics, no. 2 (July 30, 2020): 36–48. http://dx.doi.org/10.33581/2520-6508-2020-2-36-48.

Full text

Abstract:

The classic Bose – Chaudhuri – Hocquenghem (BCH) codes is famous and well-studied part in the theory of error-correcting codes. Generalization of BCH codes allows us to expand the range of activities in the practical correction of errors. Some generic BCH codes are able to correct more errors than classic BCH code in one message block. So it is important to provide appropriate method of error correction. After our investigation it was found that polynomial-norm method is most convenient and effective for that task. The result of the study was a model of a polynomial-norm decoder for a generic BCH code at length 65.

APA, Harvard, Vancouver, ISO, and other styles

10

Riley, Jeff, Ilya Mandel, Pablo Marchant, Ellen Butler, Kaila Nathaniel, Coenraad Neijssel, Spencer Shortt, and Alejandro Vigna-Gómez. "Chemically homogeneous evolution: a rapid population synthesis approach." Monthly Notices of the Royal Astronomical Society 505, no. 1 (May 11, 2021): 663–76. http://dx.doi.org/10.1093/mnras/stab1291.

Full text

Abstract:

ABSTRACT We explore chemically homogeneous evolution (CHE) as a formation channel for massive merging binary black holes (BBHs). We develop methods to include CHE in a rapid binary population synthesis code, Compact Object Mergers: Population Astrophysics and Statistics (compas), which combines realistic models of binary evolution with cosmological models of the star formation history of the Universe. For the first time, we simultaneously explore conventional isolated binary star evolution under the same set of assumptions. This approach allows us to constrain population properties and make simultaneous predictions about the gravitational-wave detection rates of BBH mergers for the CHE and conventional formation channels. The overall mass distribution of detectable BBHs is consistent with existing gravitational-wave observations. We find that the CHE channel may yield up to ${\sim} 70{{\ \rm per\ cent}}$ of all gravitational-wave detections of BBH mergers coming from isolated binary evolution.

APA, Harvard, Vancouver, ISO, and other styles

11

Szilágyi, Béla. "Key elements of robustness in binary black hole evolutions using spectral methods." International Journal of Modern Physics D 23, no. 07 (June 2014): 1430014. http://dx.doi.org/10.1142/s0218271814300146.

Full text

Abstract:

As a network of advanced-era gravitational wave detectors is nearing its design sensitivity, efficient and accurate waveform modeling becomes more and more relevant. Understanding of the nature of the signal being sought can have an order unity effect on the event rates seen in these instruments. The paper provides a description of key elements of the Spectral Einstein Code (SpEC), with details of our spectral adaptive mesh refinement (AMR) algorithm that has been optimized for binary black hole (BBH) evolutions. We expect that the gravitational waveform catalog produced by our code will have a central importance in both the detection and parameter estimation of gravitational waves in these instruments.

APA, Harvard, Vancouver, ISO, and other styles

12

EL GOURI, Rachid, Wassima Ait Ahmed, Ahmed Lichioui, and Laamari Hlou. "Conception and Implementation of a BCH Code on a FPGA Board." International Journal of Engineering & Technology 2, no. 4 (November 28, 2013): 293. http://dx.doi.org/10.14419/ijet.v2i4.1430.

Full text

Abstract:

In this paper we have designed and implemented a BCH (15, 7, 5) encoder on FPGA using VHDL description language and we implanted it on an FPGA Spartan 3E Starter board. The digital logic implementation of binary encoding of multiple error correcting BCH code of length n=15 is organized into shift register circuits. Multiple characteristics of cyclic codes will be discussed further on. The results of the simulation and implementation using Xilinx ISE.12.1 software and the LCD screen on the FPGAs Board will be shown at last.

APA, Harvard, Vancouver, ISO, and other styles

13

Fizel, Peter, and Peter Farkaš. "New $[52, 18, 16]$ Linear Binary Block Code." IEEE Transactions on Information Theory 57, no. 4 (April 2011): 2252–53. http://dx.doi.org/10.1109/tit.2010.2096496.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Nasim, Imran Tariq, Alessia Gualandris, Justin I. Read, Fabio Antonini, Walter Dehnen, and Maxime Delorme. "Formation of the largest galactic cores through binary scouring and gravitational wave recoil." Monthly Notices of the Royal Astronomical Society 502, no. 4 (February 15, 2021): 4794–814. http://dx.doi.org/10.1093/mnras/stab435.

Full text

Abstract:

ABSTRACT Massive elliptical galaxies are typically observed to have central cores in their projected radial light profiles. Such cores have long been thought to form through ‘binary scouring’ as supermassive black holes (SMBHs), brought in through mergers, form a hard binary and eject stars from the galactic centre. However, the most massive cores, like the $\sim 3{\, \mathrm{kpc}}$ core in A2261-BCG, remain challenging to explain in this way. In this paper, we run a suite of dry galaxy merger simulations to explore three different scenarios for central core formation in massive elliptical galaxies: ‘binary scouring’, ‘tidal deposition’, and ‘gravitational wave (GW) induced recoil’. Using the griffin code, we self-consistently model the stars, dark matter, and SMBHs in our merging galaxies, following the SMBH dynamics through to the formation of a hard binary. We find that we can only explain the large surface brightness core of A2261-BCG with a combination of a major merger that produces a small $\sim 1{\, \mathrm{kpc}}$ core through binary scouring, followed by the subsequent GW recoil of its SMBH that acts to grow the core size. Key predictions of this scenario are an offset SMBH surrounded by a compact cluster of bound stars and a non-divergent central density profile. We show that the bright ‘knots’ observed in the core region of A2261-BCG are best explained as stalled perturbers resulting from minor mergers, though the brightest may also represent ejected SMBHs surrounded by a stellar cloak of bound stars.

APA, Harvard, Vancouver, ISO, and other styles

15

Changshik Shim and Habong Chung. "On the second generalized Hamming weight of the dual code of a double-error-correcting binary BCH code." IEEE Transactions on Information Theory 41, no. 3 (May 1995): 805–8. http://dx.doi.org/10.1109/18.382030.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Alaoui, My Seddiq El Kasmi, and Said Nouh. "Decoding Algorithm by Cooperation Between Hartmann Rudolph Algorithm and a Decoder Based on Syndrome and Hash." International Journal of Natural Computing Research 10, no. 1 (January 2021): 15–27. http://dx.doi.org/10.4018/ijncr.2021010102.

Full text

Abstract:

In this paper, the authors present a concatenation of Hartmann and Rudolph (HR) partially exploited and a decoder based on hash techniques and syndrome calculation to decode linear block codes. This work consists firstly to use the HR with a reduced number of codewords of the dual code then the HWDec which exploits the output of the HR partially exploited. Researchers have applied the proposed decoder to decode some Bose, Chaudhuri, and Hocquenghem (BCH) and quadratic residue (QR) codes. The simulation and comparison results show that the proposed decoder guarantees very good performances, compared to several competitors, with a much-reduced number of codewords of the dual code. For example, for the BCH(31, 16, 7) code, the good results found are based only on 3.66% of the all codewords of the dual code space, for the same code the reduction rate of the run time varies between 78% and 90% comparing to the use of Hartmann and Rudolph alone. This shows the efficiency, the rapidity, and the reduction of the memory space necessary for the proposed concatenation.

APA, Harvard, Vancouver, ISO, and other styles

17

Zhilin, Igor, Victor Zyablov, and Dmitry Zigangirov. "A binary block concatenated code based on two convolutional codes." Electronic Notes in Discrete Mathematics 57 (March 2017): 219–24. http://dx.doi.org/10.1016/j.endm.2017.02.036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Kohnert, A. "Linear binary block code with prescribed minimum and maximum weight." Electronics Letters 49, no. 8 (April 2013): 541–43. http://dx.doi.org/10.1049/el.2012.4232.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Ahmed, Arshee, Haroon Rasheed, and Madhusanka Liyanage. "Millimeter-Wave Channel Modeling in a Vehicular Ad-Hoc Network Using Bose–Chaudhuri–Hocquenghem (BCH) Code." Electronics 10, no. 9 (April 21, 2021): 992. http://dx.doi.org/10.3390/electronics10090992.

Full text

Abstract:

The increase in capacity demand for vehicular communication is generating interest among researchers. The standard spectra allocated to VANET tend to be saturated and are no longer enough for real-time applications. Millimeter-wave is a potential candidate for VANET applications. However, millimeter-wave is susceptible to pathloss and fading, which degrade system performance. Beamforming, multi-input multi-output (MIMO) and diversity techniques are being employed to minimize throughput, reliability and data rate issues. This paper presents a tractable channel model for VANET in which system performance degradation due to error is addressed by concatenated Alamouti space-time block coding (ASTBC) and Bose–Chaudhuri–Hocquenghem (BCH) coding. Two closed-form approximations of bit error rate (BER), one for BCH in Rayleigh fading and the second for BCH with ASTBC, are derived. These expressions comprise SNR and code rate and can be utilized in designing VANET architectures. The results show that the BER using concatenated ASTBC and BCH outmatches the conventional BER ASTBC expression. The analytical results are compared with numerical results, thereby showing the accuracy of our closed-form expressions. The performance of the proposed expressions is evaluated using different code rates.

APA, Harvard, Vancouver, ISO, and other styles

20

Milova, Julia, and Yuri Melnik. "POLYPARAMETRIC BLOCK CODING." Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska 11, no. 1 (March 31, 2021): 50–53. http://dx.doi.org/10.35784/iapgos.2413.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

21

Yu, Zeping, Rui Cao, Qiyi Tang, Sen Nie, Junzhou Huang, and Shi Wu. "Order Matters: Semantic-Aware Neural Networks for Binary Code Similarity Detection." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 01 (April 3, 2020): 1145–52. http://dx.doi.org/10.1609/aaai.v34i01.5466.

Full text

Abstract:

Binary code similarity detection, whose goal is to detect similar binary functions without having access to the source code, is an essential task in computer security. Traditional methods usually use graph matching algorithms, which are slow and inaccurate. Recently, neural network-based approaches have made great achievements. A binary function is first represented as an control-flow graph (CFG) with manually selected block features, and then graph neural network (GNN) is adopted to compute the graph embedding. While these methods are effective and efficient, they could not capture enough semantic information of the binary code. In this paper we propose semantic-aware neural networks to extract the semantic information of the binary code. Specially, we use BERT to pre-train the binary code on one token-level task, one block-level task, and two graph-level tasks. Moreover, we find that the order of the CFG's nodes is important for graph similarity detection, so we adopt convolutional neural network (CNN) on adjacency matrices to extract the order information. We conduct experiments on two tasks with four datasets. The results demonstrate that our method outperforms the state-of-art models.

APA, Harvard, Vancouver, ISO, and other styles

22

Feltstrom, Alberto JimÉnez, Dmitri Truhachev, Michael Lentmaier, and Kamil Sh Zigangirov. "Braided Block Codes." IEEE Transactions on Information Theory 55, no. 6 (June 2009): 2640–58. http://dx.doi.org/10.1109/tit.2009.2018350.

Full text

Abstract:

A new class of binary iteratively decodable codes with good decoding performance is presented. These codes, called braided block codes (BBCs), operate on continuous data streams and are constructed by interconnection of two component block codes. BBCs can be considered as convolutional (or sliding) version of either Elias' product codes or expander codes. In this paper, we define BBCs, describe methods of their construction, analyze code properties, and study asymptotic iterative decoding performance.

APA, Harvard, Vancouver, ISO, and other styles

23

Potey, Shreya D. "BCH Code Error Detection and Correction for Variable Block Length and Message Length using VHDL." International Journal for Research in Applied Science and Engineering Technology 7, no. 5 (May 31, 2019): 3197–203. http://dx.doi.org/10.22214/ijraset.2019.5527.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

No, Albert. "Nonasymptotic Upper Bounds on Binary Single Deletion Codes via Mixed Integer Linear Programming." Entropy 21, no. 12 (December 6, 2019): 1202. http://dx.doi.org/10.3390/e21121202.

Full text

Abstract:

The size of the largest binary single deletion code has been unknown for more than 50 years. It is known that Varshamov–Tenengolts (VT) code is an optimum single deletion code for block length n ≤ 10 ; however, only a few upper bounds of the size of single deletion code are proposed for larger n. We provide improved upper bounds using Mixed Integer Linear Programming (MILP) relaxation technique. Especially, we show the size of single deletion code is smaller than or equal to 173 when the block length n is 11. In the second half of the paper, we propose a conjecture that is equivalent to the long-lasting conjecture that “VT code is optimum for all n”. This equivalent formulation of the conjecture contains small sub-problems that can be numerically verified. We provide numerical results that support the conjecture.

APA, Harvard, Vancouver, ISO, and other styles

25

LI, RUIHU, GEN XU, and LUOBIN GUO. "ON TWO PROBLEMS OF ASYMMETRIC QUANTUM CODES." International Journal of Modern Physics B 28, no. 06 (February 6, 2014): 1450017. http://dx.doi.org/10.1142/s0217979214500179.

Full text

Abstract:

In this paper, we discuss two problems on asymmetric quantum error-correcting codes (AQECCs). The first one is on the construction of a [[12, 1, 5/3]]2 asymmetric quantum code, we show an impure [[12, 1, 5/3 ]]2 exists. The second one is on the construction of AQECCs from binary cyclic codes, we construct many families of new asymmetric quantum codes with dz> δ max +1 from binary primitive cyclic codes of length n = 2m-1, where δ max = 2⌈m/2⌉-1 is the maximal designed distance of dual containing narrow sense BCH code of length n = 2m-1. A number of known codes are special cases of the codes given here. Some of these AQECCs have parameters better than the ones available in the literature.

APA, Harvard, Vancouver, ISO, and other styles

26

JasimMohammed, Samir. "Implementation of Encoder for (31,k) Binary BCH Code based on FPGA for Multiple Error Correction Control." International Journal of Computer Applications 76, no. 11 (August 23, 2013): 23–28. http://dx.doi.org/10.5120/13291-0815.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Farkaš, Peter, and Frank Schindler. "Run length limited error control codes construction based on one control matrix property." Journal of Electrical Engineering 68, no. 4 (August 28, 2017): 322–24. http://dx.doi.org/10.1515/jee-2017-0046.

Full text

Abstract:

AbstractIn this manuscript a simple method is presented for constructing run length limited error control codes from linear binary block codes. The run length limited properties are obtained via addition of a carefully chosen fixed binary vector - a modifier to all codewords without introducing any additional redundancy. Modifier selection is based on a specific property, which can be found in some of the linear binary block codes control matrices. Similar known methods are based on properties of generator matrices. However some codes are specified via control matrices, for example low density parity check codes. The method proposed in this letter could be applied to some of them directly. This is illustrated in this manuscript using example in which a run length limited low density parity check code is obtained from Gallager code.

APA, Harvard, Vancouver, ISO, and other styles

28

FREUDENBERGER, JÜRGEN, and JENS SPINNER. "A CONFIGURABLE BOSE–CHAUDHURI–HOCQUENGHEM CODEC ARCHITECTURE FOR FLASH CONTROLLER APPLICATIONS." Journal of Circuits, Systems and Computers 23, no. 02 (February 2014): 1450019. http://dx.doi.org/10.1142/s0218126614500194.

Full text

Abstract:

Error correction coding (ECC) has become one of the most important tasks of flash memory controllers. The gate count of the ECC unit is taking up a significant share of the overall logic. Scaling the ECC strength to the growing error correction requirements has become increasingly difficult when considering cost and area limitations. This work presents a configurable encoding and decoding architecture for binary Bose–Chaudhuri–Hocquenghem (BCH) codes. The proposed concept supports a wide range of code rates and facilitates a trade-off between throughput and space complexity. Commonly, hardware implementations for BCH decoding perform many Galois field multiplications in parallel. We propose a new decoding technique that uses different parallelization degrees depending on the actual number of errors. This approach significantly reduces the number of required multipliers, where the average number of decoding cycles is even smaller than with a fully parallel implementation.

APA, Harvard, Vancouver, ISO, and other styles

29

K, Divya. "Design and Implementation of Encoder for (15, k) Binary BCH Code Using VHDL and eliminating the fan-out." IOSR Journal of Electronics and Communication Engineering 7, no. 6 (2013): 01–06. http://dx.doi.org/10.9790/2834-0760106.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Kajdanowicz, Tomasz, and Przemysław Kazienko. "Multi-label classification using error correcting output codes." International Journal of Applied Mathematics and Computer Science 22, no. 4 (December 28, 2012): 829–40. http://dx.doi.org/10.2478/v10006-012-0061-2.

Full text

Abstract:

A framework for multi-label classification extended by Error Correcting Output Codes (ECOCs) is introduced and empirically examined in the article. The solution assumes the base multi-label classifiers to be a noisy channel and applies ECOCs in order to recover the classification errors made by individual classifiers. The framework was examined through exhaustive studies over combinations of three distinct classification algorithms and four ECOC methods employed in the multi-label classification problem. The experimental results revealed that (i) the Bode-Chaudhuri-Hocquenghem (BCH) code matched with any multi-label classifier results in better classification quality; (ii) the accuracy of the binary relevance classification method strongly depends on the coding scheme; (iii) the label power-set and the RAkEL classifier consume the same time for computation irrespective of the coding utilized; (iv) in general, they are not suitable for ECOCs because they are not capable to benefit from ECOC correcting abilities; (v) the all-pairs code combined with binary relevance is not suitable for datasets with larger label sets.

APA, Harvard, Vancouver, ISO, and other styles

31

Ivantsov, Oleg Vladimirovich, and Igor Akramovich Saitov. "Minimum Distance Border for Random Block Length Binary Code Segment of Linear Recurring Sequence." SPIIRAS Proceedings 4, no. 35 (October 15, 2014): 15. http://dx.doi.org/10.15622/sp.35.2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Hwang, Seokha, Seungsik Moon, Dongyun Kam, Inn-Yeal Oh, and Youngjoo Lee. "High-Throughput and Low-Latency Digital Baseband Architecture for Energy-Efficient Wireless VR Systems." Electronics 8, no. 7 (July 22, 2019): 815. http://dx.doi.org/10.3390/electronics8070815.

Full text

Abstract:

This paper presents a novel baseband architecture that supports high-speed wireless VR solutions using 60 GHz RF circuits. Based on the experimental observations by our previous 60 GHz transceiver circuits, the efficient baseband architecture is proposed to enhance the quality of transmission. To achieve a zero-latency transmission, we define an (106,920, 95,040) interleaved-BCH error-correction code (ECC), which removes iterative processing steps in the previous LDPC ECC standardized for the near-field wireless communication. Introducing the block-level interleaving, the proposed baseband processing successfully scatters the existing burst errors to the small-sized component codes, and recovers up to 1080 consecutive bit errors in a data frame of 106,920 bits. To support the high-speed wireless VR system, we also design the massive-parallel BCH encoder and decoder, which is tightly connected to the block-level interleaver and de-interleaver. Including the high-speed analog interfaces for the external devices, the proposed baseband architecture is designed in 65 nm CMOS, supporting a data rate of up to 12.8 Gbps. Experimental results show that the proposed wireless VR solution can transfer up to 4 K high-resolution video streams without using time-consuming compression and decompression, successfully achieving a transfer latency of 1 ms.

APA, Harvard, Vancouver, ISO, and other styles

33

Wang, Yan, Peng Jia, Cheng Huang, Jiayong Liu, and Peisong He. "Hierarchical Attention Graph Embedding Networks for Binary Code Similarity against Compilation Diversity." Security and Communication Networks 2021 (August 10, 2021): 1–19. http://dx.doi.org/10.1155/2021/9954520.

Full text

Abstract:

Binary code similarity comparison is the technique that determines if two functions are similar by only considering their compiled form, which has many applications, including clone detection, malware classification, and vulnerability discovery. However, it is challenging to design a robust code similarity comparison engine since different compilation settings that make logically similar assembly functions appear to be very different. Moreover, existing approaches suffer from high-performance overheads, lower robustness, or poor scalability. In this paper, a novel solution HBinSim is proposed by employing the multiview features of the function to address these challenges. It first extracts the syntactic and semantic features of each basic block by static analysis. HBinSim further analyzes the function and constructs a syntactic attribute control flow graph and a semantic attribute control flow graph for each function. Then, a hierarchical attention graph embedding network is designed for graph-structured data processing. The network model has a hierarchical structure that mirrors the hierarchical structure of the function. It has three levels of attention mechanisms applied at the instruction, basic block, and function level, enabling it to attend differentially to more and less critical content when constructing the function representation. We conduct extensive experiments to evaluate its effectiveness and efficiency. The results show that our tool outperforms the state-of-the-art binary code similarity comparison tools by a large margin against compilation diversity clone searching. A real-world vulnerabilities search case further demonstrates the usefulness of our system.

APA, Harvard, Vancouver, ISO, and other styles

34

Chaudhari, P., and A. K. Khandani. "Using the Fourier transform to compute the weight distribution of a binary linear block code." IEEE Communications Letters 5, no. 1 (January 2001): 22–24. http://dx.doi.org/10.1109/4234.901815.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Nazarov, L. E., and V. M. Smolyaninov. "Use of fast Walsh-Hadamard transformation for optimal symbol-by-symbol binary block-code decoding." Electronics Letters 34, no. 3 (1998): 261. http://dx.doi.org/10.1049/el:19980186.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Costa, Lucas, Dayan Guimarães, Rausley de Souza, and Roberto Bomfin. "Cooperative Spectrum Sensing with Coded and Uncoded Decision Fusion under Correlated Shadowed Fading Report Channels." Sensors 19, no. 1 (December 23, 2018): 51. http://dx.doi.org/10.3390/s19010051.

Full text

Abstract:

This article addresses the impact of forward error correction when applied to the report channel transmissions of a centralized decision fusion cooperative spectrum sensing scheme designed to detect idle orthogonal frequency division multiple access (OFDMA) subchannels. The OFDMA signal is transmitted over slow frequency-selective multipath Rayleigh fading channels and sensed using the maximum eigenvalue detection test statistic. The decisions on the OFDMA subchannel occupancy are transmitted to a fusion center over report channels represented by a shadowed fading model combining a three-dimensional spatially correlated shadowing with a slow and flat multipath Rayleigh fading. Binary Bose-Chaudhuri-Hochquenghem (BCH) and Repetition codes are used to protect these decisions. Results show that shadowing correlation severely deteriorates the overall spectrum sensing performance and that error correction may not be able to protect the report channel transmissions. It can be even worse with respect to the system performance especially at low signal-to-noise regimes. In the situations in which error correction is effective, the Repetition code is capable of outperforming the BCH, meaning that the diversity gain may be more relevant than the coding gain when the spectrum sensing decisions are subjected to correlated shadowing.

APA, Harvard, Vancouver, ISO, and other styles

37

Anbuselvi, M., P. Saravanan, and S. Joseph Gladwin. "Analysis of a Code Construction Method for Non-Binary Quasi-Cyclic Irregular Low Density Parity Check Decoder." Journal of Computational and Theoretical Nanoscience 15, no. 2 (February 1, 2018): 719–24. http://dx.doi.org/10.1166/jctn.2018.7151.

Full text

Abstract:

Non-binary LDPC codes is a class of linear block code outperform in the short and moderate block length, closer to Shannon's limit. The numerical strength of the decoder is proportional to the sparsity of the parity check matrix. A Hierarchically Diagonal Parity Check Matrix (HDPCM) with better sparseness is constructed to optimize the computation complexity and decoding performance. The decoder based on the proposed matrix using FFT-SP decoding algorithm is analyzed, with different modulation schemes and channel environment. The positive impact of the constructed matrix is elaborated, concludes with the suitability of the HDPCM structure in AWGN channel and BPSK modulation environment.

APA, Harvard, Vancouver, ISO, and other styles

38

Ganin, D. V., G. M. Tamrazian, S. V. Shakhtanov, Said A. S. Basem, and A. D. Bakurova. "A PROCEDURE FOR FINDING A SET OF DEGENERATE MATRICES IN A BINARY BLOCK CODE PERMUTATION SYSTEM." Автоматизация Процессов Управления 58, no. 4 (December 2019): 82–89. http://dx.doi.org/10.35752/1991-2927-2019-4-58-82-89.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Eksim, Ali, and MehmetErtugrul Celebi. "Performance Improvement of Binary Sensor-Based Statistical Space-Time Block Code Cooperative Diversity Using Limited Feedback." IETE Technical Review 27, no. 1 (2010): 60. http://dx.doi.org/10.4103/0256-4602.58975.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Wang, Yong Qi, and Hui Zhang. "An Algorithm of Digital Image Watermarking Based on Turbo Code and Particle Swarm Optimization." Applied Mechanics and Materials 532 (February 2014): 138–41. http://dx.doi.org/10.4028/www.scientific.net/amm.532.138.

Full text

Abstract:

To protect the copyright information of digital images, this paper presents a combination of Particle Swarm Optimization and turbo code of the image watermarking algorithm. Firstly, in order to enhance the security of watermark information, binary image is encrypted by Aronld transform and error correction coding technology. Based on the block of the host image, according to human visual properties, make discrete cosine transform to the block with larger texture complexity, and embed the watermark information in the low frequency coefficients of discrete cosine transform with the embedding intensity of watermarking searched by PSO. The simulation results show that the algorithm not only improves the security of the watermarking, but also has better robustness and invisibility of the watermarking.

APA, Harvard, Vancouver, ISO, and other styles

41

Maini, Harpal, Kishan Mehrotra, Chilukuri Mohan, and Sanjay Ranka. "Genetic Algorithms for Soft-Decision Decoding of Linear Block Codes." Evolutionary Computation 2, no. 2 (June 1994): 145–64. http://dx.doi.org/10.1162/evco.1994.2.2.145.

Full text

Abstract:

Soft-decision decoding is an NP-hard problem of great interest to developers of communication systems. We show that this problem is equivalent to the problem of optimizing Walsh polynomials. We present genetic algorithms for soft-decision decoding of binary linear block codes and compare the performance with various other decoding algorithms including the currently developed A* algorithm. Simulation results show that our algorithms achieve bit-error-probabilities as low as 0.00183 for a [104,52] code with a low signal-to-noise ratio of 2.5 dB, exploring only 22,400 codewords, whereas the search space contains 4.5 × 10l5 codewords. We define a new crossover operator that exploits domain-specific information and compare it with uniform and two-point crossover.

APA, Harvard, Vancouver, ISO, and other styles

42

ZAHEDI, Adel, and Gholam-Reza MOHAMMAD-KHANI. "Reconstruction of a Non-binary Block Code from an Intercepted Sequence with Application to Reed-Solomon Codes." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E95.A, no. 11 (2012): 1873–80. http://dx.doi.org/10.1587/transfun.e95.a.1873.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Bakhtavar, E. "Op-Ug TD Optimizer Tool Based on Matlab Code to Find Transition Depth From Open Pit to Block Caving / Narzędzie Optymalizacyjne Oparte O Kod Matlab Wykorzystane Do Określania Głębokości Przejściowej Od Wydobycia Odkrywkowego Do Wybierania Komorami." Archives of Mining Sciences 60, no. 3 (September 1, 2015): 687–95. http://dx.doi.org/10.1515/amsc-2015-0045.

Full text

Abstract:

Abstract In this study, transition from open pit to block caving has been considered as a challenging problem. For this purpose, the linear integer programing code of Matlab was initially developed on the basis of the binary integer model proposed by Bakhtavar et al (2012). Then a program based on graphical user interface (GUI) was set up and named “Op-Ug TD Optimizer”. It is a beneficial tool for simple application of the model in all situations where open pit is considered together with block caving method for mining an ore deposit. Finally, Op-Ug TD Optimizer has been explained step by step through solving the transition from open pit to block caving problem of a case ore deposit.

APA, Harvard, Vancouver, ISO, and other styles

44

GRAVANO, S. "Decoding the triple-error-correcting (15, 5) binary BCH code by the analytic solution of the cubic error-locator polynomial over GF(24)." International Journal of Electronics 68, no. 2 (February 1990): 175–80. http://dx.doi.org/10.1080/00207219008921158.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Шевяков, Ю. І., В. В. Ларін, є. л. Казаков, and Ахмед Абдалла. "The video processing features research in computer systems and special purpose networks." Системи озброєння і військова техніка, no. 4(64), (December 17, 2020): 126–32. http://dx.doi.org/10.30748/soivt.2020.64.16.

Full text

Abstract:

For a typical low complexity video sequence, the weight of each P-frame in the stream is approximately three times smaller than the I-frame weight. However, taking into account the number of P-frames in the group, they make the main contribution to the total video data amount. Therefore, the possibility of upgrading coding methods for P-frames is considered on preliminary blocks' type identification with the subsequent formation of block code structures. As the correlation coefficient between adjacent frames increases, the compression ratio of the differential-represented frame's binary mask increases. The compression ratio of the differential-represented frame's binary mask varies from 3 to 21 depending on the correlation coefficient between adjacent frames. The most preferable method for constructing the compact representation technology of the binary masks of frames represented in a differential form is the approach. This is based on the identification and description of the lengths of one-dimensional binary series. A binary series is a consecutive binary elements sequence with the same value. In this case, sequences of identical binary elements are replaced by their lengths.

APA, Harvard, Vancouver, ISO, and other styles

46

Journal, Baghdad Science. "An algorithm for binary codebook design based on the average bitmap replacement error (ABPRE)." Baghdad Science Journal 8, no. 2 (June 12, 2011): 684–88. http://dx.doi.org/10.21123/bsj.8.2.684-688.

Full text

Abstract:

In this paper, an algorithm for binary codebook design has been used in vector quantization technique, which is used to improve the acceptability of the absolute moment block truncation coding (AMBTC) method. Vector quantization (VQ) method is used to compress the bitmap (the output proposed from the first method (AMBTC)). In this paper, the binary codebook can be engender for many images depending on randomly chosen to the code vectors from a set of binary images vectors, and this codebook is then used to compress all bitmaps of these images. The chosen of the bitmap of image in order to compress it by using this codebook based on the criterion of the average bitmap replacement error (ABPRE). This paper is suitable to reduce bit rates (increase compression ratios) with little reduction of performance (PSNR).

APA, Harvard, Vancouver, ISO, and other styles

47

Ahmed, Hanaa Mohsin. "Mobile-based Telemedicine Application using SVD and F-XoR Watermarking for Medical Images." Baghdad Science Journal 17, no. 1 (March 1, 2020): 0178. http://dx.doi.org/10.21123/bsj.2020.17.1.0178.

Full text

Abstract:

A medical- service platform is a mobile application through which patients are provided with doctor’s diagnoses based on information gleaned from medical images. The content of these diagnostic results must not be illegitimately altered during transmission and must be returned to the correct patient. In this paper, we present a solution to these problems using blind, reversible, and fragile watermarking based on authentication of the host image. In our proposed algorithm, the binary version of the Bose_Chaudhuri_Hocquengham (BCH) code for patient medical report (PMR) and binary patient medical image (PMI) after fuzzy exclusive or (F-XoR) are used to produce the patient's unique mark using secret sharing schema (SSS). The patient’s unique mark is used later as a watermark to be embedded into host PMI using blind watermarking-based singular value decomposition (SVD) algorithm. This is a new solution that we also proposed to applying SVD into a blind watermarking image. Our algorithm preserves PMI content authentication during the transmission and PMR ownership to the patient for subsequently transmitting associated diagnosis to the correct patient via a mobile telemedicine application. The performance of experimental results is high compare to previous results, uses recovered watermarks demonstrating promising results in the tamper detection metrics and self-recovery capability, with 30db PSNR, NC value is 0.99.

APA, Harvard, Vancouver, ISO, and other styles

48

Banerjee, S., K. Belczynski, C. L. Fryer, P. Berczik, J. R. Hurley, R. Spurzem, and L. Wang. "BSE versus StarTrack: Implementations of new wind, remnant-formation, and natal-kick schemes in NBODY7 and their astrophysical consequences." Astronomy & Astrophysics 639 (July 2020): A41. http://dx.doi.org/10.1051/0004-6361/201935332.

Full text

Abstract:

Context. As a result of their formation via massive single and binary stellar evolution, the masses of stellar-remnant black holes (BH) are subjects of great interest in this era of gravitational-wave detection from binary black hole (BBH) and binary neutron star merger events. Aims. In this work, we present new developments in the stellar-remnant formation and related schemes of the current N-body evolution program NBODY7. We demonstrate that the newly implemented stellar-wind and remnant-formation schemes in the stellar-evolutionary sector or BSE of the NBODY7 code, such as the “rapid” and the “delayed” supernova (SN) schemes along with an implementation of pulsational-pair-instability and pair-instability supernova (PPSN/PSN), now produce neutron star (NS) and BH masses that agree nearly perfectly, over large ranges of zero-age-main-sequence (ZAMS) mass and metallicity, with those from the widely recognised StarTrack population-synthesis program. We also demonstrate the new, recipe-based implementations of various widely debated mechanisms of natal kicks on NSs and BHs, such as “convection-asymmetry-driven”, “collapse-asymmetry-driven”, and “neutrino-emission-driven” kicks, in addition to a fully consistent implementation of the standard, fallback-dependent, momentum-conserving natal kick. Methods. All the above newly implemented schemes are also shared with the standalone versions of SSE and BSE. All these demonstrations are performed with both the updated standalone BSE and the updated NBODY7/BSE. Results. When convolved with stellar and primordial-binary populations as observed in young massive clusters, such remnant-formation and natal-kick mechanisms crucially determine the accumulated number, mass, and mass distribution of the BHs retained in young massive, open, and globular clusters (GCs); these BHs would eventually become available for long-term dynamical processing. Conclusions. Among other conclusions, we find that although the newer, delayed SN remnant formation model gives birth to the largest number (mass) of BHs, the older remnant-formation schemes cause the largest number (mass) of BHs to survive in clusters, when incorporating SN material fallback onto the BHs. The SN material fallback also causes the convection-asymmetry-driven SN kick to effectively retain similar numbers and masses of BHs in clusters as for the standard, momentum-conserving kick. The collapse-asymmetry-driven SN kick would cause nearly all BHs to be retained in clusters irrespective of their mass, remnant-formation model, and metallicity, whereas the inference of a large population of BHs in GCs would potentially rule out the neutrino-driven SN kick mechanism. Pre-SN mergers of massive primordial binaries would potentially cause BH masses to deviate from the theoretical, single-star ZAMS to mass-remnant mass relation unless a substantial of the total merging stellar mass of up to ≈40% is lost during a merger process. In particular, such mergers, at low metallicities, have the potential to produce low-spinning BHs within the PSN mass gap that can be retained in a stellar cluster and be available for subsequent dynamical interactions. As recent studies indicate, the new remnant-formation modelling reassures us that young massive and open clusters would potentially contribute to the dynamical BBH merger detection rate to a similar extent as their more massive GC counterparts.

APA, Harvard, Vancouver, ISO, and other styles

49

Morelos-Zaragoza, Robert H. "On the Error Performance of Coding and Equalization in Low-Complexity Ultra-Wideband Communication Systems." Journal of Communications Software and Systems 2, no. 3 (April 5, 2017): 245. http://dx.doi.org/10.24138/jcomss.v2i3.287.

Full text

Abstract:

In this paper, the performance of various channel coding schemes is investigated in pulse-based ultra-wideband(UWB) communication systems for applications in short-range indoor environments. Pulse-based binary (BPSK) modulation and decision-feedback equalization (DFE) is considered. Concatenated adaptive equalization and coding is explored as an alternative to the more complex and often impractical joint coding and equalization. A block length of approximately 1000 bits is considered in this paper as it results in a static channel with minimal latency while still yielding relatively good error performance. The error performance of a previously proposed turbo product code (TPC), based on two identical Hamming (31,26) codes, is simulated and compared with that of otherchannel coding schemes of similar rate and code length. These include a regular LDPC (1057,813) code, a memory-6 rate-3/4 punctured convolutional code, a Reed-Solomon (127,89) code and a concatenated (off-the-shelf) code with a Reed-Solomon (255,239) outer code and a memory-6 rate-3/4 punctured convolutional inner code. The inclusion of the concatenated Reed-Solomon scheme serves as a reference, as this is an off-the-shelf classical and still popular solution. The simulation results show that, among the coding schemes considered, the LDPC code offers the best error performance.

APA, Harvard, Vancouver, ISO, and other styles

50

Semyonov, S. I., and V. A. Lipnitsky. "The automorphisms and error orbits of Reed – Solomon codes." Doklady BGUIR 18, no. 4 (June 25, 2020): 20–27. http://dx.doi.org/10.35596/1729-7648-2020-18-4-20-27.

Full text

Abstract:

The purpose of this work with its results presented in the article was to develop and transfer to the class of Reed – Solomon codes (RS-codes) the basic provisions of the theory of syndrome norms (TNS), previously developed for the noise-resistant coding of the class of Bose – Chaudhuri – Hocquenghem codes (BCH-codes), which is actively used in theory and practice. To achieve this goal, a transition has been made in the interpretation of the theory of RS-codes from polynomial to matrix language. This approach allows you to fully use the capabilities of Galois field theory. The main difficulty of RS-codes is that they rely on a non-binary alphabet. The same factor is attractive for practical applications of RS-codes. The matrix language allows you to break the syndromes of errors into components that are elements of the Galois field – the field of definition of RS-codes. The TNS for BCH codes is based on the use of automorphisms of these codes – cyclic and cyclotomic substitutions. Automorphisms of RS-codes are studied in detail. The cyclic substitution belongs to the categories of automorphisms of RS-codes and generates a subgroup Г of order N (code length). The cyclotomic substitution does not belong to the class of automorphisms of RS-codes – the power of the alphabet greater than 2 prevents this. When expanding the concept of automorphism of a code beyond substitutions of coordinates of vectors to automorphisms of RS-codes, homotheties or affine substitutions can be attributed, since they also form a cyclic group A of order N. It is shown that cyclic and affine substitutions commute with each other, which, generally speaking, is not typical for linear operators and substitutions. The group Г of cyclic substitutions, the group A of affine substitutions, and the combined AГ group of order N2 generate 3 types of error orbits in RS-codes. The structure of the orbits of errors with respect to the action of groups A, Г and the combined group AГ is studied {231 words}.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Binary bch block code'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles