Time delay and busy flag method, Computer Graphics

Assignment Help:

1. Using a time Delay Method

The delay required between issuing each character to the LCD is about 5-10ms (it's simply known as DELAY). When programming an LCD, a long delay is also needed for the power-up process, (it's called long delay LDELAY). For the LCD input to be enabled, the short delay is required to make the En signal wide enough.
The data is sent in nibbles in 4-bit mode. The higher nibble is sent first, and then the lower nibble. In order to enable the 4-bit mode of LCD, the follow special sequence of initialization below was used. This is also known as special reset sequence of LCD. The special reset sequence is as follows:

  1. Wait for about 20mS
  2. Then send the first init value (0x20 - for 4-bit and 0x30 for 8-bit)
  3. Wait for about 10mS
  4. Send second init value (0x20)
  5. Wait for 1mS
  6. Send third init value (0x20)
  7. Wait for 1mS
  8. Select bus width (0x20)
  9. Wait for 1mS

The busy flag will only be active after the above reset sequence is completed. The busy flag is not normally used in 4-bit mode; instead I had used a certain amount of delay usually within the range from 300 to 600us or can also write some code for reading two nibbles from the LCD. This delay might vary depending on the LCD used and crystal frequency on which LCD controller is running, but 400us usually works perfectly.

2. Using Busy Flag Method

The Data line D7 is the busy flag, and can be read when R/W=1 and RS=0. When D7 is high i.e. (busy flag =1), the LCD is busy dealing with the internal operations and will not acknowledge any new information. When D7=0, the LCD is ready to receive new information.


Related Discussions:- Time delay and busy flag method

Implement the boundary fill and flood fill algorithm, 1. Implement the boun...

1. Implement the boundary fill algorithm and flood fill algorithm in C-language and use your code to fill two different types of closed areas such as  i)  A Circle ii)  A sel

Algorithms for filled-area primitives, Algorithms for filled-area primitive...

Algorithms for filled-area primitives These algorithms are classified into two categories (i)  Scan line algorithms (ii) Seed fill algorithms.

Explain any ten types of artistic filters, Question 1 Explain any ten type...

Question 1 Explain any ten types of artistic filters Question 2 What is Freehand Tool? Explain the procedure of drawing lines and curves with freehand tool Question 3 Ho

Z- buffer algorithm, Q.   Describe the z- Buffer algorithm for hidden surfa...

Q.   Describe the z- Buffer algorithm for hidden surface removal. Ans. Z- buffer method: This method compares surface depths at each pixel position on the projection plane. T

Adobe premiere - softwares for computer animation, Adobe Premiere - Softwar...

Adobe Premiere - Softwares for computer animation It just like the name as is generated by Adobe. This is a tool used to composite digitized video, stills and applies a variet

Objectives-introduction to computer graphics, Objectives After complet...

Objectives After completing this section, you must be familiar with: explain computer graphics, its characteristics and features; Conversations about applicat

Computer Architecture, How many 128 x 8 RAM chips are needed to provide a m...

How many 128 x 8 RAM chips are needed to provide a memory capacity of 4096 16 bits?

Exemplify bresenham line generation algorithm by digitizing, Example: Exem...

Example: Exemplify the Bresenham line generation algorithm through digitizing the line along with end points (20, 10) and (30, 18) Solution: m =    (y2 - y1)/( x2 - x1)  =

Area-subdivision method-computer graphics, Normal 0 false fal...

Normal 0 false false false EN-US X-NONE X-NONE

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd