{"title":"Guided scrambling: a new line coding technique for optical fiber communication systems","authors":"I. Fair, W. Grover, R. MacDonald","doi":"10.1109/PACRIM.1989.48299","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48299","url":null,"abstract":"A line coding technique is introduced for binary signals which due to its simple encoding and decoding procedures is applicable to high-bit-rate optical fiber transmission systems. Because it is similar to the established technique of self-synchronizing scrambling and is also capable of guiding the scrambling process to produce a balanced encoding bit stream, this technique is termed guided scrambled (GS). The concept of GS coding is explained, followed by a discussion of possible code parameters, selection of which allows tailoring of code characteristics to meet system requirements. The performances of selected GS configurations are reported and compared to those of conventional line coding techniques.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"46 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":"125689640","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 real-time knowledge based fault tolerant controller","authors":"M. Kaye, R. Doraiswami","doi":"10.1109/PACRIM.1989.48435","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48435","url":null,"abstract":"A real-time integrated hardware/software approach is proposed to implement fault-tolerant control for a class of control systems that can be mathematically modeled. The detection, isolation, and accommodation (DIA) of computer faults is implemented using triple modular redundancy, and DIA of the process faults uses analytical redundancy based on an observer. The system software architecture and the design of a knowledge base for process faults are described.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"26 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":"122014832","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":"The least complex parallel Massey-Omura multiplier and its LCA and VLSI designs","authors":"Y. Shayan, T. Le-Ngoc","doi":"10.1049/IP-G-2.1989.0057","DOIUrl":"https://doi.org/10.1049/IP-G-2.1989.0057","url":null,"abstract":"After reviewing the Massey-Omura multiplier, as an illustrative example it is shown that there are three polynomials which generate GF(2/sup 5/) in normal basis representation. The three multipliers based on these polynomials are considered and the polynomial which results in the least complex multiplier design is found. Then, based on this polynomial and the resultant design, LCA and VLSI implementation of the GF(2s/sup 5/) multiplier is considered and compared.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"35 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":"132330539","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":"Adaptive cancellation of adjacent channel interference","authors":"Brad A R Hedstrom, Lynn Kirh, Peter F Driessen","doi":"10.1109/PACRIM.1989.48430","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48430","url":null,"abstract":"A new method to combat the adjacent channel interference (ACI) encountered with multichannel receivers is presented. In the case of a two-channel receiver, components of the desired signal may become present in the reference to the interference rendering traditional adaptive noise cancellation ineffective. This situation is similar to two-microphone systems used for speech enhancement. The crosstalk resistant adaptive noise canceller (CTRANC), designed to work in the two-microphone case, is unable to provide any signal improvement for the ACI model. A new system is proposed which uses a priori knowledge of the crosstalk gained by the injection of a known signal into either the input of the receiver or into the output of a transmitter, whichever is appropriate. This injection system is then compared with the CTRANC and other methods by means of extensive computer simulation.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"16 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":"134221357","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 computerized data acquisition and analysis system for thermoluminescent dosimetry","authors":"B. McParland, G. Owen","doi":"10.1109/PACRIM.1989.48433","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48433","url":null,"abstract":"A PC-based system for thermoluminescent dosimetry in clinical use is described. In addition to providing accurate dosimetry, this system has the advantage of allowing permanent recording of the glow curves of the dosimeters, thus permitting the user to review the radiation response history of the dosimeter.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"33 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":"130732138","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":"Orthogonal phase functions for full response noncoherent CPM systems","authors":"R. Pandey, H. Leib, S. Pasupathy","doi":"10.1109/PACRIM.1989.48367","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48367","url":null,"abstract":"Continuous phase modulation (CPM) with noncoherent detection over a one-symbol interval is discussed. In order to obtain good performance with this simple demodulation strategy, the phase function of the modulation scheme has to be designed properly. An approach to shaping the purchase function to achieve noncoherent orthogonal performance for various values of the modulation index (h) is presented. Using the Gram-Schmidt orthogonality procedure, an entire family of orthogonal phase functions for h>or=0.68 is derived. All CPM schemes with these phase functions produce the same performance as noncoherent orthogonal signaling. For h=1 the phase function reduces to that of the FSK phase function. It is shown that there are CPM schemes that give the same SNR performance as noncoherent orthogonal FSK but have some spectral advantages over the FSK modulation format.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"96 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":"115833374","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":"Application of orthogonal elements in a-priori reconstruction: Fourier and polynomial techniques","authors":"R. Andrews, A. G. Law, A.D. Strilaeff, R. Sloboda","doi":"10.1109/PACRIM.1989.48311","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48311","url":null,"abstract":"The mathematical setting assumed is the Hilbert space. Two image reconstruction problems are summarized. In one (from emission tomography), an unknown member, f, of the space is sought as a linear combination of linearly independent elements g/sub 1/, g/sub 2/, . . ., g/sub n/, under the hypothesis that the inner products are known for 1<or=j<or=n. The other situation, from signal sampling, has an analogous mathematical structure, but it involves a transform, T, and the Fourier transform is used. The Fourier techniques can be carried out efficiently by taking advantage of the FFT, but ill-conditioning can appear in the linear system which arises in the a priori reconstruction process. With, instead, reconstruction in the original space, a polynomial choice for the basis function provides some interesting machinery through properties inherited from orthogonality.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"63 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":"124703826","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":"Trellis coded schemes for ISDN transmission","authors":"P. Mathiopoulos, D. Makrakis","doi":"10.1109/PACRIM.1989.48368","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48368","url":null,"abstract":"The application of trellis-coded techniques to integrated services digital network (ISDN) systems is discussed. Under the assumption that the channel can be equalized, a maximum-likelihood detector is derived for a near-end (NEXT) limited, digital subscriber loop. The proposed detector is based on the highly colored spectral characteristics of the NEXT interference. Two trellis-coded schemes are investigated in conjunction with the detector, and issues such as overall complexity versus expected performance are discussed in detail.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"146 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":"128424506","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 iterative approach for deterministic beamformer design","authors":"C. Tseng, L. Griffiths","doi":"10.1109/PACRIM.1989.48396","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48396","url":null,"abstract":"An iterative method for designing the quiescent response which closely matches a prespecified desired response in the passband while simultaneously minimizing the sidelobe levels in the stopband is discussed. The method is based on the use of eigenvector constraints in the array and searches for a set of coefficients which combine the constraints to generate the quiescent response. Using this method, the sidelobe levels in the stopband are reduced from one iteration to another; the search continues until the maximum ripple in the passband reaches a prespecified level. Both min-max and least-squares criteria, which are used to specify the ripple levels in the passband, are discussed.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"19 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":"127895979","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 efficient reservation system for local area networks based on CSMA/CD","authors":"S.H. Hashemi, H. Barghi, J. Bredeson","doi":"10.1109/PACRIM.1989.48292","DOIUrl":"https://doi.org/10.1109/PACRIM.1989.48292","url":null,"abstract":"Two channel reservation network (TCRN) is discussed. TCRN uses advance reservation and two channels to increase the channel throughput with lower delay than CSMA-CD. Two channels and FIFO form the TCRN. The contention channel carries the reservation broadcasts, the data channel delivers the actual data, and the reservation table keeps the priorities of message transmissions on the D-channel. TCRN operation, modeling, and simulation results are described, and TCRN is compared to other popular networks. TCRN is found to perform better than CSMA-CD, SRMA, and ring and polling networks with various numbers of stations.<<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":"123278618","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}