By Topic

IBM Journal of Research and Development

Issue 2 • Date March 1983

Filter Results

Displaying Results 1 - 13 of 13
  • Arithmetic Codes for Constrained Channels

    Publication Year: 1983 , Page(s): 94 - 106
    Cited by:  Papers (7)  |  Patents (2)
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (935 KB)  

    Arithmetic codes have been studied in the context of compression coding, i.e., transformations to code strings which take up less storage space or require less transmission time over a communications link. Another application of coding theory is that of noiseless channel coding, where constraints on strings in the channel symbol alphabet prevent an obvious mapping of data strings to channel strings. An interesting duality exists between compression coding and channel coding. The source alphabet and code alphabet of a compression system correspond, respectively, to the channel alphabet and data alphabet of a constrained channel system. The decodability criterion of compression codes corresponds to the representability criterion of constrained channel codes, the generalized Kraft Inequality has a dual inequality due to the senior author. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A General Fixed Rate Arithmetic Coding Method for Constrained Channels

    Publication Year: 1983 , Page(s): 107 - 115
    Cited by:  Papers (4)  |  Patents (2)
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (626 KB)  

    This paper extends the result of earlier work on the application of arithmetic codes to the constrained channel problem. We specifically present a general length-based fixed rate implementation technique which performs the arithmetic coding recursions during each channel time unit. This technique is superior to an earlier unpublished code for general constrained channels. The approach permits the design of codes for sophisticated channel constraints. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design Issues and Architecture of HACIENDA, an Experimental Image Processing System

    Publication Year: 1983 , Page(s): 116 - 126
    Cited by:  Papers (2)
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (828 KB)  

    The paper provides the rationale for the architecture and design of a color image display and processing system called HACIENDA. The system was heavily influenced by one of its most important intended applications, the processing of LANDSAT data, including that to be provided by LANDSAT D. Also considered in the paper are the trade-offs involved in making the system suitable for a broader range of image processing work without unduly adding to cost or complexity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Perceptual Color Space of Digital Image Display Terminals

    Publication Year: 1983 , Page(s): 127 - 132
    Cited by:  Papers (4)  |  Patents (1)
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (457 KB)  

    The geometric properties of the set of colors that can be displayed on the TV monitor of a digital image processing terminal are discussed in the framework of the Commission Internationale de l'Eclairage (CIE) 1976 (L* u* v*) color space. Quantitative results are presented for the HACIENDA image processing system. The use of lightness, chroma, and hue angle for the representation of multi-band images is briefly discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fair Carpool Scheduling Algorithm

    Publication Year: 1983 , Page(s): 133 - 139
    Cited by:  Papers (7)
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (606 KB)  

    We present a simple carpool scheduling algorithm in which no penalty is assessed to a carpool member who does not ride on any given day. The algorithm is shown to be fair, in a certain reasonable sense. The amount of bookkeeping grows only linearly with the number of carpool members. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A “Zero-Time” VLSI Sorter

    Publication Year: 1983 , Page(s): 140 - 148
    Cited by:  Papers (15)  |  Patents (4)
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (581 KB)  

    A hardware sorter suitable for VLSI implementation is proposed. It operates in a parallel and pipelined fashion, with the actual sorting time absorbed by the input/output time. A detailed VLSI implementation is described which has a very favorable device count compared to existing static RAM. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • OYSTER: A Study of Integrated Circuits as Three-Dimensional Structures

    Publication Year: 1983 , Page(s): 149 - 163
    Cited by:  Papers (16)  |  Patents (5)
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (1006 KB)  

    This paper presents a design for a software system (OYSTER) for the parametric simulation and analysis of the fabrication steps of very large scale integrated circuit devices. The system is based on a solid geometric modeling approach in which the component parts of an integrated circuit are represented at any step as three-dimensional solid objects in a geometric data base. The simulation of a fabrication step transforms the data base representation of the geometry and the relations among component parts from their state before the step to their state after the step. At any step, and particularly after the final step, the component parts may be analyzed automatically to determine geometric, mechanical, thermal, and electrical properties. Statistical effects may be incorporated to allow investigation of alignment tolerance build-up and yield. A prototype study is described in which an existing geometric modeling system is used to transform a set of planar masks for an FET device through 28 process steps into 3-D models which are used to compute device capacitances. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fractal Nature of Software-Cache Interaction

    Publication Year: 1983 , Page(s): 164 - 170
    Cited by:  Papers (16)  |  Patents (1)
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (575 KB)  

    This paper uses fractals to model the clustering of cache misses. The clustering of cache misses can be quantified by a single number analog to a fractional dimension, and we are intrigued by the possibility that this number can be used as a measure of software complexity. The essential intuition is that cache misses are a direct reflection of changes in locality of reference, and that complex software requires more frequent (and larger) changes in this locality than simple software. The cluster dimension provides a measure (and perhaps the basis for a model) of the intrinsic differences between workloads. In this paper, we focus on cache miss activity as a discriminate between interactive and batch environments. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Axisymmetric Motion of Radially Polarized Piezoelectric Cylinders Used in Ink Jet Printing

    Publication Year: 1983 , Page(s): 171 - 180
    Cited by:  Patents (1)
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (606 KB)  

    An analysis of the low frequency response of piezoelectric squeeze tubes used in drop-on-demand ink jet printing is carried out. The displacements at inner and outer boundaries are determined as a function of voltage and fluid pressure. The results are used to obtain fluid pressure per applied voltage as a function of inner and outer radius. Numerical computations are carried out for PZT-5H, and results are presented in graphical form which can be used to optimize design dimensions. The effect of finite electrode thickness is also studied. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Improved Regional Correlation Algorithm for Signature Verification Which Permits Small Speed Changes Between Handwriting Segments

    Publication Year: 1983 , Page(s): 181 - 185
    Cited by:  Papers (4)  |  Patents (3)
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (438 KB)  

    If two nearly coincident accelerometers on a pen axis measure orthogonal acceleration components perpendicular to this axis, then the regional correlation algorithm for signature verification divides these data into plausible segments, it compares each segment with a corresponding reference, and it combines the results into a global similarity index. The presently used intersegment distance permits certain natural data transformations: (1) translating a segment by small integer multiples of the sampling interval; (2) moving the pen with uniformly larger amplitude throughout a segment; and (3) rotating the pen about its axis between any two segments. We propose a new intersegment distance which permits further natural transformations: (4) translating a segment by a fraction of the sampling interval; and (5) writing at slightly different uniform speed within each segment. The new distance, like the old one, is the minimum of a certain function. We describe an algorithm which computes this minimum. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recent papers by IBM authors

    Publication Year: 1983 , Page(s): 186 - 193
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (601 KB)  

    Reprints of the papers listed here may usually be obtained by writing directly to the authors. The authors' IBM divisions or groups are identified as follows: CHQ is Corporate Headquarters: CPD, Communication Products Division: DSD, Data Systems Division: FED, Field Engineering Division: FSD, Federal Systems Division: GPD, General Products Division: GSD, General Systems Division: GTD, General Technology Division: IPD, Information Products Division: ISG, Information Systems Group: IS&CG, Information Systems & Communications Group: IS&TG, Information Systems & Technology Group: NAD, National Accounts Division: NMD, National Marketing Division: RES, Research Division: SPD, System Products Division: and SRI, Systems Research Institute. Papers are listed alphabetically by authors. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recent IBM patents

    Publication Year: 1983 , Page(s): 194 - 195
    Save to Project icon | PDF file iconPDF (149 KB)  
    Freely Available from IEEE
  • Errata [Erratum]

    Publication Year: 1983 , Page(s): 196
    Save to Project icon | PDF file iconPDF (64 KB)  
    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

The IBM Journal of Research and Development is a peer-reviewed technical journal, published bimonthly, which features the work of authors in the science, technology and engineering of information systems.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Clifford A. Pickover
IBM T. J. Watson Research Center