National Institute of Technology Calicut

CSU 353 MOBILE COMMUNICATION SYSTEMS

Prerequisite: CSU 304 Computer Networks

 

L	T	P	Cr
3	0	0	3

Module I (8 Hours)

Introduction, wireless transmission - frequencies for radio transmission - signals - antennas - signal propagation - multiplexing - modulation - spread sprectrum - cellular systems - medium access control - specialized MAC - SDMA - FDMA - TDMA - aloha - CSMA - collision avoidance - polling - CDMA - comparison of S/T/F/CDMA

 

Module II (10 Hours)

Telecommunication systems - mobile services - system architecture - radio interface - protocols - localization and calling - handover - security - new data services - satellite systems- broadcast systems - digital audio broadcasting - digital video broadcasting, WDM Optical networks.

 

Module III (12 Hours)

Wireless LAN - infrared Vs radio transmissions - infrastructure and adhoc networks - IEEE 802.11 b/a/g - bluetooth - IEEE 802.16, Mobile network layer - mobile IP - packet delivery - registration - tunneling and encapsulation - optimizations - reverse tunneling - dynamic host configuration protocol

Module IV (12 Hours)

Adhoc networks - routing - algorithms - metrics - mobile transport layer - TCP - indirect TCP - snooping TCP - mobile TCP - retransmission - recovery - transaction oriented TACP - support for mobility - file systems - WWW - WAP - architecture - datagram protocol - transport security - transaction protocol - session protocol - application - environment - WML - WML script - wireless telephony application. 

References

1. 
   Schiller J., Mobile Communications, 2/e, Pearson Education, 2003.
   
2. 
   C. Siva Ram Murthy, Ad Hoc Wireless Networks: Architectures and Protocols, Pearson Education, 2004.
   
3. 
   C. Siva Ram Murthy, WDM Optical Networks: Concepts, Design, and Algorithms, Pearson Education.
   
4. 
   Singhal et.al S., The Wireless Application Protocol, Addison Wesley
   

CSU 315 COMPUTER HARDWARE

Prerequisite: CSU 202 Logic Design

L	T	P	Cr
3	0	0	3

Module I (8 Hours)

PC hardware: motherboard, memory SDRAM, RDRAM Adapters – graphic adapter, network adapter. Controllers, floppy and hard disk controllers, streamers and other drives, Interfaces - parallel and serial interfaces, keyboard, mice and other rodents, the power supply, operating system, BIOS, and memory organization. 8086/8088 Hardware specification: clock generator, bus buffering and latching, bus timing, ready and wait states, minimum and maximum mode operations. Features of Pentium IV processor



Module II (12 Hours)

Microprocessor architecture: real mode and protected mode memory addressing, memory paging. Addressing modes: data addressing, program memory addressing, stack memory addressing. Data movement instructions, Arithmetic and logic instructions, Program control instructions, Programming the microprocessor: modular programming, using keyboard and display, data conversions, disk files, interrupt hooks, using assembly language with C/C++.

 

Module III (13 Hours)

Memory interface: memory devices, address decoding, 16 bit (8086), 32 bit (80486) and 64 bit (Pentium) ,Hardware architecture for embedded systems-processor-memory-latches and buffers-display unit-16 and 32 bit processors. Memory interfaces, dynamic RAM. I/O interface: port address decoding, PPI, 8279 interface, 8254 timer interface, 16550 UART interface, ADC/DAC interfaces.

 

Module IV (9 Hours)

Interrupts: interrupt processing, hardware interrupts, expanding the interrupt, 8259A programmable interrupt controller. DMA: DMA operation, 8237 DMA controller, shared bus operation, disk memory systems, video displays.

Bus interface: ISA bus, EISA and VESA buses, PCI bus.

 

References:

1. B. B. Brey, The Intel Microprocessors 8086 to Pentium: Architecture, Programming and Interface, 6/e,

Prentice Hall of India, New Delhi, 2003.

