Browse Prior Art Database

Limited Domain Search Algorithm for Code Optimization

IP.com Disclosure Number: IPCOM000061075D
Original Publication Date: 1986-Jun-01
Included in the Prior Art Database: 2005-Mar-09
Document File: 2 page(s) / 49K

Publishing Venue

IBM

Related People

Caraballo, MP: AUTHOR [+6]

Abstract

A technique is described whereby a software algorithm used in conjunction with microprocessors, such as an Intel 8085, will provide a multiple searching capability in a limited domain environment. Microprocessors with a limited instruction set, such as the Intel 8085, normally require an extensive use of code to provide a multiple search capability. The algorithm described herein optimizes the code so as to search for one item in a limited domain of items. It is more efficient than the standard scan field and increment routines usually used. An example of a use for this technique is in applications where identification of a character is required in a line-turnaround situation. Since comparisons are made in each receiver handler, the receiver handler is interrupt driven and is therefore time constrained.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 81% of the total text.

Page 1 of 2

Limited Domain Search Algorithm for Code Optimization

A technique is described whereby a software algorithm used in conjunction with microprocessors, such as an Intel 8085, will provide a multiple searching capability in a limited domain environment. Microprocessors with a limited instruction set, such as the Intel 8085, normally require an extensive use of code to provide a multiple search capability. The algorithm described herein optimizes the code so as to search for one item in a limited domain of items. It is more efficient than the standard scan field and increment routines usually used. An example of a use for this technique is in applications where identification of a character is required in a line-turnaround situation. Since comparisons are made in each receiver handler, the receiver handler is interrupt driven and is therefore time constrained. The algorithm, with its table look-up feature, provides an efficient method of providing the search. It is significant to note that the application is not confined to the receiver handler, but could be used in any interrupt handler or any routine where time is constrained. In the case of the one- byte (8-bit) character sets, there are as many as 256 change-of-direction (COD) characters; therefore, a 256-byte table is allocated for each port starting on 256- byte boundaries. The line-turnaround, or COD character, is stored at the address which is the base address indexed with the character value. This is impleme...