Graph-theoretic construction of low-density parity-check codes

This article presents a graph-theoretic method for constructing low-density parity-check (LDPC) codes from connected graphs without the requirement of large girth. This method is based on finding a set of paths in a connected graph, which satisfies the constraint that any two paths in the set are either disjoint or cross each other at one and only one vertex. Two trellis-based algorithms for finding these paths are devised. Good LDPC codes of practical lengths are constructed and they perform well with iterative decoding.     

Effect of maleic acid content on the thermal stability, swelling behaviour and network structure of gelatin-based hydrogels prepared by gamma irradiation

The highly swelling Poly (acrylamide/maleic acid/gelatin) P(AAm/MA/G) hydrogels were prepared by gamma-irradiation at low dose rate (0.94 kGy/h) and moderate dose rate (3.84 kGy/h). The hydrogels were confirmed by FTIR. The effect of copolymer composition, dose and dose rate on the swelling behaviour was discussed. Increasing of MA content and G in the initial mixture leads to an increase in the amount of MA and G in the gel system and decrease in the gelation %. The swelling behaviours of the hydrogel prepared at moderate dose rate increased with increasing MA mole content in the gel system but, there is no systematic dependence of swelling on MA content was observed for the hydrogels obtained at low dose rate. Pore structure of the hydrogels was monitored by using scanning electron microscopy. Thermogravimetric analysis (TGA) and the rate of the thermal decomposition of P(AAm/MA/G) hydrogels has been evaluated to give a better understanding of the thermal stability of polymers, The X-ray data of P(AAm/MA/G) hydrogels was discussed to investigate some features namely the degree of ordering and crystallite size.     

Histological technique to detect the physiological age of the malaria vector mosquito Anopheles pharoensis (Diptera: Culicidae)

The risk of malaria recurrence increases due to the main vector, Anopheles pharoensis. The physiological age of the mosquito population is needed to expect malaria vector dynamics. The number of completed gonotrophic cycles is of great importance in determining the physiological age of females. A technique has been described that focuses on the number of dilatations remaining in the ovarioles after each oviposition to determine how many blood meals have been taken. At each gonotrophic cycle, the chances of infection of the vectors are repeated. The histological changes that occur immediately in the ovarioles and ovulation itself were studied. Under the influence of the contractions of the ovarian muscles, the eggs begin to move over the distal end of the ovariole into the inner oviduct. The terminal pedicle is markedly dilated near the diameter of the eggs. After the expulsion of the mature eggs, ovariole dilations were found at the point of their development in the terminal pedicle due to the accumulation of nurse cell remnants and follicular epithelium. The results were used to develop epidemiological localization and to evaluate the effectiveness of antimalaria interventions. The ovarian inspection often provides a technique to distinguish nulliparous from parous female anophelines. In addition, this study can provide basic entomological knowledge on the physiological age of mosquitoes by considering the histological changes in the ovaries, which allow the evaluation of vector management strategies in the field.     

A universal neural net with guaranteed convergence to zero systemerror

A learning algorithm with guaranteed convergence to zero system error is developed. The algorithm also has high potential to converge fast. The basic idea is to let the net grow when stopping at a local minimum, so that the original local minimum is no longer a local minimum with regard to the new net, and the new net always starts from a point with less error than that in the original local minimum. By this method, the error is guaranteed to decrease until it converges to zero. The technique can also be used to make the error to be as small as desired when the backpropagation algorithm reaches a global minimum which does not achieve zero error due to a lack of sufficient number of nodes. When expanding the neural net, the initial weights of the new node can be selected to maximize the error gradient. A mathematical proof of the guaranteed learning of the universal neural net is given, and numerical examples illustrate its high potential for fast learning     

Asymptotical performance of M-ary and binary signals overmultipath/multichannel Rayleigh and Rician fading

This paper presents a general framework for computing the asymptotic error probability (i.e., at high average SNRs) of M-ary and binary signaling schemes over Rician and Rayleigh fading diversity channels. A general theorem (Theorem 1) relates the asymptotic error rate of multipath and multichannel receivers (over AWGN, ISI free channels) to the multidimensional integral of the conditional error probability. Two other theorems are presented for the particular cases where the conditional error probability is a function of the sum of received SNRs (Theorem 2) or received amplitudes (Theorem 3). Theorems 2 and 3 are related for linear coherent systems, and closed form expressions are obtained for equal gain combining systems. Detection structures for typical diversity schemes (coherent/noncoherent maximal ratio and equal gain combining, and quadratic noncoherent combining) are considered. We analyze the asymptotic error rates of some M-ary signaling schemes (MPSK/MPAM with Kth order diversity and orthogonal signals with K=1 and with coherent and noncoherent detection). Binary signaling is also considered in our study     

Construction of non-binary quasi-cyclic LDPC codes by arrays and array dispersions - [transactions papers]

This paper presents two algebraic methods for constructing high performance and efficiently encodable nonbinary quasi-cyclic LDPC codes based on arrays of special circulant permutation matrices and multi-fold array dispersions. Codes constructed based on these methods perform well over the AWGN and other types of channels with iterative decoding based on belief-propagation. Experimental results show that over the AWGN channel, these non-binary quasi-cyclic LDPC codes significantly outperform Reed-Solomon codes of the same lengths and rates decoded with either algebraic hard-decision Berlekamp-Massey algorithm or algebraic soft-decision K?tter- Vardy algorithm. Also presented in this paper is a class of asymptotically optimal LDPC codes for correcting bursts of erasures. Codes constructed also perform well over flat fading channels. Non-binary quasi-cyclic LDPC codes have a great potential to replace Reed-Solomon codes in some applications in communication environments and storage systems for combating mixed types of noises and interferences.     

Two-dimensional burst identification codes and their use in burstcorrection

A new class of codes, called burst identification codes, is defined and studied. These codes can be used to determine the patterns of burst errors. Two-dimensional burst correcting codes can be easily constructed from burst identification codes. The resulting class of codes is simple to implement and has lower redundancy than other comparable codes. The results are pertinent to the study of radiation effects on VLSI RAM chips, which can cause two-dimensional bursts of errors     

Constrained block codes for class-IV partial-response channels withmaximum-likelihood sequence estimation

Significant improvements in magnetic storage densities have been made feasible by the application of partial-response signaling combined with maximum-likelihood sequence estimation. To enhance the performance of this technique when applied to the class-IV partial-response channel, which is recognized as being appropriate to model the magnetic recording channel, it is often required to bound the number of consecutive zeros in the recorded data sequence and its odd and even subsequences. We investigate block codes that satisfy such a constraint. In particular, we look for a set of maximal number of fixed-length sequences such that any pair of them can be concatenated without violating the constraint. In many cases, depending on the constraint and the length of the sequences, we determine such a set, and in the remaining cases, we determine at most three candidates for it. These results are used to study the best possible constrained block codes     

Partial fraction evaluation of rational z-transforms

A method for expanding rational z-transforms in terms of partial fractions is presented. The method involves solving a system of linear equations. The computational complexity of this method is also discussed     

Moment Balancing Templates: Constructions to Add Insertion/Deletion Correction Capability to Error Correcting or Constrained Codes

Templates are constructed to extend arbitrary additive error correcting or constrained codes, i.e., additional redundant bits are added in selected positions to balance the moment of the codeword. The original codes may have error correcting capabilities or constrained output symbols as predetermined by the usual communication system considerations, which are retained after extending the code. Using some number theoretic constructions in the literature, insertion/deletion correction can then be achieved. If the template is carefully designed, the number of additional redundant bits for the insertion/deletion correction can be kept small-in some cases of the same order as the number of parity bits in a Hamming code of comparable length.