2. Programming for embedded systems Dream Software team , Willey 2002

3. H. P. Messmer, The Indispensable PC Hardware Book, 3/e, Addison Wesley, 1997.

4. A. K. Ray, and K. M. Bhurchandi, Advanced Microprocessors and Peripherals, Tata McGraw Hill, 2000.

5. D. V. Hall, Microprocessors and Interfacing: Programming and Hardware, 2/e, Tata McGraw Hill, New Delhi, 1992.

6. K. Miller, An Assembly Language Introduction to Computer Architecture using the Intel Pentium, Oxford University

Press, 1999.

7. S. J. Bigelow, Troubleshooting, Maintaining, and Repairing PCs, 2/e, Tata McGraw Hill, New Delhi, 1999.

 

CSU 333 OBJECT ORIENTED ANALYSIS AND DESIGN
Pre-requisite: CSU 203 Data Structures and Algorithms

L	T	P	Cr
3	0	0	3

Module I (10 Hours)

Introduction to Object-Oriented paradigm – The need, Examples – Basic notations and conventions. Object-oriented Modeling Concepts – Objects, Classes, Relationships, Encapsulation, Message sending, Inheritance, Polymorphism.

Module II (10 Hours)

Unified Modeling Language – Types of models – Use-case diagrams – Class diagrams – Object diagrams – Sequence diagrams – Collaboration diagrams – state-chart diagrams, Activity diagrams – Component diagrams – Deployment diagrams

Module III (10 Hours)

Introduction to Design Patterns – Creational Patterns, Structural Patterns, Behavioral Patterns, Case Study.

Module IV (12 Hours)

Object Oriented Testing Methodologies – Implications of Inheritance on Testing, State based Testing, Adequacy and Coverage, Scenario based Testing, Testing Work Flow, Case Studies, Object Oriented Metrics.

References:

1. Erich Gamma, Richard Helm, Ralph Johnson, John M.Vlissides, Design Patterns: Elements of Reusable Object-Oriented Software, Addison-Wesley Professional Computing Series, 1995.

2. James O.Coplien, Advanced C++ Programming Styles and Idioms, Addison Wesley, 1991.

3. Peter Coad and Edward Yourdon, Object-Oriented Analysis, Prentice Hall, 1990.

4. Margaret A. Ellis, Bjarne Stroustrup, Annotated C++: Reference Manual, Addison-Wesley Professional, 1990.

5. Booch G. Rumbaugh J & Jacobsons I, The Unified Modeling Language user guide, Addison Wesley. 1999.

6. Bahrami A, Object Oriented System Development, Mc Graw Hill, 1998.

CSU 334 WEB PROGRAMMING
Pre-requisite: CSU 304 Computer Networks

L	T	P	Cr
3	0	0	3

Module I (10 Hours)

Internet and WWW, Creating Web Graphics, HTML, Paintshop, Photoshop, FrontPage, Introduction to XHTML, Cascading Style Sheets.

Module II (12 Hours)

Introduction to Scripting, JavaScript: Control Statements, Functions, Arrays, Objects, Dynamic HTML: Object Model and Collections, Filters and Transitions, Data Binding with Tabular Data Control

Module III (10 Hours)

Building Interactive Animations, Extensible Markup Language (XML), Web Servers, Database: SQL, MySQL, DBI and ADO.NET,

Module IV (10 Hours)

Active server pages, CGI and Perl, PHP, Case Studies.

1. 
   References:
   

1. 
   H. M. Deitel, P. J. Deitel and T. R. Nieto, Internet and World Wide Web: How To Program, Pearson Education, 2000.
   
2. 
   Harvey Deitel, Paul Deitel, Tem Nieto, Complete Internet & World Wide Web Programming Training Course, Student Edition, 2/e, Prentice Hall , 2002
   

CSU 431 ADVANCED DATABASE MANAGEMENT SYSTEMS
Pre-requisite: CSU 213 Database Management Systems

