By Topic

Proceedings of IEEE Pacific Rim Conference on Communications Computers and Signal Processing

19-21 May 1993

Go

Filter Results

Displaying Results 1 - 25 of 105
  • Performance analysis of (m, 2) MPPM with imperfect slot synchronization

    Publication Year: 1993, Page(s):765 - 768 vol.2
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    The performance of MPPM (multipulse pulse position modulation) consisting of m slots and 2 pulses ((m, 2) MPPM) with imperfect slot synchronization is analyzed. The authors assign the optimum symbol sets of (m, 2) MPPM minimizing symbol error probability in the presence of timing error, and the bit error probability of (m, 2) MPPM is evaluated. The bit error probability of (m, 2) MPPM is compared ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software environment for hybrid performance evaluation tool

    Publication Year: 1993, Page(s):532 - 535 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    The authors describe a prototype integrated software environment for performance evaluation, which incorporates both the knowledge of queuing theory and simulation techniques. They first propose a model description language, the extended Kendall language (EKL), which is based on Kendall's notation in the field of queuing theory. They present a prototype integrated software environment using the ob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effects of quadrature receiver gain error on direction-finding algorithms

    Publication Year: 1993, Page(s):378 - 381 vol.2
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    In sensor array processing applications, quadrature receivers are frequently used to demodulate the passband signal received by the sensor. The effect of gain error in the in-phase and quadrature branches of the receivers is addressed. The authors present a method of estimating quadrature gain errors which may be used to calibrate the array data, such that direction-finding algorithms will perform... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combined CDMA with TDMA increases the capacity of a cellular communication system

    Publication Year: 1993, Page(s):769 - 773 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    The authors present a novel cell structure that combines the qualities of code division multiple access (CDMA) and time division multiple access (TDMA) to reduce cochannel interferences. The cell consists of a centrally located base station with eight surrounding corner antennas. The mobiles and antennas operate in a TDMA mode and the communication channels employ spread spectrum direct sequence m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new file transfer protocol for telephone lines

    Publication Year: 1993, Page(s):536 - 548 vol.2
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    The authors present a set of mathematical equations that model the channel utilization of stop and wait protocols and streaming protocols which transfer files over telephone lines. The performance was analyzed under different channel error rates, error distributions, and transmission speeds. A novel data link streaming protocol, MAX2, is also presented. The equations were validated against the mea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CHIP in plain logic

    Publication Year: 1993, Page(s):742 - 746 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    The programming language Prolog allows succinct representation of a wide variety of scheduling problems. To speed up execution, a new version called CHIP (Constraint Handling In Prolog) was introduced that maintains the programming advantages of Prolog. CHIP achieves its speed by keeping track of the sets of possible values for each variable. In this way, a search can be abandoned as soon as any s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast data communication for scalable distributed shared-memory parallel computer hyper-KORP

    Publication Year: 1993, Page(s):382 - 385 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    A loosely coupled ring-connected parallel processing system (called KORP: Kobe University Ring-connected Parallel Computer) with distributed shared-memory is being developed. The high-speed communication in KORP is performed by the exclusive data transmission hardware called Stream Controller (SC). The consistency of shared data is maintained by a coherence-protocol controller which is a dedicated... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Code diversity transmission in a slow-frequency-hopped spread-spectrum multiple-access communication system

    Publication Year: 1993, Page(s):774 - 777 vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    A diversity scheme for a slow-frequency-hopped spread spectrum multiple-access communication system is proposed. Two receiver decoding schemes are studied. Several frequency bins are simultaneously used by a transmitter. Depending on the number of frequency bins available for hopping and the number of active transmitters, an optimal diversity degree exists which minimizes the symbol error probabil... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A self-timed approach to VLSI digital filter design

    Publication Year: 1993, Page(s):402 - 406 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    A request-acknowledge protocol is normally used for self-timed digital design. The two major philosophies for such a protocol are two-cycle and four-cycle. Data flow graphs have seven primitives. The design of these primitives for both two-cycle and four-cycle protocols is presented. Results of simulations of a multirate comb filter used as a decimator for both of these schemes are also presented.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal protocol design using partial constraints

    Publication Year: 1993, Page(s):549 - 552 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    Formal design of communication protocols using partial constraints is presented. Partial constraints are modal logic formulae constructed from requirements, using three basic connectives: the nondeterministic "or" the "precedence" and the "followed by" operator. Every formula is satisfied by a class of related behaviors. Partial specifications satisfy those partial constraints from which they are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving logic problems with object-oriented constraint logic programming

    Publication Year: 1993, Page(s):747 - 750 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    The authors examine the solution to logic problems via traditional logic programming, constraint logic programming (CLP), and object-oriented CLP. CLP builds on the desirable declarative properties of logic programming by incorporating consistency algorithms to provide an efficient tool suitable for solving logic problems. However, CLP lacks any built-in mechanism for structuring programs, and cas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the use of Fourier transform with acoustical fields

    Publication Year: 1993, Page(s):726 - 729 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    The authors present a theoretical introduction to the possibility of using the Fourier transform to study the fields produced by distributions, either continuous or discrete, of acoustic source distributions. With this approach one can develop and simplify methods of analysis and synthesis of fields produced by acoustic sources. The procedure is based on the theorem of the small complex translatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance analysis for the arbitor of IEEE standard backplane bus Futurebus/Futurebus+

    Publication Year: 1993, Page(s):386 - 389 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    The arbitration protocols of the IEEE Futurebus and Futurebus+ are analyzed with both a theoretical model and a real machine. Some problems are found in the fairness scheme on Futurebus View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PN code acquisition for asynchronous CDMA communications based on interference cancellation

    Publication Year: 1993, Page(s):778 - 781 vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    A novel PN (pseudonoise) code acquisition technique based on interference cancellation is developed for asynchronous CDMA (code division multiple access) communication systems. The acquisition scheme is robust because the near-far problem is alleviated by the cancellation process. Two schemes are proposed. One is based on a one-by-one cancellation, in which the estimated strongest signal is remove... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The equivalents of Schur-Cohn minors for delta-operator formulated discrete-time systems

    Publication Year: 1993, Page(s):407 - 410 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    The author presents certain quantities that may be regarded as Schur-Cohn minors applicable to δ-system characteristic polynomials. For this purpose, a recently introduced tabular method for stability checking of δ-systems is extended to the complex coefficient case. The results presented pave the way for developing effective algorithms for stability checking of two-dimensional and mul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A case study of isosurface generation in 3D visualization

    Publication Year: 1993, Page(s):622 - 625 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    The authors explore the problem of the redundancy of the marching-cube algorithm which is widely used as an isosurface generation technique of 3-D visualization. The redundancy occurs when the pixel value from input volumetric data is equal to the isovalue chosen. A modified version of the marching-cube algorithm is also proposed. The results show that the modified algorith thus can increase the e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new method for network routing:a preliminary report

    Publication Year: 1993, Page(s):553 - 556 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    The author considers the problem of packet routing in a dynamic communication network as a problem of autonomous agent navigation in an uncertain environment, and proposes a novel method for network routing. The basic idea is that, instead of using an estimated constant, one uses a probability distribution to model the delay of link in a computer network, and computes routing tables based on such ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bayesian probabilistic reasoning in design

    Publication Year: 1993, Page(s):501 - 504 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    The application of Bayesian reasoning to engineering design is discussed. The decisions involved in the design process can be represented as nodes in a Bayesian network. The conditional probability that a child node in this network will take a desired value, given the values of its parents, can be estimated from a database built up from simulations of past designs, or from suitably encoded empiric... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pruning search trees by cylindrical closure

    Publication Year: 1993, Page(s):751 - 756 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    Abstract interpretation can be applied to speed up constrained combinatorial search. The approximations used are supersets of the constraints. The authors study an instance of this method by selecting as the supersets the cylindrical closures of Ashby (1964). The result is the method of pruning by cylindrical closure (PCC). When the closures are of order 1 and the constraints are binary, the arc c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An expert system for selecting viscosity models and prediction

    Publication Year: 1993, Page(s):730 - 733 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    An expert system has been developed for selecting reliable viscosity models and predicting viscosity values. The expert system combined symbolic reasoning with fast, efficient numerical computations. The symbolic reasoning was developed using a LISP-based expert system tool, Personal Consultant Plus (PC Plus). The numerical calculation routines were written in FORTRAN 77. The system was implemente... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance evaluation of tree-based coherent distributed shared memory

    Publication Year: 1993, Page(s):390 - 393 vol.2
    Cited by:  Papers (1)  |  Patents (70)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    The system is organized based on the tree-based coherent algorithm, in which the coherence is maintained at the network nodes, in a fully distributed and localized manner. The system has an overlapped tree structure, where the processors are located on the leaves. The proposed coherence protocol relies only on one-to-one message passing. Simulation shows that, in a matrix multiplication program, t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scheduling advisor for distributed systems

    Publication Year: 1993, Page(s):459 - 462 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    An adaptive scheduling advisor is proposed for computing resource management in distributed systems by providing a means for optimal mapping of an application onto the system. To make its decision, the scheduling advisor uses the job information, a detailed description of the system, and current dynamic parameters. The decision-making process is controlled by a set of scheduling heuristics, a simp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sub-pixel detection of active targets

    Publication Year: 1993, Page(s):470 - 473 vol.2
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    The problem of accurately detecting the location of active targets using low-cost machine vision systems is presented, with a requirement for location accuracies greater than 0.5 pixels. Methods of locating bloblike images of active targets are presented, including the calculation of the centroid of binarized versions of the blob, and the fitting of a parametric model to the blobs intensity distri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mathematical channel models for spread spectrum data communications

    Publication Year: 1993, Page(s):782 - 785 vol.2
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    The results of an experimental investigation undertaken for direct sequence spread spectrum under controlled additive white Gaussian noise, multiuser and multipath conditions, employing coherent DQPSK (differential quadrature phase shift keying) as modulation scheme, is presented. A discrete partitioned Markov channel model, as proposed by Fritchman (1967) is parameterized to generate an error seq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast polynomial interpolation for Remez exchange method

    Publication Year: 1993, Page(s):411 - 414 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    The computational complexity of several algorithms for polynomial interpolation is quantitatively evaluated. There are four well-known algorithms for obtaining the interpolation polynomial. The first algorithm is to solve simultaneous equations for coefficients of the polynomial (the most basic one). The second is Lagrange's interpolation algorithm (the classical one used widely). The third is Lag... View full abstract»

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