iosr-JECE   Volume-6 ~ Issue-6

Abstract: Today availability of e- resources in a college library is very common. But their proper and maximum use is a matter for discussion. The present paper examines the existence of various e- resource databases in Siddhivinayak technical campus college library. The study also highlights the preferences and importance of online resources among the teacher and students.

[1]. Madhusudan M, "use of UGC infonet e- journals by research scholars of university of Delhi,Delhi", Library Hi Tech, Vol.26 No.3. pp. 369-386.
[2]. Narayana poornima and Goudar IRN, " E- Resources Management ( ICIM2005), 22-25 Feb2005, P 1-19.
[3]. Kaur Amritpal, use of E- resources by teachers and researches of the Science and Engineering & Technology Faculties in guru Nanak Dev University: A Survey .in NACLIN 2006, p267-285.
[4]. RenWick Shamin,Knoweledge and use electronic Resources by medical Science Faculty at the university of the West indies. Libri, Vol.43, No.3, 2004, p58-64.
[5]. Kaur Baljinder & verma Rama, use of electronic resoueces at TIET Library Patiala: A Case Study. ILA Bulletin, Vol.42, no.3, 2006,p 18-20.
[6]. Eqbal Monawwer & Khan Azhar Shah, use of Electronic journals by research Scholars of Faculty of Science and Faculty Of Engineering, In: NACLIN2007, P309-319.
[7]. Chetan Sharma, Use and impact of E- Resources at Guru Gobind Singh Indraprastha university (india): A Case study.Vol.10 No.1,2009.
[8]. Naqvi shehbaz Husain, Use of electronic Resources at Jamia Millia (A Central university): A case Study, In: NACLIN 2007, p320-324.
[9]. Navijyoti, A snapshot of E- journals' Adopters (Research Scholars) of Guru Nanak Dev university, In: NACLIN 2007,p432-442.
[10]. Kennedy,P (2004), "Dynamic Web Pages and the library Catalogue", The Electronic library, Vol.22 No. 6. Pp.480-6.

Abstract: This paper describes a study on a baseband data transmission system developed for undergraduate students studying communication engineering. Theoretical material, developed in the lectures, is briefly covered. A practical system is presented with pre-detection filtering being employed to improve the bit error rate. A simulation of the complete system is carried out on a Sun work station using the MATLAB simulation package. Simulation and theoretical results are compared.

[1] Modelling of a Baseband Data Transmission System by Communication Engineering Group, School of Engineering, Sheffield
Hallam University,Pond St., Sheffield, UK.2007
[2] Matlab Reference Guide, 1992, The Mathworks Inc.& Matlab User‟s Guide, 1992, The Mathworks Inc.
[3] Krauss TP, Shure L, Little JN: "Signal Processing Toolbox", 1992, The Mathworks Inc.
[4] King RW: "Speech signal analysis synthesis and recognition exercise using MATLAB", Int. J. Elect. Eng. Educ., vol. 34, pp- 161-
172, 1997.
[5] Medeiro CR, O‟Reilly JJ: "Simulation of lightwave systems using COMDISCO", 4th Bangor Symposium on Communications, 22-
28 May, pp. 98-101, 1992.
[6] Sanmugan KS, et al, "Simulation-based CAD tools for communication and signal processing systems", IEEE Intn. Conf. on
Communs., Boston, June 11-14, 1989.
[7] Ahmadi J, et al: "Development of all-digital QSPK modem for mobile satellite application using COSSAP", 4th Bangor
Symposium on Communications, 22-28 May, pp. 106-111, 1992.
[8] COSSAP from SYNOPSYS at http://www.synopsys.com/
[9] OPNET Modeler from MIL 3 Inc.: http://www.mil3.com
[10] Ptolemy at http://ptolemy.eecs.berkeley.edu

Abstract: The most powerful channel coding schemes, namely, those based on turbo codes and LPDC (Low density parity check) codes have in common principle of iterative decoding. Shannon's predictions for optimal codes would imply random like codes, intuitively implying that the decoding operation on these codes would be prohibitively complex. A brief comparison of Turbo codes and LDPC codes will be given in this section, both in term of performance and complexity. In order to give a fair comparison of the codes, we use codes of the same input word length when comparing. The rate of both codes is R = 1/2. However, the Berrou's coding scheme could be constructed by combining two or more simple codes. These codes could then be decoded separately, whilst exchanging probabilistic, or uncertainty, information about the quality of the decoding of each bit to each other. This implied that complex codes had now become practical. This discovery triggered a series of new, focused research programmes, and prominent researchers devoted their time to this new area.. Leading on from the work from Turbo codes, MacKay at the University of Cambridge revisited some 35 year old work originally undertaken by Gallagher [5], who had constructed a class of codes dubbed Low Density Parity Check (LDPC) codes. Building on the increased understanding on iterative decoding and probability propagation on graphs that led on from the work on Turbo codes, MacKay could now show that Low Density Parity Check (LDPC) codes could be decoded in a similar manner to Turbo codes, and may actually be able to beat the Turbo codes [6]. As a review, this paper will consider both these classes of codes, and compare the performance and the complexity of these codes. A description of both classes of codes will be given.

[1] L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, Optimal decoding of linear codes for minimizing symbol error rate, IEEE Transactions on Information Theory, vol. 20, IEEE, 1974, pp. 284–287.

[2] John R. Barry, Low-density parity-check codes, Tech. report, Georgia Institute of Technology, 2001.

[3] C. Berrou, A. Glavieux, and P. Thitimajshima, Near shannon limit error-correcting coding and decoding: Turbo-codes, Proceedings ICC (Geneva), IEEE, May 1993, pp. 1064–1070.

[4] Kjetil Fagervik, Iterative decoding of concatenated codes, Ph.D. thesis, University of Surrey (UNIS), UK, August 1998.

[5] R. G. Gallager, Low density parity check codes, Research monograph series, no. 21, MIT Press, Cambridge, MA, 1963.

[6] David J.C. MacKay and Radford M. Neal, Near Shannon limit performance of low density parity check codes, Electronics Letters 32 (1996), no. 18, 1645– 1646, Reprinted in Electronics Letters, 33 (1997), no. 6, 457-458.