{"title":"An integrated Ku-band quasi-planar circuit mixer","authors":"J. Bornemann","doi":"10.1109/PACRIM.1989.48431","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48431","url":null,"abstract":"A Ku-band integrated circuit balanced mixer using commercially available beam-lead diodes is described. Etched from a 17.5- mu m-copper cladded RT-Duroid 5880 substrate with a thickness of 254 mu m, the planar circuit board is sandwiched between the two parts of a waveguide split-block housing. Since the manufacturing accuracy mainly depends on the low etching tolerances, the design is especially suitable for millimeter-wave applications. 8-dB conversion loss, a 5.6-dB DSB noise figure, and isolation values of 35 dB are obtained for the Ku-band prototype operating in the self-biasing mode.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117270364","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An expert system for circuit board repair","authors":"N. Ling, M. E. Malowany, A. Malowany","doi":"10.1109/PACRIM.1989.48351","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48351","url":null,"abstract":"Using a hierarchical approach, an expert system for performing circuit board repair tasks within a robotic workcell has been developed. The new circuit board repair system is rule-based and includes a nonmonotonic inference engine using forward chaining and nonblocking functions, a database describing a robotic workcell, and rule sets into which repair tasks are implemented. Parallel-processing capability is achieved by using nonblocking functions. Action synthesis is based on matching rules to the given database. The system was programmed in Common LISP on a SUN 3 workstation under UNIX BSD version 4.3 and on a dedicated Symbolics 3600 LISP machine. The development, implementation, and testing of the circuit board repair system are described.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127495888","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Speech recognition strategy for stress-induced speech","authors":"J. W. Gordon, D. L. Sanford","doi":"10.1109/PACRIM.1989.48401","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48401","url":null,"abstract":"The impact of style variations, and in particular stress-induced variations, on speech recognition performance is discussed. The approach is threefold. First, databases of stress-induced speech are used to measure the recognition performance of humans and commercial devices. Second, acoustic-phonetic analysis of the data is done to determine correlations between style variations and recognition performance; such a analysis helps to determine how changes in strategic design might better accommodate prosodic variations. Third, these hypotheses are tested using development recognition systems.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125040880","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A protocol software application generator","authors":"W. Hong","doi":"10.1109/PACRIM.1989.48348","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48348","url":null,"abstract":"An approach to generating protocol software from the validated protocol specifications is presented. Using this approach, the protocol application generator PAGE was developed. Using PAGE, an internet protocol was implemented as a set of automatically generated device driver routines and shown to run in a testbed simulating a real network environment. Protocol software thus generated is shown to serve as complete or nearly complete routines or as prototype routines for the protocol, depending upon the protocol software application generator and its application environment. The approach helps improve substantially the reliability of protocol software and the productivity of protocol software development.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126064155","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Normalized 2-D ARMA lattice parameter modeling algorithm","authors":"Hon Keung Kwan, Ying Chun","doi":"10.1109/PACRIM.1989.48379","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48379","url":null,"abstract":"A Levinson-type algorithm is proposed for estimating the two-dimensional autoregressive-moving average (ARMA) model from the observed inputs and outputs of an unknown 2-D system. By applying the concept of dummy prediction errors, the algorithm can be extended for computing 2-D models of any AR-order and MA-order. It is shown that the algorithm can be greatly simplified when the input is a white process.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125566740","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Coset code constructions of N-dimensional sphere packings from 1- and 2-dimensional lattices","authors":"F. Kschischang, S. Pasupathy","doi":"10.1109/PACRIM.1989.48370","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48370","url":null,"abstract":"A technique for constructing N-dimensional sphere packings from certain one- and two-dimensional lattices is described. The packings are constructed as coset codes and take advantage of partitions of the base lattices that result in Hamming spaces. Known Hamming metric codes over GF(2), GF(3), GF(5), and GF(7) are used in the construction. The resulting packings are compared with the best known packings in each dimension. At low dimensions, many of these packings are the densest known; as the dimension increases, however, the packings become inferior to the best known ones.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115537033","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analysis and design of parallel algorithms and implementations of matrix multiplications for image and signal processing","authors":"M. Yasrebi, J. Browne","doi":"10.1109/PACRIM.1989.48302","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48302","url":null,"abstract":"Parallel matrix multiplication algorithms (based on the common data distribution formats) used in pattern recognition, image processing, and signal processing applications are discussed. A novel algorithm is introduced and is shown to be the fastest one for a determined class of applications. The algorithms are analyzed for performance as a function of array dimension, data distribution formats, and the architecture of the computer upon which the algorithms are executed. Performance bounds and speedups (linear in the number of processors) are established. The results of the analysis are given both as characterizations of executions on selected classes of architectures and also in the form of theorems which establish the relative performance of the algorithms across classes of data distributions and architectures.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116239985","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Intermode tuning characteristics of an InGaAsP laser with optical feedback from an external grating reflector","authors":"J. Binder, G. Cormack, A. Somani","doi":"10.1109/PACRIM.1989.48297","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48297","url":null,"abstract":"The spectral characteristics are reported of one-side antireflection coated 1.3 mu m InGaAsP lasers exposed to strong feedback from an external grating, when the center wavelength of reflection of the grating is tuned continuously from one solitary laser diode longitudinal mode to the adjacent lower frequency mode. The effects of different residual reflectivities of the coated facet on the tuning characteristics of the laser between internal cavity modes are shown to agree with theory. Bistability in the tuning characteristic is explained. A dependence of the stability of single-mode oscillation and of the linewidth on the detuning from the solitary laser modes is theoretically explained.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129935956","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performance of a 45 Mb/s optical DFSK system using self-heterodyne detection","authors":"S. Lohtia, P. Goud, C. G. Englefield","doi":"10.1109/PACRIM.1989.48298","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48298","url":null,"abstract":"An optical differential frequency shift keying (DFSK) system with self-heterodyne detection (SHD) operating at 45 Mb/s is demonstrated. One of the major advantages of the DFSK system is that it does not require an optical local oscillator (laser diode) at the receiver. This reduces the complexity of the receiver design and lowers the system cost. It is shown that the system can tolerate a source linewidth-to-bitrate ratio of 0.5. The bit error rate (BER) is obtained as a function of received average DC optical power for different transmitted sequences, and the effect of long strings of zeros and ones in the data stream on receiver performance is analyzed. The effect of laser phase noise (linewidth) on broadening of the intermediate frequency (IF) spectrum is investigated by determining the BER characteristics for two IF filters with 3-dB bandwidths of 300 MHz and 500 MHz. For a 101010 . . . data sequence, a BER of less than 10/sup -9/ is obtained.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128392838","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Robust vector quantization based on spectral mapping with a noise estimate","authors":"Xiangyang Chen, Vludimir Cuperman","doi":"10.1109/PACRIM.1989.48341","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48341","url":null,"abstract":"The problem of optimal quantization of a signal affected by additive noise in the general framework of vector quantization is studied. A noise estimator is used to adapt the vector quantization codebook to the specific noisy environment. Two adaptation strategies are discussed: switched adaptation (multicodebook) and an adaptation approach in which the codebook is computed from the optimal clean signals codebook and the noise estimate. Experimental results show a significant improvement over the direct vector quantization of the noisy signal.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126914333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}