Please use this identifier to cite or link to this item:
http://localhost:8081/xmlui/handle/123456789/9629
Title: | LAY-OUT DESIGN OF ENCODER AND DECODER CHIP FOR MOBILE APPLICATIONS |
Authors: | Kumar, Satyendra |
Keywords: | ELECTRONICS AND COMPUTER ENGINEERING;LAY-OUT DESIGN ENCODER AND DECODER CHIP;MOBILE APPLICATIONS;FINITE STTATE MODEL |
Issue Date: | 2002 |
Abstract: | In convolutional codes, the encoding operation may be viewed as the discrete-time convolution of the input sequence with the impulse response (or generator polynomial) of the encoder. The convolutional encoder employs a sequential model for encoding the data. Every transmission of data is characterized by a change in state (called the FINITE STATE MODEL) of the system. Therefore, tracking the state of the system is equivalent to tracking the data that is sent. This is the principle of the convolutional encoder/decoder. The Viterbi decoder accepts the noisy encoded bit sequence and attempts to recover the information content of the original encoded message. This is done by iteratively computing the Hamming (hard-decision decoding) distances between the received code word and the possible transmitted 2k code words then the code word that was closest in distance to the received code word is selected. In this dissertation the designs of Convolutional encoder and Viterbi decoder are described in Verilog-HDL, then simulated and verified with a noise adder on ModelSim and . VCS and then synthesized on Synopsys tool. Finally the Layout of the Convolutional encoder and Viterbi decoder chips are generated using Tanner Tools. L-Edit was used for this purpose and the L-Edit/SPR TM module of this tool was utilized. 3 IIT |
URI: | http://hdl.handle.net/123456789/9629 |
Other Identifiers: | M.Tech |
Research Supervisor/ Guide: | Joshi, R. C. Sarkar, S. |
metadata.dc.type: | M.Tech Dessertation |
Appears in Collections: | MASTERS' THESES (E & C) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ECDG10945.pdf | 5.88 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.