Dismiss
The InnovationQ application will be updated on Sunday, May 31st from 10am-noon ET. You may experience brief service interruptions during that time.
Browse Prior Art Database

Storage Byte Mark Decode With Boundary Recognition

IP.com Disclosure Number: IPCOM000039235D
Original Publication Date: 1987-May-01
Included in the Prior Art Database: 2005-Feb-01

Publishing Venue

IBM

Related People

Authors:
LaBalbo, LJ Mostowy, WL Ruane, AJ [+details]

Abstract

Byte marks for data storage are typically generated using the starting address and length, then decoding the appropriate byte marks for each operation. A method that uses the same starting address and length but adds them together eliminates decoding all operations and provides an automatic one-line boundary crossing indication. As seen in an example in Fig. 1, the start address, or pointer, begins the sequence while the sum of the start and length allows the sequence to stop at the appropriate byte mark. (Image Omitted) In the example of an eight-byte store to a four-byte storage bus (Fig. 2), the pointer only uses two of three bits in order to provide a boundary-crossing indicator. The pointer goes only to the first four bytes.