Relevant bibliographies by topics / Binary bch block code

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Binary bch block code'

Author: Grafiati
Published: 4 June 2021
Last updated: 18 February 2022

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Binary bch block code.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "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
More sources

Dissertations / Theses on the topic "Binary bch block code"

1

Kašpar, Jaroslav. "Zabezpečení přenosu dat BCH kódy." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2008. http://www.nusl.cz/ntk/nusl-217733.

Full text
Abstract:
The thesis Data transmission error-protection with BCH codes deals with a large class of random-error correcting cyclic codes which are able to protect binary data and can be used for example in data storages, high speed modems. Bose, Chaudhuri and Hocquenghem (BCH) codes operate over algebraic structures called Galois fields. The BCH encoding is the same as cyclic encoding and can be done with linear feedback shift register but decoding is more complex and can be done with different algorithms - in this thesis there are two algorithms for decoding Peterson and Berlekam-Massey mentioned. The aim of this thesis is to find BCH code which is able to correct t = 6 independent errors in up to data sequence n = 150 bits, then peruse possible realizations of the codecs and set criteria for the best realization, then design and test this realization. This thesis is split into three main parts. In the first part there are encoding and decoding methods of the BCH code generally described. The second part deals with selecting of the right code and realization. There was chosen BCH (63,30) code and realization with FPGA chip. In the last part is described design of BCH encoder and decoder and compilation in the Altera design software.
APA, Harvard, Vancouver, ISO, and other styles
2

Kwak, Yongjun. "Near Shannon Limit and Reduced Peak to Average Power Ratio Channel Coded OFDM." Thesis, Harvard University, 2012. http://dissertations.umi.com/gsas.harvard:10176.

Full text
Abstract:
Solutions to the problem of large peak to average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems are proposed. Although the design of PAPR reduction codewords has been extensively studied and the existence of asymptotically good codes with low PAPR has been proved, still no reduced PAPR capacity achieving code has been constructed. This is the topic of the current thesis.This goal is achieved by implementing a time-frequency turbo block coded OFDM. In this scheme, we design the frequency domain component code to have a PAPR bounded by a small number. The time domain component code is designed to obtain good performance while the decoding algorithm has reasonable complexity. Through comparative numerical evaluation we show that our method achieves considerable improvement in terms of PAPR with slight performance degradation compared to capacity achieving codes with similar block lengths. For the frequency domain component code, we used the realization of Golay sequences as cosets of the fi rst order Reed-Muller code and the modi cation of dual BCH code. A simple MAP decoding algorithm for the modi ed dual BCH code is also provided. Finally, we provide a flexible and practical scheme based on probabilistic approach to a PAPR problem. This approach decreases the PAPR without any signi cant performance loss and without any adverse impact or required change to the system.
Engineering and Applied Sciences
APA, Harvard, Vancouver, ISO, and other styles
3

Malan, Estian. "Multi-dimensional direct-sequence spread spectrum multiple-access communication with adaptive channel coding." Diss., 2007. http://hdl.handle.net/2263/29029.

Full text
Abstract:
During the race towards the4th generation (4G) cellular-based digital communication systems, a growth in the demand for high capacity, multi-media capable, improved Quality-of-Service (QoS) mobile communication systems have caused the developing mobile communications world to turn towards betterMultiple Access (MA) techniques, like Code Division Multiple Access (CDMA) [5]. The demand for higher throughput and better QoS in future 4G systems have also given rise to a scheme that is becoming ever more popular for use in these so-called ‘bandwidth-on-demand’ systems. This scheme is known as adaptive channel coding, and gives a system the ability to firstly sense changes in conditions, and secondly, to adapt to these changes, exploiting the fact that under good channel conditions, a very simple or even no channel coding scheme can be used for Forward Error Correction(FEC). This will ultimately result in better system throughput utilization. One such scheme, known as incremental redundancy, is already implemented in the Enhanced Data Rates for GSM Evolution (EDGE) standard. This study presents an extensive simulation study of a Multi-User (MU), adaptive channel coded Direct Sequence Spread Spectrum Multiple Access (DS/SSMA) communication system. This study firstly presents and utilizes a complex Base Band(BB) DS/SSMA transmitter model, aimed at user data diversity [6] in order to realize the MU input data to the system. This transmitter employs sophisticated double-sideband (DSB)Constant-Envelope Linearly Interpolated Root-of-Unity (CE-LI-RU) filtered General Chirp-Like (GCL) sequences [34, 37, 38] to band limit and spread user data. It then utilizes a fully user-definable, complex Multipath Fading Channel Simulator(MFCS), first presented by Staphorst [3], which is capable of reproducing all of the physical attributes of realistic mobile fading channels. Next, this study presents a matching DS/SSMA receiver structure that aims to optimally recover user data from the channel, ensuring the achievement of data diversity. In order to provide the basic channel coding functionality needed by the system of this study, three simple, but well-known channel coding schemes are investigated and employed. These are: binary Hamming (7,4,3) block code, (15,7,5) binary Bose-Chadhuri-Hocquenghem (BCH) block code and a rate 1/3 Dissertation (MEng (Computer Engineering))--University of Pretoria, 2007.
Electrical, Electronic and Computer Engineering
MEng
unrestricted
APA, Harvard, Vancouver, ISO, and other styles
4

