Write a program which collects in data samples, Computer Engineering

Assignment Help:

Write a program which collects in data samples from a port at 1 ms interval. The upper 4 bits collected data same as mastered and stored in an array in successive locations.

; REGISTERS: Uses CS, SS, DS, AX, BX, CX, DX, SI, SP

; PROCEDURES: Uses WAIT

DATA_SEG       SEGMENT

            PRESSURE DW 100 DUP (0); Set up array of 100 words

NBR_OF_SAMPLES EQU 100    

            PRESSURE_PORT EQU 0FFF8h     ; hypothetical input port

DATA_SEG       ENDS

STACK_SEG SEGMENT STACK

            DW 40    DUP (0)    ; set stack of 40 words

STACK_TOP   LABEL WORD

STACK_SEG   ENDS

 

CODE_SEG SEGMENT

            ASSUME CS: CODE_SEG, DS: DATA_SEG, SS: STACK_SEG

START:           MOV   AX, DATA_SEG; Initialise data segment register

MOV DS, AX  

MOV AX, STACK_SEG   ; Initialise stack segment register

MOV SS, AX  

MOV SP, OFFSET STACK - TOP    ; initialise stack pointer top of 

                                                ; stack

LEA SI, PRESSURE; SI points to start of array 

     ; PRESSURE

MOV BX, NBR_OF_SAMPLES   ; Load BX with number

                        ; Of samples

MOV DX, PRESSURE_PORT   ; Point DX at input port

                                                ; It can be any A/D converter or 

                                                ; Data port.

READ_NEXT: IN AX, DX   ; Read data from port

            ; Please note use of IN instruction

            AND AX, 0FFFH; Mask upper 4 bits of AX

            MOV [SI], AX   ; Store data word in array

            CALL WAIT   ; call procedures wait for delay  

INC SI; Increment SI by two as dealing with 

INC SI; 16 bit words and not bytes

DEC BX; Decrement sample counter

JNZ READ_NEXT   ; Repeat till 100

      ; Samples are collected

STOP: NOP    

WAIT   PROC NEAR  

            MOV CX, 2000H   ; Load delay value

                                     ; Into CX

HERE:   LOOP HERE   ; Loop until CX = 0

            RET    

WAIT   ENDP    

CODE_SEG ENDS    

END    

Discussion:

Please consider that CALL to the procedure as above doesn't specify whether the call is to a FAR procedure or a NEAR procedure. This distinction is made at the time of defining the procedure. 

 

The procedure above can be converted in a FAR procedure by changing the definition of procedure as below:

WAIT              PROC FAR

 .

 .

WAIT             ENDS

The procedure can now be statedin another segment if the need to be, in same assembly language file.


Related Discussions:- Write a program which collects in data samples

Loosely coupled systems, Loosely Coupled Systems These systems do not d...

Loosely Coupled Systems These systems do not distribute the global memory because shared memory concept gives rise to the difficulty  of memory conflicts, which in turn slows d

Why did some plug-ins disappear for 0.99.19, Some of the plug-ins have prov...

Some of the plug-ins have proven unstable. These have been moved into a split download, which should be available anywhere you got the GIMP, in the file gimp-plugins-unstable-VERSI

Explain the register transfer language, Explain the Register transfer langu...

Explain the Register transfer language Register transfer language means there must be data flow between two registers and logic is in between them for end registers data must f

Dynamic partitioning - computer architecture, Dynamic partitioning: To...

Dynamic partitioning: To rise above from difficulties with fixed partitioning, partitioning can be done dynamically, which called dynamic partitioning. Having it, the primary

What are the process states in unix, What are the process states in Unix? ...

What are the process states in Unix? As a process implements it changes state according to its circumstances. Unix processes have the following states: Running : The process

How many address bits are needed to show a 32 K memory, How many address bi...

How many address bits are required to represent a 32 K memory ? Ans. 32K = 25 x 210 = 215, Hence 15 address bits are needed; Only 16 bits can address this.

Diffrentiate b/w shared memory and distributed memory, Shared Memory  ...

Shared Memory  Shared Memory refers to memory component of a computer system in which the memory can accessed directly by any of the processors in the system. Distributed

#, advantages of dda line algoritm

advantages of dda line algoritm

Combinational logic, At a particular moment in time the output of a COMBINA...

At a particular moment in time the output of a COMBINATIONAL logic circuit depends uponthe inputs to the circuit at the same instant.(Unlike sequential logic circuits where the out

the email interface to submit/change bugs via email, You can search an upd...

You can search an updated README.mailif file in the contrib/ directory of your Bugzilla distribution that walks you by the setup.

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