The decoding algorithms of two-dimensional Vernier anodes are deduced *** precision of decoding and uniqueness of encoding are *** influencing factors of detection sensitivity and spatial resolution are *** single pho...
详细信息
The decoding algorithms of two-dimensional Vernier anodes are deduced *** precision of decoding and uniqueness of encoding are *** influencing factors of detection sensitivity and spatial resolution are *** single photon imaging system is constructed,and the two-dimensional Vernier collector is *** image of the ultra-weak emission source is *** spatial resolution of the system is about 100μm.
The development decoding algorithms of two-dimensional cross strip anodes image readouts for applications in UV astronomy are described. We present results with Monte Carlo simulation by GEANT4 toolkit, the results sh...
详细信息
ISBN:
(纸本)9781628415650
The development decoding algorithms of two-dimensional cross strip anodes image readouts for applications in UV astronomy are described. We present results with Monte Carlo simulation by GEANT4 toolkit, the results show that when the cross strip anode period is 0.5mm and the electrode width is 0.4mm, the spatial resolution accuracy is sufficient to reach better than 5 mu m, the temporal resolution accuracy of the event detection can be as low as 100 ps. The influences of the cross strip detector parameters, such as the anode period, the width of anode fingers (electrode), the width of the charge footprint at the anode (determined by the distance and the field between the MCP and the anode), the gain of the MCP and equivalent noise charge (ENC) are also discussed. The development decoding algorithms and simulation results can be useful for the designing and performance improvement of future photon counting imaging detectors for UV Astronomy.
Low-density parity-check (LDPC) codes can be applied in a lot of different scenarios such as video broadcasting and satellite communications. LDPC codes are commonly decoded by an iterative algorithm called belief pro...
详细信息
Low-density parity-check (LDPC) codes can be applied in a lot of different scenarios such as video broadcasting and satellite communications. LDPC codes are commonly decoded by an iterative algorithm called belief propagation (BP) over the corresponding Tanner graph. The original BP updates all the variable-nodes simultaneously, followed by all the check-nodes simultaneously as well. We propose a sequential scheduling algorithm based on weighted bit-flipping (WBF) algorithm for the sake of improving the convergence speed. Notoriously, WBF is a low-complexity and simple algorithm. We combine it with BP to obtain advantages of these two algorithms. Flipping function used in WBF is borrowed to determine the priority of scheduling. Simulation results show that it can provide a good tradeoff between FER performance and computation complexity for short-length LDPC codes.
A method for correcting both errors and erasures of Reed-Solomon (RS) codes using error-only and erasure-only decoding algorithms is proposed. First, the method removes the effect of erasures from syndromes, then it u...
详细信息
A method for correcting both errors and erasures of Reed-Solomon (RS) codes using error-only and erasure-only decoding algorithms is proposed. First, the method removes the effect of erasures from syndromes, then it uses error-only and erasure-only correcting processes to correct errors and erasures, respectively;thus, the overall decoding complexity can be reduced substantially. Furthermore, with hardware implementation, the most time-consuming operations in these two processes can be calculated concurrently to obtain a significant reduction of decoding latency.
The letter describes a comparison of some receiver structures suitable for trellis-coded modulation on channels causing intersymbol interference. Simulation results show that a Viterbi decoder treating trellis coding ...
详细信息
The letter describes a comparison of some receiver structures suitable for trellis-coded modulation on channels causing intersymbol interference. Simulation results show that a Viterbi decoder treating trellis coding and intersymbol interference as one compound encoding mechanism yields the best performance, which at Pb=10-4 is about 6 dB in S/N better than any other receiver structure
Fast decoding algorithms for short codes based on modifications of maximum likelihood decoding algorithms of first order Reed-Muller codes are described. Only additions-subtractions, comparisons and absolute value cal...
详细信息
Fast decoding algorithms for short codes based on modifications of maximum likelihood decoding algorithms of first order Reed-Muller codes are described. Only additions-subtractions, comparisons and absolute value calculations are used in the algorithms. Soft and hard decisions maximum likelihood decoding algorithms for first order Reed-Muller and the Nordstrom-Robinson codes with low complexity are proposed.
Low density parity check (LDPC) code is a kind of linear block code with excellent performance which is proposed by Dr. Gallager. It overcomes the shortcomings of other error correcting codes and it is the nearest cha...
详细信息
Low density parity check (LDPC) code is a kind of linear block code with excellent performance which is proposed by Dr. Gallager. It overcomes the shortcomings of other error correcting codes and it is the nearest channel code from Shannon limit at the present discover. The decoding algorithms of LDPC code can reduce the decoding delay by the parallel decoding structure, so this has caused great concern in many fields. In recent years more and more scholars begin to study LDPC code, this makes the coding and decoding algorithms of LDPC code improved continuously. LDPC code has been widely used in many fields such as optical fiber communication, digital watermarking, underwater communication and deep space communication because of its excellent performance. Non-binary LDPC code has better performance compared with binary LDPC code. In this paper, FFT-BP decoding algorithm of non-binary LDPC code is studied, and on this basis, we proposed an improved FFT-BP algorithm. The improved decoding algorithm can effectively reduce the average iteration number. Finally, we achieved encode and decode algorithm of non-binary LDPC code with FPGA.
A simple technique to control transient chaos in the turbo-decoding algorithm, which improves the performance of classical turbo codes, is developed. On average, the turbo-decoding algorithm with control (when stopped...
详细信息
A simple technique to control transient chaos in the turbo-decoding algorithm, which improves the performance of classical turbo codes, is developed. On average, the turbo-decoding algorithm with control (when stopped after eight iterations) shows a gain of 0.25-0.3 dB in the practical signal-to-noise ratios (from 0 to 1 dB), compared to the classical turbo-decoding algorithm without control.
Several prior works have shown that language models (LMs) can generate text containing harmful social biases and stereotypes. While decoding algorithms play a central role in determining properties of LM generated tex...
详细信息
ISBN:
(纸本)9798350396904
Several prior works have shown that language models (LMs) can generate text containing harmful social biases and stereotypes. While decoding algorithms play a central role in determining properties of LM generated text, their impact on the fairness of the generations has not been studied. We present a systematic analysis of the impact of decoding algorithms on LM fairness, and analyze the trade-off between fairness, diversity and quality. Our experiments with top-p, top-k and temperature decoding algorithms, in open-ended language generation, show that fairness across demographic groups changes significantly with change in decoding algorithm's hyper-parameters. Notably, decoding algorithms that output more diverse text also output more texts with negative sentiment and regard. We present several findings and provide recommendations on standardized reporting of decoding details in fairness evaluations and optimization of decoding algorithms for fairness alongside quality and diversity.
We analyze a new group-testing scheme, termed semi-quantitative group testing, which may be viewed as a concatenation of an adder channel and a discrete quantizer. Our focus is on non-uniform quantizers with arbitrary...
详细信息
We analyze a new group-testing scheme, termed semi-quantitative group testing, which may be viewed as a concatenation of an adder channel and a discrete quantizer. Our focus is on non-uniform quantizers with arbitrary thresholds. For the most general semi-quantitative group-testing model, we define three new families of sequences capturing the constraints on the code design imposed by the choice of the thresholds. The sequences represent extensions and generalizations of Bh and certain types of super-increasing and lexicographically ordered sequences, and they lead to code structures amenable for efficient recursive decoding. We describe the decoding methods and provide an accompanying computational complexity and performance analysis.
暂无评论