Information-dispersion-entropy-based blind recognition of binary BCH codes in soft decision situations (Q742719): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3390/e15051705 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054640383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encoding and error-correction procedures for the Bose-Chaudhuri codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blind Recognition of Linear Space–Time Block Codes: A Likelihood-Based Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit-error probability for maximum-likelihood decoding of linear block codes and related soft-decision decoding methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Decoding of Linear Block Codes: A Parity-Check Orthogonalization Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rotated quasi-orthogonal space-time block code for asynchronous cooperative diversity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative decoding of binary block and convolutional codes / rank
 
Normal rank

Latest revision as of 02:15, 9 July 2024

scientific article
Language Label Description Also known as
English
Information-dispersion-entropy-based blind recognition of binary BCH codes in soft decision situations
scientific article

    Statements

    Information-dispersion-entropy-based blind recognition of binary BCH codes in soft decision situations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 September 2014
    0 references
    Summary: A method of blind recognition of the coding parameters for binary Bose-Chaudhuri-Hocquenghem (BCH) codes is proposed in this paper. We consider an intelligent communication receiver which can blindly recognize the coding parameters of the received data stream. The only knowledge is that the stream is encoded using binary BCH codes, while the coding parameters are unknown. The problem can be addressed on the context of the non-cooperative communications or adaptive coding and modulations (ACM) for cognitive radio networks. The recognition processing includes two major procedures: code length estimation and generator polynomial reconstruction. A hard decision method has been proposed in a previous literature. In this paper we propose the recognition approach in soft decision situations with Binary-Phase-Shift-Key modulations and Additive-White-Gaussian-Noise (AWGN) channels. The code length is estimated by maximizing the root information dispersion entropy function. And then we search for the code roots to reconstruct the primitive and generator polynomials. By utilizing the soft output of the channel, the recognition performance is improved and the simulations show the efficiency of the proposed algorithm.
    0 references
    information dispersion entropy
    0 references
    blind recognition
    0 references
    channel coding
    0 references
    BCH codes
    0 references
    adaptive coding and modulation (ACM)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references