Time delay and busy flag method, Computer Graphics

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.

Posted Date: 2/23/2013 12:52:38 AM | Location : United States







Related Discussions:- Time delay and busy flag method, Assignment Help, Ask Question on Time delay and busy flag method, Get Answer, Expert's Help, Time delay and busy flag method Discussions

Write discussion on Time delay and busy flag method
Your posts are moderated
Related Questions
Midpoint Circle Generation Algorithm   Just as a line drawing algorithm approximates infinite number of points on a line segment by only a finite number of pixels, a circle dra

To prove: P (u = 0) = p0 Solution : = p 0 B n,0 (u) + p 1 B n, 1 (u) +...... + p n B n, n (u)...............(1)  B n,i (u) = n c i u i (1 - u) n-i B n,0

Derive the common transformation for parallel projection into a specified view plane, here the direction of projection d=aI+bJ+cK is along the normal N=n1I+n2J+n3K along with the r


Write a program that allows interactive manipulation of the position and orientation of a camera. Draw a teapot at the global origin 0,0,0. You can find a shaded teapot model and

when dda algorithm is more efficient than bresenhem line drawing algorithm

QUESTION 1 (a) Write a run method in Image J environment for the following cases Contrast and Brightness Histogram Generation Histogram Equalisation   (b)

Key Frame Systems - computer animation This method is for low-level motion control. In fact these systems comprise languages that are designed simply to produce the in-between

Hypermedia: it is a superset of hypertext. Hypermedia documents comprise links not only to the other pieces of text, although also to other forms of media: sounds and images and m

What is uniform rational splines