2.0 General The main objective of the present study is to assess the suitability of groundwater of the study area for drinking and irrigation. A preliminary survey of works carried out by previous investigators has reflected the suitability of weighted arithmetic index method for assessing the suitability for drinking and evaluation of Electrical Conductivity, SAR and RSC following BIS and CSSR...

A convolutional code C can be naturally viewed as a submodule of the free module F[z]. In this way we can view a convolutional code as dual to a linear, shift invariant and complete behavior. The known representations of linear behaviors carry over by duality to representations for convolutional codes. In the behavioral literature one can find two natural generalized first order forms and we re...

This paper presents the performance evaluation and comparison of various concatenated error correcting codes using Binary Phase Shift Keying (BPSK) modulation scheme. Three concatenated error correcting code pair i.e. Convolutional-Hamming, Convolutional-Cyclic, Convolutional-Bose, Chaudhuri Hocquenghem is designed and the BER performance was measured for an Additive White Gaussian Noise (AWGN)...

This paper presents an iterative decoding algorithm for concatenated codes consisting of a ReedSolomon and a convolutional code, focusing on the code of the DVB-S standard. Existing solutions for the different decoding stages and their interfaces are discussed and their performance is compared. Besides, a new procedure is proposed to define the feedback signal from the output of the Reed-Solomo...

We introduce a joint decoding algorithm for a Huffman source code followed by a convolutional channel code. The algorithm incorporates a restriction to valid Huffman codewords into the convolutional code’s trellis. Performance is improved by this restriction. Furthermore, soft Huffman decoding is implicitly included, and a priori probabilities of input symbols can be easily exploited, if availa...

In this paper we discuss an upper bound on the free distance for a rate k / n convolutional code with complexity b . Using th i s bound we in t roduce the notion of a MDS convolutional code. We also give an algebraic way of cons t ruc t ing b inary codes of rate 1/2 and large complexity. The obta ined distances compare favorably to the distances found by computer searches and probabilistic meth...

Turbo equalizers have been shown to be successful in mitigating the effects of inter-symbol interference introduced by partial response modems and by dispersive channels for code rates of 1 2. In this contribution, we comparatively studied the performance of a range of binary phase-shift keying turbo equalizers employing block-turbo codes, namely Bose–Chaudhuri–Hocquenghen turbo codes, convolut...

This paper presents an iterative decoding algorithm for concatenated codes consisting of a Reed-Solomon and a convolutional code, focusing on the code of the DVB-S standard. Existing solutions for the different decoding stages and their interfaces are discussed and their performance is compared. Besides, a new procedure is proposed to define the feedback signal from the output of the Reed-Solom...

We propose using punctured convolutional code for a Discrete Multitone (DMT) Asymmetric Digital Subscriber Line (ADSL) system to improve the data rate performance of ADSL. The theoretical performance of the systems with single coding rate for all subchannels, and with adaptive coding rate for each subchannel are presented respectively. It is found that the data rate performance of the proposed ...

We address the concept of “minimal polynomial encoder” for finite support linear convolutional codes over Zpr . These codes can be interpreted as polynomial modules which enables us to apply results from the 2007-paper [8] to introduce the notions of “p-encoder” and “minimal p-encoder”. Here the latter notion is the ring analogon of a row reduced polynomial encoder from the field case. We show ...