In this paper the linear block code decoder is constructed by neural network. The neural network will be adapted for a single-bit error. Each layer of a neural network will simulate a linear block code decoder stage. ...
详细信息
ISBN:
(纸本)9781424418206
In this paper the linear block code decoder is constructed by neural network. The neural network will be adapted for a single-bit error. Each layer of a neural network will simulate a linear block code decoder stage. The syndrome generator, the error detection, and the error correction stages of the linear block code decoder will be simulated by the proposed neural network.
Multimode fibers have been shown to not just be able to convey signal at their 3-dB modal bandwidth, which is limited to approximately 200 to 500 MHz-km, but also at the frequency higher than the 3-dB modal bandwidth....
详细信息
ISBN:
(纸本)9781538635520
Multimode fibers have been shown to not just be able to convey signal at their 3-dB modal bandwidth, which is limited to approximately 200 to 500 MHz-km, but also at the frequency higher than the 3-dB modal bandwidth. At this higher frequency, the magnitude response of the multimode fiber has been analyzed showing that it contains many possible passbands with an average attenuation depending on the number of modes in the fiber. In this work, the passbands at low frequency region;that is, the frequency that is located next to the 3-dB modal bandwidth of the fiber are utilized as sub-channels in transmitting a combined high data rate signal over a multimode fiber. Subcarrier multiplexing technique is used to send a high data rate signal over different low data rate signals. Additionally, a linear block code is adopted in order to overcome the degradation caused by the effect of null in the magnitude response of the fiber. The performance of the system in terms of bit-error-rate is analyzed and the simulated results are given. It is shown that with a (7, 4) linear block code, the average biterr-or-rate (BER) of lower than 10-8 with a total data rate of 392 Mbps can be obtained. With a total data rate twice the 3-dB modal bandwidth of the fiber, the obtained BER is significantly improved compared to the case of without coding.
The definition and matrix description of linear cyclic code is introduced in this paper first. Then the distribution of code weight is analyzed. The distance of code weight distribution is defined according to distanc...
详细信息
The definition and matrix description of linear cyclic code is introduced in this paper first. Then the distribution of code weight is analyzed. The distance of code weight distribution is defined according to distance of vectors. The theoretic probability of code weight of random sequence is ratiocinated. The method to estimate code weight distribution of actual sequence is established. The code length and start are estimated by the distance between the code weight distribution and the check matrix and generation matrix are estimated by Gauss Elimination. The results of simulating experiment to different length code show that this method can recognize code with middle and short code length effectively when BER is 10(-3).
This letter is concerned with the evaluation of the average computational complexity of the maximum likelihood decoding of a linear block code using its trellis diagram. Each section of the L-section minimal trellis d...
详细信息
This letter is concerned with the evaluation of the average computational complexity of the maximum likelihood decoding of a linear block code using its trellis diagram. Each section of the L-section minimal trellis diagram for a linear block code consists of parallel components which are structurally identical subgraphs without cross connection between them. A parallel component is also known to be decomposed into subgraphs, and a decoding algorithm by using the structure of the subgraphs of parallel components was proposed, and an upper bound on the worst case computational complexity was derived. In this letter, the average computational complexity of the decoding algorithm is evaluated by computer simulation. We evaluated the average numbers of additions and comparisons performed in the decoding algorithm for example codes, (64,45) extended and permuted binary primitive BCH code, the third order Reed-Muller (64,42) code and its (64,40) subcode. It is shown that the average numbers are much smaller than those for the worst case, and hence the decoding algorithm is efficient when the number of sections, L, is small, say 4 or 8, for the example codes. Especially, for the (64,45) extended binary primitive BCH code with L = 4, the average numbers of additions and comparisons in the decoding: algorithm for finding the survivor's metric of each state after finding the smallest metric among parallel branches are about 1/50 and 17/100 of those in the conventional exhaustive search, respectively. The number of additions and comparisons by the conventional search for all the example codes is smallest when L is 4. As a result, the decoding algorithm with L = 4 gives the smallest number of operations among those decoding methods considered here.
This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linearblock co...
详细信息
This study proposes a novel multi-fractal spectrumbasedapproach to distinguish linear block codes from its selfsynchronousscrambled codes. Given that the linear block codeand self-synchronous scrambled linear block code share the propertyof linear correlation, the existing linear correlation-basedidentification method is invalid for this case. This drawback can becircumvented by introducing a novel multi-fractal spectrum-basedmethod. Simulation results show that the new method has highrobustness and under the same conditions of bit error, the lowerthe code rate, the higher the recognition rate. Thus, the methodhas significant potential for future application in engineering.
The binary [24,12,8] Golay code has projection O onto the quaternary [6,3,4] hexacode [9] and the [32,16,8] Reed-Muller code has projection E onto the quaternary self-dual [8,4,4] code [6]. Projection E was extended t...
详细信息
The binary [24,12,8] Golay code has projection O onto the quaternary [6,3,4] hexacode [9] and the [32,16,8] Reed-Muller code has projection E onto the quaternary self-dual [8,4,4] code [6]. Projection E was extended to projection G in [8]. In this paper we introduce a projection, to be called projection Delta that covers projections O, E and G. We characterise G-projectable self-dual codes and Delta-projectable codes. Explicit methods for constructing codes having G and Delta projections are given and several so constructed codes that have best known optimal parameters are introduced.
In decision feedback scheme, Forney's decision criterion (Forney's rule: FR) is optimal in the sense that the Neyman-Pearson's lemma is satisfied. Another prominent criterion called LR+Th was proposed by H...
详细信息
In decision feedback scheme, Forney's decision criterion (Forney's rule: FR) is optimal in the sense that the Neyman-Pearson's lemma is satisfied. Another prominent criterion called LR+Th was proposed by Hashimoto. Although LR+Th is suboptimal, its error exponent is shown to be asymptotically equivalent to that of FR by random coding arguments. In this paper, applying the technique of the DS2 bound, we derive an upper bound for the error probability of LR+Th for the ensemble of linear block codes. Then we can observe the new bound from two significant points of view. First, since the DS2 type bound can be expressed by the average weight distribution whose code length is finite, we can compare the error probability of FR with that of LR+Th for the fixed-length code. Second, the new bound elucidates the relation between the random coding exponents of blockcodes and those of linear block codes.
Recently, Hof et al. extended the type-2 Duman and Salehi (DS2) bound to generalized decoding, which was introduced by Forney, with decision criterion FR. From this bound, they derived two significant bounds. One is t...
详细信息
Recently, Hof et al. extended the type-2 Duman and Salehi (DS2) bound to generalized decoding, which was introduced by Forney, with decision criterion FR. From this bound, they derived two significant bounds. One is the Shulman-Feder bound for generalized decoding (GD) with the binary-input output-symmetric channel. The other is an upper bound for an ensemble of linear block codes, by applying the average complete weight distribution directly to the DS2 bound for GD. For the Shulman-Feder bound for GD, the authors derived a condition under which an upper bound is minimized at an intermediate step and show that this condition yields a new bound which is tighter than Hof et al.'s bound. In this paper, we first extend this result for non-binary linear block codes used over a class of symmetric channels called the regular channel. Next, we derive a new tighter bound for an ensemble of linear block codes, which is based on the average weight distribution.
This paper presents a statistical model to accurately estimate post-FEC BER for high-speed wireline links using standard linear block codes, such as the RS(544,514,15) KP4 and RS(528,514,7) KR4 codes. A hierarchical a...
详细信息
This paper presents a statistical model to accurately estimate post-FEC BER for high-speed wireline links using standard linear block codes, such as the RS(544,514,15) KP4 and RS(528,514,7) KR4 codes. A hierarchical approach is adopted to analyze the propagation of PAM-symbol and FEC-symbol errors through a two-layer Markov model. A series of techniques including state aggregation, time aggregation, state reduction, and dynamic programming are introduced making the time complexity to compute post-FEC BER below 10(-15) reasonable. Error bounds associated with each method are found. The efficiency of the proposed model allows it to handle a larger state space, more DFE taps, and more sophisticated linear block codes than prior work. A 4-PAM 60 Gb/s wireline transceiver fabricated in a 7 nm FinFET technology is used as a test vehicle to validate this model. Measured data with two different channels reveals that the statistical model can properly predict the post-FEC error floor with standard FEC codes. While this paper demonstrates the method for capturing DFE error propagation, the method is general and can be applied to model other communication systems having memory effects. Moreover, our proposed model can be easily extended to higher-level PAM schemes and other advanced equalizer architectures to assist in making architectural choices for wireline transceivers.
There are two types of bounded-distance decoders for linear block codes: erasing decoders that discard uncorrectable received words, and reproducing decoders that reproduce uncorrectable received words. Exact expressi...
详细信息
There are two types of bounded-distance decoders for linear block codes: erasing decoders that discard uncorrectable received words, and reproducing decoders that reproduce uncorrectable received words. Exact expressions for the information-symbol and decoded-symbol error rates are derived for both types. Necessary and sufficient conditions are derived for the quality of the information-symbol and decoded symbol error rates, It is formally proved that these two error rates are equal for cyclic codes with either erasing or reproducing decoders. For reproducing decoders, two approximations to the information-bit error rate and their applicability are examined.
暂无评论