Pub Date : 1991-05-09DOI: 10.1109/PACRIM.1991.160716
M. Y. Cheung, W. Grover, W. Krzymień
A combined framing and error control scheme is proposed for the DS3 signal by replacing the F-bits with FEC parity check bits. A suitable extended and shortened Hamming code is used. A fast syndrome computation scheme is developed for the DS3-FEC code with distributed parity check bits to facilitate faster reframe times. The proposed scheme has a better overall framing performance than that of F-bit framing. It also offers the output BER reduction to approximately 1360 P/sub e//sup 2/.<>
{"title":"Combined framing and FEC coding for digital multiplex signals","authors":"M. Y. Cheung, W. Grover, W. Krzymień","doi":"10.1109/PACRIM.1991.160716","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160716","url":null,"abstract":"A combined framing and error control scheme is proposed for the DS3 signal by replacing the F-bits with FEC parity check bits. A suitable extended and shortened Hamming code is used. A fast syndrome computation scheme is developed for the DS3-FEC code with distributed parity check bits to facilitate faster reframe times. The proposed scheme has a better overall framing performance than that of F-bit framing. It also offers the output BER reduction to approximately 1360 P/sub e//sup 2/.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131518767","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}
Pub Date : 1991-05-09DOI: 10.1109/PACRIM.1991.160770
A. Elkateeb, T. Le-Ngoc
The processing overhead of the reduced instruction set computer (RISC) state-swapping operation is evaluated in the ISDN software environment. A model for the ISDN application tasks is introduced to simulate the processing of ISDN user-network interface protocols. A simple approach is developed to arrive at an estimate for this overhead. The measurement of the processing was calculated for two ISDN applications tasks, the Q.931 basic call control and the TEI assignment. The overhead cost was measured in relation to the total memory references and to the total machine instruction processing time. Results show that this overhead is significant, and is especially so if the number of ISDN messages being processed during task execution is small.<>
{"title":"Processing overhead of the RISC state-swapping operation in the ISDN software processing","authors":"A. Elkateeb, T. Le-Ngoc","doi":"10.1109/PACRIM.1991.160770","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160770","url":null,"abstract":"The processing overhead of the reduced instruction set computer (RISC) state-swapping operation is evaluated in the ISDN software environment. A model for the ISDN application tasks is introduced to simulate the processing of ISDN user-network interface protocols. A simple approach is developed to arrive at an estimate for this overhead. The measurement of the processing was calculated for two ISDN applications tasks, the Q.931 basic call control and the TEI assignment. The overhead cost was measured in relation to the total memory references and to the total machine instruction processing time. Results show that this overhead is significant, and is especially so if the number of ISDN messages being processed during task execution is small.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131715112","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}
Pub Date : 1991-05-09DOI: 10.1109/PACRIM.1991.160674
R. Kirlin
A formulation of the semblance coefficient in terms of data covariance matrix eigenstructure is given. The conventionally used semblance procedure is tied to eigenstructure, thereby allowing the seismic signal analyst an opportunity to relate the various displays of velocity spectra using more than visual appearance. After writing semblance in the eigenstructure form, comparisons are made to a number of well-known eigenstructure formulations, which separate signal and noise (vector) subspaces. It is shown qualitatively that semblance should have neither the resolving power nor the computational efficiency of the newer methods.<>
{"title":"The relationship between semblance and eigenstructure velocity estimators","authors":"R. Kirlin","doi":"10.1109/PACRIM.1991.160674","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160674","url":null,"abstract":"A formulation of the semblance coefficient in terms of data covariance matrix eigenstructure is given. The conventionally used semblance procedure is tied to eigenstructure, thereby allowing the seismic signal analyst an opportunity to relate the various displays of velocity spectra using more than visual appearance. After writing semblance in the eigenstructure form, comparisons are made to a number of well-known eigenstructure formulations, which separate signal and noise (vector) subspaces. It is shown qualitatively that semblance should have neither the resolving power nor the computational efficiency of the newer methods.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132998307","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}
Pub Date : 1991-05-09DOI: 10.1109/PACRIM.1991.160724
C. X. Tan, Y.L. Ma
It is shown that for a slowly rotating sensor array accurate direction finding can still be achieved if the power method together with a rotation correction scheme is applied. The bearing estimation error curves along with input SNR, correlation of the ambient noise field, and incident direction of the source are also given. It also can be used for moving target tracking.<>
{"title":"Rapid direction finding for principal source with applications to underwater sound","authors":"C. X. Tan, Y.L. Ma","doi":"10.1109/PACRIM.1991.160724","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160724","url":null,"abstract":"It is shown that for a slowly rotating sensor array accurate direction finding can still be achieved if the power method together with a rotation correction scheme is applied. The bearing estimation error curves along with input SNR, correlation of the ambient noise field, and incident direction of the source are also given. It also can be used for moving target tracking.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132904232","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}
Pub Date : 1991-05-09DOI: 10.1109/PACRIM.1991.160760
T. Hinamoto, M. Muneyasu, H. Toda
A computationally efficient technique is developed for the design of two-dimensional (2D) recursive digital filters that meet simultaneously magnitude and phase specifications. A quadrantal symmetry which exists in the 2D frequency response is incorporated into the 2D filter structure. The denominator and the numerator of a 2D transfer function are designed individually: the former is used to approximate the constant group delays and then the latter is used to approximate the overall magnitude response. The filter design is analytically feasible by solving linear equations. These serve to reduce the amount of calculations drastically. The stability of the resulting filters is always guaranteed. Two examples are given to illustrate the utility of the proposed technique.<>
{"title":"An efficient technique for the design of 2-D IIR digital filters with symmetry and constant group delay","authors":"T. Hinamoto, M. Muneyasu, H. Toda","doi":"10.1109/PACRIM.1991.160760","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160760","url":null,"abstract":"A computationally efficient technique is developed for the design of two-dimensional (2D) recursive digital filters that meet simultaneously magnitude and phase specifications. A quadrantal symmetry which exists in the 2D frequency response is incorporated into the 2D filter structure. The denominator and the numerator of a 2D transfer function are designed individually: the former is used to approximate the constant group delays and then the latter is used to approximate the overall magnitude response. The filter design is analytically feasible by solving linear equations. These serve to reduce the amount of calculations drastically. The stability of the resulting filters is always guaranteed. Two examples are given to illustrate the utility of the proposed technique.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114789469","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}
Pub Date : 1991-05-09DOI: 10.1109/PACRIM.1991.160698
W. Chen, J. Reilly, K. Wong
Based on the fact that a noise is usually correlated over a limited spatial range, a detection scheme employing two spatially separated arrays is proposed. To extend this concept to the detection problem is quite natural. The problem is how to find a theoretically solid, functionally robust algorithm to process the array outputs. A canonical correlation is introduced to solve the problem, and a satisfactory method is developed.<>
{"title":"Detection of the number of signals in the presence of noise with an unknown, banded structured covariance matrix","authors":"W. Chen, J. Reilly, K. Wong","doi":"10.1109/PACRIM.1991.160698","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160698","url":null,"abstract":"Based on the fact that a noise is usually correlated over a limited spatial range, a detection scheme employing two spatially separated arrays is proposed. To extend this concept to the detection problem is quite natural. The problem is how to find a theoretically solid, functionally robust algorithm to process the array outputs. A canonical correlation is introduced to solve the problem, and a satisfactory method is developed.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114996445","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}
Pub Date : 1991-05-09DOI: 10.1109/PACRIM.1991.160800
S. Deng, U. Maydell, H. Hassanein
The ACR-NEMA standard (1985) allows different medical devices to communicate compatibly in a picture archiving and communication system (PACS) environment. The authors evaluate the performance of PACSs incorporating the ACR-NEMA standard. The ACR-NEMA standard requires that the ACR-NEMA bus be placed between any medical device and a network interface unit. The authors propose the removal of the ACR-NEMA bus from the archive-workstation path. Therefore, the ACR-NEMA protocol delays would be eliminated from all viewing requests. The ACR-NEMA bus is to be kept at the image generating equipment (IGE) workstations. The authors introduce the enhanced PACS architecture. Some numerical results of the architecture are shown and compared to results obtained by following the ACR-NEMA bus placement specification as stated in the standard.
{"title":"On placement of the ACR-NEMA bus in picture archiving and communications systems","authors":"S. Deng, U. Maydell, H. Hassanein","doi":"10.1109/PACRIM.1991.160800","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160800","url":null,"abstract":"The ACR-NEMA standard (1985) allows different medical devices to communicate compatibly in a picture archiving and communication system (PACS) environment. The authors evaluate the performance of PACSs incorporating the ACR-NEMA standard. The ACR-NEMA standard requires that the ACR-NEMA bus be placed between any medical device and a network interface unit. The authors propose the removal of the ACR-NEMA bus from the archive-workstation path. Therefore, the ACR-NEMA protocol delays would be eliminated from all viewing requests. The ACR-NEMA bus is to be kept at the image generating equipment (IGE) workstations. The authors introduce the enhanced PACS architecture. Some numerical results of the architecture are shown and compared to results obtained by following the ACR-NEMA bus placement specification as stated in the standard.","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116384335","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}
Pub Date : 1991-05-09DOI: 10.1109/PACRIM.1991.160729
K. Gupta, Z. Guo
A motion planner is implemented that plans collision-free motions for a PUMA 560 manipulator arm among stationary obstacles. The basic idea behind the approach is a novel sequential search strategy that successively plans the motion of each link starting from the base link. The strategy results in one 1-dimensional (the first link is degenerate) and n-1 2-dimensional planning problems instead of one n-dimensional problem for an n-link manipulator arm. The search strategy leads to a fast and efficient algorithm and is especially suited for highly redundant arms. However, the penalty is that the strategy may miss certain paths. In the current implementation for the PUMA 560, only the first three links of the arm are considered.<>
{"title":"A practical motion planner for PUMA 560","authors":"K. Gupta, Z. Guo","doi":"10.1109/PACRIM.1991.160729","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160729","url":null,"abstract":"A motion planner is implemented that plans collision-free motions for a PUMA 560 manipulator arm among stationary obstacles. The basic idea behind the approach is a novel sequential search strategy that successively plans the motion of each link starting from the base link. The strategy results in one 1-dimensional (the first link is degenerate) and n-1 2-dimensional planning problems instead of one n-dimensional problem for an n-link manipulator arm. The search strategy leads to a fast and efficient algorithm and is especially suited for highly redundant arms. However, the penalty is that the strategy may miss certain paths. In the current implementation for the PUMA 560, only the first three links of the arm are considered.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115578922","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}
Pub Date : 1991-05-09DOI: 10.1109/PACRIM.1991.160833
Y. Nakauchi, T. Okada, Y. Anzai
The authors developed a groupware toolkit, called Michele, which supports asynchronous group work in distributed open environments. It is based on a multi-agent model of communication and allows a user to customize the interface by a specially designed language called MDL (multi-agent description language). The authors incorporate a learning mechanism in Michele. With the mechanism, Michele learns interactions between the user and the system, and stores learned knowledge in each user's environment. A document generation macro function has been added to MDL. With this macro function, cooperative work can be viewed as a set of document-driven procedures. Michele makes a decision tree for each query to the user when making new documents within the document generation macro function. The authors describe Michele and its agent description language MDL. They describe how to introduce a learning mechanism within Michele and explain the details of its implementation. An evaluation of the learning mechanism with a real example is described.<>
{"title":"Groupware that learns","authors":"Y. Nakauchi, T. Okada, Y. Anzai","doi":"10.1109/PACRIM.1991.160833","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160833","url":null,"abstract":"The authors developed a groupware toolkit, called Michele, which supports asynchronous group work in distributed open environments. It is based on a multi-agent model of communication and allows a user to customize the interface by a specially designed language called MDL (multi-agent description language). The authors incorporate a learning mechanism in Michele. With the mechanism, Michele learns interactions between the user and the system, and stores learned knowledge in each user's environment. A document generation macro function has been added to MDL. With this macro function, cooperative work can be viewed as a set of document-driven procedures. Michele makes a decision tree for each query to the user when making new documents within the document generation macro function. The authors describe Michele and its agent description language MDL. They describe how to introduce a learning mechanism within Michele and explain the details of its implementation. An evaluation of the learning mechanism with a real example is described.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121228631","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}
Pub Date : 1991-05-09DOI: 10.1109/PACRIM.1991.160744
Y. Chan, W. Siu
A simple algorithm is proposed to realize a one-dimensional discrete Hartley transform (DHT) with sequence lengths equal to 2/sup m/. This algorithm achieves the same multiplicative complexity as Malvar's algorithm (1987, 1988) which requires the least number of multiplications reported in the literature. However, the approach gives the advantage of requiring a smaller number of additions compared with the number required in Malvar's algorithm.<>
{"title":"New formulation of fast discrete Hartley transform with the minimum number of multiplications","authors":"Y. Chan, W. Siu","doi":"10.1109/PACRIM.1991.160744","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160744","url":null,"abstract":"A simple algorithm is proposed to realize a one-dimensional discrete Hartley transform (DHT) with sequence lengths equal to 2/sup m/. This algorithm achieves the same multiplicative complexity as Malvar's algorithm (1987, 1988) which requires the least number of multiplications reported in the literature. However, the approach gives the advantage of requiring a smaller number of additions compared with the number required in Malvar's algorithm.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121322287","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：