Hsiao, Chien-Wei, and 蕭建偉. "On Step-by-Step Complete Decoding of Triple-Error-Correcting Binary BCH Code." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/43279470371424806244.

Full text
Abstract:
碩士
國立暨南國際大學
電機工程學系
92
The complete decoding of triple-error-correcting binary BCH code means that it can correct all patterns of one, two and three errors and all patterns of four and five errors that belong to cosets that have a coset leader of weight four and five. A step-by-step complete decoding algebraic for triple-error-correcting bp BCH code is present. The step-by-step decoding that we use in the paper is the most simple and fastest way of the complete decoding.
APA, Harvard, Vancouver, ISO, and other styles
5

Chang, Wei-Wen, and 張維文. "Some Sub-Optimal Decoding Algorithm for Binary Data Hiding Using Linear Block Code." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/nt6qvg.

Full text
Abstract:
碩士
國立中興大學
通訊工程研究所
99
This paper proposed a method is binary data hiding using linear block code , the message embedded into binary image by syndrome code technique . At the time , we proposed two decoding algorithm , named WAE and LIAE algorithm . Both the algorithm is a sub-optimal algorithm . WAE has fast decoding speed and low complexity . WAE get num of k codeword by linear block code generator matrix , then using iterative decoding . And find a vector near coset leader which get good embedded efficiency and have property of low complexity . Further , the other part we proposed the algorithm LIAE . It have property of linear independent basis , and use the weight table to find suitable pixel for embedding . Thus the watermark in the image is difficult to detect . For reduce distortion , we will research the relation between num of linear independent basis and embedding efficient .
APA, Harvard, Vancouver, ISO, and other styles
6

Staphorst, Leonard. "Viterbi Decoded Linear Block Codes for Narrowband and Wideband Wireless Communication Over Mobile Fading Channels." Diss., 2005. http://hdl.handle.net/2263/27090.

