Implementation of a program to communicate data to another 8051-microcontroller  using USART module of 8051.(using Keil and 8051 burners)

Experiment No.: – 10

Aim of the experiment: –

Implementation of a program to communicate data to another 8051-microcontroller  using USART module of 8051.(using Keil and 8051 burners)

Apparatus required: –

Sl. No.NameSpecificationQuantity

Algorithm: –

Aim of the experiment: –

Implementation of a program to add and subtract two 8-bit and 16-bit numbers using  different addressing modes.

Apparatus required: –

Sl. No.NameSpecificationQuantity
18086 Microprocessor Kit1 no.
2Keyboard1 no.
Table No. 2.1

Algorithm for 8-bit Addition: –

  1. Start.
  2. Load 00H into CL Register (for Carry).
  3. Load the 1st data into AL Accumulator from Memory.
  4. Load the 2nd data into BL Register from Memory.
  5. Add BL with Accumulator AL.
  6. Jump if no Carry.
  7. Increment CL by 1.
  8. Move data from AL to memory location.
  9. Move data from CL to memory location.
  10. Stop.

Program: –

Memory AddressMnemonicsOpcodeComments
1000:0100MOV CL, 00HB1 00[CL] <- 00H
1000:0102MOV AL, [3000H]A0 00 30[AL] <- [3000H]
1000:0105MOV BL, [3001H]8A 1E 01 30[BL] <- [3001H]
1000:0109ADD AL, BL02 C3[AL] <- [AL] + [BL]
1000:010BJNC Loop173 02Jump if no carry
1000:010DINC CLFE C1[CL] <- [CL] + 1
1000:010FLoop1: MOV [3002H], ALA2 02 30[3002H] <- [AL]
1000:0112MOV [3003H], CL88 0E 03 30[3003H] <- [CL]
1000:0116HLTF4Stop
Table No. 2.2

Result: –

\[\color{\orange}{Input:}\] \[\color{\green}{3000H—> FFH}\] \[\color{\green}{3001H—>12H}\] \[\color{\red}{Output:}\] \[\color{\red}{3002H—>11H}\] \[\color{\red}{3003H—>01H}\]

Algorithm for 8-bit Subtraction: –

  1. Load 00H into CL Register (for Carry).
  2. Load the 1st data into AL Accumulator from Memory.
  3. Load the 2nd data into BL Register from Memory.
  4. Subtract BL from Accumulator AL.
  5. Jump if no borrow.
  6. Increment CL by 1.
  7. Move data from AL to memory location.
  8. Move data from CL to memory location.
  9. Stop.
Memory AddressMnemonicsOpcodeComments
1000:0100MOV CL, 00HB1 00[CL] <- 00H
1000:0102MOV AL, [3000H]A0 00 30[AL] <- [3000H]
1000:0105MOV BL, [3001H]8A 1E 01 30[BL] <- [3001H]
1000:0109SUB AL, BL2A C3[AL] <- [AL] – [BL]
1000:010BJNC Loop173 02Jump if no borrow
1000:010DINC CLFE C1[CL] <- [CL] + 1
1000:010FLoop1: MOV [3002H], ALA2 02 30[3002H] <- [AL]
1000:0112MOV [3003H], CL88 0E 03 30[3003H] <- [CL]
1000:0116HLTF4Stop
Table No. 2.3

Result: –

\[\color{\orange}{Input:}\] \[\color{\green}{3000H—> F8H}\] \[\color{\green}{3001H—>FFH}\] \[\color{\red}{Output:}\] \[\color{\red}{3002H—>F9H}\] \[\color{\red}{3003H—>01H}\]

Algorithm for 16-bit Addition: –

  1. Load 0000H into CX Register (for Carry).
  2. Load the 1st data into AX Accumulator from Memory.
  3. Load the 2nd data into BX Register from Memory.
  4. Add BX with Accumulator AX.
  5. Jump if no Carry.
  6. Increment CX by 1.
  7. Move data from AX to memory location.
  8. Move data from CX to memory location.
  9. Stop.
Memory AddressMnemonicsOpcodeComments
1000:0100MOV CX,0000HB9 00 00 [CX] <- 0000H
1000:0103MOV AX, [3000H]A1 00 30[AX] <- [3000H]
1000:0106MOV BX, [3002H]8B 1E 02 30[BX] <- [3002H]
1000:010AADD AX,BX03 C3[AX] <- [AX] + [BX]
1000:010CJNC STORE73 01Jump if no carry
1000:010EINC CX41[CX] <- [CX] + 1
1000:010FSTORE: MOV [3004H], AXA3 04 30[3004H] <- [AX]
1000:0112MOV [3006H], BX89 0E 06 30[3006H] <- [CX]
1000:0116HLTF4Stop
Table No. 2.4

Result: –

\[\color{\orange}{Input:}\] \[\color{\green}{3000H—> E9H}\] \[\color{\green}{3001H—>FFH}\] \[\color{\green}{3002H—>ABH}\] \[\color{\green}{3003H—>F8H}\] \[\color{\red}{Output:}\] \[\color{\red}{3004H—>94H}\] \[\color{\red}{3005H—>F8H}\] \[\color{\red}{3006H—>01H}\] \[\color{\red}{3007H—>00H}\]

Algorithm for 16-bit Subtraction: –

  1. Load 0000H into CX Register (for Carry).
  2. Load the 1st data into AX Accumulator from Memory.
  3. Load the 2nd data into BX Register from Memory.
  4. Subtract BX from Accumulator AX.
  5. Jump if no borrow.
  6. Increment CX by 1.
  7. Move data from AX to memory location.
  8. Move data from CX to memory location.
  9. Stop.
Memory AddressMnemonicsOpcodeComments
1000:0100MOV CX, 0000HB9 00 00 [CX] <- 0000H
1000:0103MOV AX, [3000H]A1 00 30[AX] <- [3000H]
1000:0106MOV BX, [3002H]8B 1E 02 30[BX] <- [3002H]
1000:010ASBB AX,BX1B C3[AX] <- [AX] – [BX]
1000:010CJNC STORE73 01Jump if no borrow
1000:010EINC CX41[CX] <- [CX] + 1
1000:010FSTORE: MOV [3004H], AXA3 04 30[3004H] <- [AX]
1000:0112MOV [3006H], CX89 0E 06 30[3006H] <- [CX]
1000:0116HLTF4Stop
Table No. 2.5

Result: –

\[\color{\orange}{Input:}\] \[\color{\green}{3000H—> FFH}\] \[\color{\green}{3001H—>12H}\] \[\color{\green}{3002H—>34H}\] \[\color{\green}{3003H—>F1H}\] \[\color{\red}{Output:}\] \[\color{\red}{3004H—>CBH}\] \[\color{\red}{3005H—>11H}\] \[\color{\red}{3006H—>01H}\] \[\color{\red}{3007H—>00H}\]

Conclusion: –

To be written by student.

Previous
Next

Instructions Used –

MOV – for copy data.

ADD – for addition.

SUB/SBB – for subtraction.

JNC – for jump if no carry/borrow.

INC – for increment.

INT A5/HLT – for stop/end.

Program: –

Result: –

Conclusion: –

To be written by student.

Previous
Nest