L	T	P	Cr
3	0	0	3

Module I (10 Hours)

 Overview of relational database concept - object oriented database - overview of CORBA standard for distributed objects.

Module II (10 Hours)

Distributed database concepts - overview of client - server architecture and its relationship to distributed database, Deductive database - basic inference mechanism for logic programs.

Module III (10 Hours)

Data warehousing and data mining - database on the World Wide Web - multimedia database - mobile database - geographic information system - digital libraries.

Module IV (12 Hours)

Oracle and microsoft access - basic structure of the oracle system, database structures and its manipulation in oracle - programming oracle applications - oracle tools - an overview of microsoft access features and functionality of access - distributed databases in oracle.

References:

1. Elmasri, Navathe, Somayajulu, Gupta, Fundamentals of Database Systems, Pearson Education, 2006.

2. Ramakrishnan R. & Gehrke J Database Management Systems, 3^rd Edition., McGraw Hill.

3. Connolly and Begg, Database systems, 3^rd Edition, Pearson Education, 2003

4. O'neil P. & O'neil E Database Principles, Programming and Performance, 2^nd Edition., Harcourt Asia (Morgan Kaufman).

5. Silberschatz, Korth H. F. & Sudarshan S, Database System Concepts, Tata McGraw Hill.

CSU 441 ADVANCED COMPUTER ARCHITECTURE
Pre-requisite: CSU 215 Computer Organization

L	T	P	Cr
3	0	0	3

Module I (5 Hours)

Parallel Computation, Performance, Programming models, algorithms, evaluation 

Module II (13 Hours)

Shared Memory Multiprocessors, Memory Consistencey models, snoop based design, scalability, directory based cache coherence

Module III (12 Hours)

Relaxed memory Consistency, Interconnection network design, Latency tolerance techniques, Multithreading architectures

Module IV (12 Hours)

Advanced Topics: Selected Topics from Superscalar Design, Classical papers in Computer architecture, quantum architecture, Processor based Security

References:

1. Culler D and Singh J. P., Parallel Computer Architecture: A Hardware Software Approach, Harcourt Asia Pte Ltd, Singapore, 1999.

2. Hill M, Jouppi N and Sohi G, Readings in Computer Architecture, Morgan Kauffman, 2000.

3. 
   Shen J. P. and Lipasti M.,, Modern Processor Design: Fundamentals of Superscalar Processors, McGraw Hill, First edition, 2000.
   

CSU 352 CODING THEORY
Pre-requisite: CSU 201 Discrete Computational Structures

L	T	P	Cr
3	0	0	3

Module I (12 Hours)

Review of linear algebra - Linear codes and syndrome decoding. Generator and parity check matrices. Hamming geometry and code performance. Hamming codes. Error correction and concept of hamming distance.

Module II (8 Hours)

Cyclic codes – Bose, Ray-Chaudhuri, Hocquenghem – BCH codes, RS codes – Polynomial time decoding. Shift register encoders for cyclic codes. Cyclic hamming codes. Decoding BCH – key equation and algorithms. Berlekamp's Iterative Algorithm for Finding the Error-Locator Polynomial.

Module III (12 Hours)

Convolutional codes – Viterbi decoding. Concept of forward error correction. State diagram, trellises.

Concept of space time codes. Space Time Trellis codes. Path enumerators and proof of error bounds.

Applications to wireless communications.

Module IV (10 Hours)

Graph theoretic codes – concept of girth and minimum distance in graph theoretic codes. Expander Graphs and Codes – linear time decoding. Basic expander based construction of list decodable codes. Sipser Spielman algorithm. Bounding results.

References:

1. R.J. McEliece, The Theory of Information and Coding, Addison Wesley, 1997.

2. R. Johannesson, K. Sh. Zigangirov, Fundamentals of Convolutional Coding, Universities Press, 2001.

3. Van Lint, J. H. An Introduction to Coding Theory, 2nd ed. New York: Springer-Verlag, 1992.