Full text
Abstract:
Since the frantic race towards the Shannon bound [1] commenced in the early 1950’s, linear block codes have become integral components of most digital communication systems. Both binary and non-binary linear block codes have proven themselves as formidable adversaries against the impediments presented by wireless communication channels. However, prior to the landmark 1974 paper [2] by Bahl et al. on the optimal Maximum a-Posteriori Probability (MAP) trellis decoding of linear block codes, practical linear block code decoding schemes were not only based on suboptimal hard decision algorithms, but also code-specific in most instances. In 1978 Wolf expedited the work of Bahl et al. by demonstrating the applicability of a block-wise Viterbi Algorithm (VA) to Bahl-Cocke-Jelinek-Raviv (BCJR) trellis structures as a generic optimal soft decision Maximum-Likelihood (ML) trellis decoding solution for linear block codes [3]. This study, largely motivated by code implementers’ ongoing search for generic linear block code decoding algorithms, builds on the foundations established by Bahl, Wolf and other contributing researchers by thoroughly evaluating the VA decoding of popular binary and non-binary linear block codes on realistic narrowband and wideband digital communication platforms in lifelike mobile environments. Ideally, generic linear block code decoding algorithms must not only be modest in terms of computational complexity, but they must also be channel aware. Such universal algorithms will undoubtedly be integrated into most channel coding subsystems that adapt to changing mobile channel conditions, such as the adaptive channel coding schemes of current Enhanced Data Rates for GSM Evolution (EDGE), 3rd Generation (3G) and Beyond 3G (B3G) systems, as well as future 4th Generation (4G) systems. In this study classic BCJR linear block code trellis construction is annotated and applied to contemporary binary and non-binary linear block codes. Since BCJR trellis structures are inherently sizable and intricate, rudimentary trellis complexity calculation and reduction algorithms are also presented and demonstrated. The block-wise VA for BCJR trellis structures, initially introduced by Wolf in [3], is revisited and improved to incorporate Channel State Information (CSI) during its ML decoding efforts. In order to accurately appraise the Bit-Error-Rate (BER) performances of VA decoded linear block codes in authentic wireless communication environments, Additive White Gaussian Noise (AWGN), flat fading and multi-user multipath fading simulation platforms were constructed. Included in this task was the development of baseband complex flat and multipath fading channel simulator models, capable of reproducing the physical attributes of realistic mobile fading channels. Furthermore, a complex Quadrature Phase Shift Keying (QPSK) system were employed as the narrowband communication link of choice for the AWGN and flat fading channel performance evaluation platforms. The versatile B3G multi-user multipath fading simulation platform, however, was constructed using a wideband RAKE receiver-based complex Direct Sequence Spread Spectrum Multiple Access (DS/SSMA) communication system that supports unfiltered and filtered Complex Spreading Sequences (CSS). This wideband platform is not only capable of analysing the influence of frequency selective fading on the BER performances of VA decoded linear block codes, but also the influence of the Multi-User Interference (MUI) created by other users active in the Code Division Multiple Access (CDMA) system. CSS families considered during this study include Zadoff-Chu (ZC) [4, 5], Quadriphase (QPH) [6], Double Sideband (DSB) Constant Envelope Linearly Interpolated Root-of- Unity (CE-LI-RU) filtered Generalised Chirp-like (GCL) [4, 7-9] and Analytical Bandlimited Complex (ABC) [7, 10] sequences. Numerous simulated BER performance curves, obtained using the AWGN, flat fading and multi-user multipath fading channel performance evaluation platforms, are presented in this study for various important binary and non-binary linear block code classes, all decoded using the VA. Binary linear block codes examined include Hamming and Bose-Chaudhuri-Hocquenghem (BCH) codes, whereas popular burst error correcting non-binary Reed-Solomon (RS) codes receive special attention. Furthermore, a simple cyclic binary linear block code is used to validate the viability of employing the reduced trellis structures produced by the proposed trellis complexity reduction algorithm. The simulated BER performance results shed light on the error correction capabilities of these VA decoded linear block codes when influenced by detrimental channel effects, including AWGN, Doppler spreading, diminished Line-of-Sight (LOS) signal strength, multipath propagation and MUI. It also investigates the impact of other pertinent communication system configuration alternatives, including channel interleaving, code puncturing, the quality of the CSI available during VA decoding, RAKE diversity combining approaches and CSS correlation characteristics. From these simulated results it can not only be gathered that the VA is an effective generic optimal soft input ML decoder for both binary and non-binary linear block codes, but also that the inclusion of CSI during VA metric calculations can fortify the BER performances of such codes beyond that attainable by classic ML decoding algorithms.
Dissertation (MEng(Electronic))--University of Pretoria, 2006.
Electrical, Electronic and Computer Engineering
unrestricted
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Binary bch block code"

1

