Downloads: 140 | Views: 262

Research Paper | Electronics & Communication Engineering | India | Volume 2 Issue 11, November 2013 | Popularity: 7 / 10

Rate This Article!      

A Robust UART Implementation for Industrial Applications on FPGA

Nagaraju. A, S. Nagi Reddy

Abstract: This paper describes a novel architecture based on Recursive Running Sum (RRS) filter implementation for wire and Wireless data processing. UARTs are used for asynchronous serial data communication between remote embedded systems. The universal asynchronous receiver/transmitter i. e. UART which is the kind of serial communication protocol which allows the full duplex communication in serial link. This paper presents the hardware implementation of a high speed and efficient UART using FPGA. If physical channel is noisy then, serial data bits get corrupted during transmission. The UART core described here, utilizes recursive running sum filter to remove noisy samples. Input data signal is directly sampled with system clock and samples are accumulated over a window size. The window size is user programmable and it should be set to one tenth of required bit period. The intermediate data bit is decoded using magnitude comparator. The advantage of this architecture is that baud rate is decided by the window size so there is no need of any external timer module which is normally required for standard UARTs. The Recursive Running Sum (RRS) filter architecture with programmable window size of M is designed and modules are implemented with VHDL language. This project implementation includes many applications in wireless data communication Systems like RF, Blue tooth, WIFI, ZigBee wireless sensor applications. Total coding written in VHDL language. Simulation in Modelsim Simulator, Synthesis done by XILINX ISE 9.2i. Synthesis result is verified by the Chipscope. Input signal given from the keyboard and output is seen by the help of HyperTerminal.

Keywords: Robust UART, RRS filer, data processing, communication, noise

Edition: Volume 2 Issue 11, November 2013

Pages: 117 - 120

Click to Cite this Article

Similar Articles