Shu, Lin. On complexity of trellis structure of linear block codes: Technical report to NASA Goddard Space Flight Center ... [Washington, DC: National Aeronautics and Space Administration, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Good trellises for IC implementation of Viterbi decoders for linear block codes. [Washington, DC: National Aeronautics and Space Administration, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Binary bch block code"

1

Adde, Patrick, Ramesh Pyndiah, and Sylvie Kerouedan. "Block Turbo Code with Binary Input for Improving Quality of Service." In Multiaccess, Mobility and Teletraffic for Wireless Communications, volume 6, 195–204. Boston, MA: Springer US, 2002. http://dx.doi.org/10.1007/978-1-4757-5918-1_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Misra, Neeraj Kumar, Bibhash Sen, Subodh Wairya, and Bandan Bhoi. "A Novel Parity Preserving Reversible Binary-to-BCD Code Converter with Testability of Building Blocks in Quantum Circuit." In Proceedings of the Second International Conference on Computational Intelligence and Informatics, 383–93. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-8228-3_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Berber, Stevan. "Orthogonal Frequency Division Multiplexing and Code Division Multiple Access Systems." In Discrete Communication Systems, 386–426. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780198860792.003.0008.

Full text
Abstract:
Chapter 8 presents modern multi-user and multicarrier communication systems based on code division multiple access technology and orthogonal frequency division multiple access technology. Analogue, digital, and discrete orthogonal frequency division multiple access systems are presented separately and then inter-related from theoretical and practical points of view. A precise mathematical model of discrete baseband and intermediate-frequency blocks is presented, including procedures for signal mapping and the discrete Fourier transform, and then related to the model of an analogue radiofrequency block to make the whole orthogonal frequency division multiple access system. The basic theory of binary and non-binary code division multiple access systems operation is presented. To support deeper theoretical understanding of the design and operation of a code division multiple access system, one project in the supplementary material demonstrates the mathematical modelling, simulation, and design of this system in field-programmable gate array technology and presents the development tools required.
APA, Harvard, Vancouver, ISO, and other styles
4

Gupta, Yogendra, and Sandeep Saini. "Thermometer to Gray Encoders." In Advances in Computer and Electrical Engineering, 323–35. IGI Global, 2015. http://dx.doi.org/10.4018/978-1-4666-6627-6.ch013.

Full text
Abstract:
Analog to Digital Converter (ADC) is a key functional block in the design of mixed signal, system on chip, and signal processing applications. An optimized method for the direct conversion of analog signal to Gray code representation is presented. This eliminates the need for binary-to-Gray code conversion in many digital modulation techniques like M-PSK and M-QAM, which uses Gray coding representation to represent the symbols that are modulated. The authors design a low-power and high-speed Thermometer to Gray encoder for Flash ADC, as encoders have been widely utilized in high-performance critical applications which persistently impose special design constraints in terms of high-frequency, low power consumption, and minimal area. In this chapter, they propose a new circuit that converts the Thermometer code to Gray code and also yields minimized power.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Binary bch block code"

1

Lee, H. P., H. C. Chang, T. C. Lin, and T. K. Truong. "A Weight Method of Decoding the Binary BCH Code." In 2008 Eighth International Conference on Intelligent Systems Design and Applications (ISDA). IEEE, 2008. http://dx.doi.org/10.1109/isda.2008.38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Gang, Junfeng Liu, Jun Long, Cong Li, and Gang Wu. "Blind Recognition of Binary Linear Block Code." In 2017 International Conference on Computer Systems, Electronics and Control (ICCSEC). IEEE, 2017. http://dx.doi.org/10.1109/iccsec.2017.8446942.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zhu, Xiaodong, Liehui Jiang, Zeng Chen, and Lin Yan. "Searching for similar binary code based on the influence of basic block vertex." In 2021 3rd International Conference on Advances in Computer Technology, Information Science and Communication (CTISC). IEEE, 2021. http://dx.doi.org/10.1109/ctisc52352.2021.00011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Panda, Amit Kumar, Shahbaz Sarik, and Abhishek Awasthi. "FPGA Implementation of Encoder for (15, k) Binary BCH Code Using VHDL and Performance Comparison for Multiple Error Correction Control." In 2012 International Conference on Communication Systems and Network Technologies (CSNT). IEEE, 2012. http://dx.doi.org/10.1109/csnt.2012.170.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kageyama, Shinichi, Ken Ikuta, Takuya Kusaka, and Yasuyuki Nogami. "A Study on Low Level Quantizers for Block Turbo Decoding for Product Codes of Binary Linear Code." In 2019 34th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC). IEEE, 2019. http://dx.doi.org/10.1109/itc-cscc.2019.8793409.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kageyama, Shinichi, Ken Ikuta, Yuki Nanjo, Yuta Kodera, Takuya Kusaka, and Yasuyuki Nogami. "An Analysis of Computational Complexity of Low Level Quantizers for Block Turbo Decoding for Product Codes of Binary Linear Code." In 2019 Seventh International Symposium on Computing and Networking Workshops (CANDARW). IEEE, 2019. http://dx.doi.org/10.1109/candarw.2019.00080.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Song, Jingkuan, Xiaosu Zhu, Lianli Gao, Xin-Shun Xu, Wu Liu, and Heng Tao Shen. "Deep Recurrent Quantization for Generating Sequential Binary Codes." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/128.

Full text
Abstract:
Quantization has been an effective technology in ANN (approximate nearest neighbour) search due to its high accuracy and fast search speed. To meet the requirement of different applications, there is always a trade-off between retrieval accuracy and speed, reflected by variable code lengths. However, to encode the dataset into different code lengths, existing methods need to train several models, where each model can only produce a specific code length. This incurs a considerable training time cost, and largely reduces the flexibility of quantization methods to be deployed in real applications. To address this issue, we propose a Deep Recurrent Quantization (DRQ) architecture which can generate sequential binary codes. To the end, when the model is trained, a sequence of binary codes can be generated and the code length can be easily controlled by adjusting the number of recurrent iterations. A shared codebook and a scalar factor is designed to be the learnable weights in the deep recurrent quantization block, and the whole framework can be trained in an end-to-end manner. As far as we know, this is the first quantization method that can be trained once and generate sequential binary codes. Experimental results on the benchmark datasets show that our model achieves comparable or even better performance compared with the state-of-the-art for image retrieval. But it requires significantly less number of parameters and training times. Our code is published online: https://github.com/cfm-uestc/DRQ.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Binary bch block code"

1

Campbell, Roy L., and Jr. A Hardware Analysis of the Fundamental Iterative Algorithm for Decoding A (17,9) Binary BCH Code. Fort Belvoir, VA: Defense Technical Information Center, August 1996. http://dx.doi.org/10.21236/ada315082.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Binary bch block code' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography