Pub Date : 1991-05-09DOI: 10.1109/PACRIM.1991.160782
Q. Zhang, R. Ward
The properties of the two-dimensional Fourier spectra of the most significant impairments occurring in cable television transmission systems are studied. These are snow noise, composite triple beats, picture carrier beats impairments, and power line interference. Features of these impairments are found. These features are to be used in an automatic television picture impairment detection and classification system. It is shown that the impaired television pictures have different spectrum properties which enable design and implementation of a simple automatic television noise detection and classification system.<>
{"title":"Feature extraction of cable television picture impairments","authors":"Q. Zhang, R. Ward","doi":"10.1109/PACRIM.1991.160782","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160782","url":null,"abstract":"The properties of the two-dimensional Fourier spectra of the most significant impairments occurring in cable television transmission systems are studied. These are snow noise, composite triple beats, picture carrier beats impairments, and power line interference. Features of these impairments are found. These features are to be used in an automatic television picture impairment detection and classification system. It is shown that the impaired television pictures have different spectrum properties which enable design and implementation of a simple automatic television noise detection and classification system.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"8 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":"126447828","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.160688
E.S. El Badawy, E. Fahmy
The performance of a four-state trellis-coded differential eight-phase shift keying (8-DPSK) technique in fast Rayleigh fading characterizing realistic mobile radio channels is studied. A combination of one-bit and two-bit differential detectors is used at the receiving end. The Viterbi decoder is used to determine the most likely coded signal sequence directly from the unquantized channel outputs. The four-state trellis-coded modulation (TCM) schemes using 8-DPSK can improve the bit error rate.<>
{"title":"Performance of trellis coded 8-DPSK in mobile radio channels","authors":"E.S. El Badawy, E. Fahmy","doi":"10.1109/PACRIM.1991.160688","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160688","url":null,"abstract":"The performance of a four-state trellis-coded differential eight-phase shift keying (8-DPSK) technique in fast Rayleigh fading characterizing realistic mobile radio channels is studied. A combination of one-bit and two-bit differential detectors is used at the receiving end. The Viterbi decoder is used to determine the most likely coded signal sequence directly from the unquantized channel outputs. The four-state trellis-coded modulation (TCM) schemes using 8-DPSK can improve the bit error rate.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"1 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":"122222886","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.160805
D. Swayne, J. Kerby, D. Lam, R. Benzonelli
The authors implemented a causal probability network (CPN) model using the HUGIN shell to represent part of the overall effect of acid precipitation on lakes. A tool for entering raw data into the CPN model, based on earlier rule-based modeling efforts by the RAISON project at Canada Centre for Inland Waters, Environment Canada, was developed. The network editor developed allows the water chemistry and flow data to be directly applied to calculate marginal distributions ready for input to HUGIN. The authors used the RAISON experience to draw preliminary conclusions concerning environmental models which have representation and propagation of uncertainties in hypotheses and outcomes. The authors show the utilization of Bayesian inference to the watershed aggregates defined for the earlier, rule-based model developed for acid rain. Naturally occurring and industrial causes of aquatic acidity are incorporated in a network with probabilities generated from observations. A sample CPN with four nodes is illustrated. It represents the relationship between water chemistry, color, sulfate load, and the percent reduction of acid neutralizing capacity in a lake.<>
{"title":"Applying uncertainty principles in environmental modelling","authors":"D. Swayne, J. Kerby, D. Lam, R. Benzonelli","doi":"10.1109/PACRIM.1991.160805","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160805","url":null,"abstract":"The authors implemented a causal probability network (CPN) model using the HUGIN shell to represent part of the overall effect of acid precipitation on lakes. A tool for entering raw data into the CPN model, based on earlier rule-based modeling efforts by the RAISON project at Canada Centre for Inland Waters, Environment Canada, was developed. The network editor developed allows the water chemistry and flow data to be directly applied to calculate marginal distributions ready for input to HUGIN. The authors used the RAISON experience to draw preliminary conclusions concerning environmental models which have representation and propagation of uncertainties in hypotheses and outcomes. The authors show the utilization of Bayesian inference to the watershed aggregates defined for the earlier, rule-based model developed for acid rain. Naturally occurring and industrial causes of aquatic acidity are incorporated in a network with probabilities generated from observations. A sample CPN with four nodes is illustrated. It represents the relationship between water chemistry, color, sulfate load, and the percent reduction of acid neutralizing capacity in a lake.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"4 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":"122334721","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.160773
Huang Jun, C. Shixin
The authors propose a soft bounded policy for congestion control of a communication network. The resultant blocking by this policy is examined. The key point is that congestion is usually not a static resource allocation problem. The chief cause of congestion is the dynamic property of traffic. Dynamic traffic needs a dynamic scheme. The soft bounded policy aims to fulfill the dynamic control of the system with a simple mechanism. The Simon's (1962) proposition and A. Kuczura's (1973) model are used to guide the control and analysis of the network. This policy and the evaluation model have removed the obstacles in previous work. The advantages of the policy are discussed.<>
{"title":"Soft bounded policy for congestion control of communication network","authors":"Huang Jun, C. Shixin","doi":"10.1109/PACRIM.1991.160773","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160773","url":null,"abstract":"The authors propose a soft bounded policy for congestion control of a communication network. The resultant blocking by this policy is examined. The key point is that congestion is usually not a static resource allocation problem. The chief cause of congestion is the dynamic property of traffic. Dynamic traffic needs a dynamic scheme. The soft bounded policy aims to fulfill the dynamic control of the system with a simple mechanism. The Simon's (1962) proposition and A. Kuczura's (1973) model are used to guide the control and analysis of the network. This policy and the evaluation model have removed the obstacles in previous work. The advantages of the policy are discussed.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"1 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":"131476110","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.160740
R. A. Law, T. W. Holm, N. Cox
The evolution of a successful telecommunications monitoring device is described from its inception to its installation across Canada. This product, called the service discrimination unit (SDU), is a powerful and flexible platform for digital processing of signals on a T1 span. Signal processing is provided by Motorola DSP56001 digital signal processors and control functions are provided by Motorola 68HC11 processors. The SDU's first commercial application is to apply the DSP processing power to determine if the traffic being carried on a telephone line is voice, modem data, or facsimile data.<>
{"title":"Real-time multi-channel monitoring of communications on a T1 span","authors":"R. A. Law, T. W. Holm, N. Cox","doi":"10.1109/PACRIM.1991.160740","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160740","url":null,"abstract":"The evolution of a successful telecommunications monitoring device is described from its inception to its installation across Canada. This product, called the service discrimination unit (SDU), is a powerful and flexible platform for digital processing of signals on a T1 span. Signal processing is provided by Motorola DSP56001 digital signal processors and control functions are provided by Motorola 68HC11 processors. The SDU's first commercial application is to apply the DSP processing power to determine if the traffic being carried on a telephone line is voice, modem data, or facsimile data.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"69 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":"134013408","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.160686
E. Paravalos, S. Fleisher
Block coded modulation (BCM) is a bandwidth efficient scheme that results from the combination of block coding and modulation. The concept of BCM is applied to frequency/phase modulation (FPM) schemes, and the coding gain over uncoded M-PSK, BCM M-PSK, and TCM FPM systems is demonstrated. It is found that block code configurations of low complexity yield coding gains on the order of 3 dB over uncoded modulation while higher complexity codes further improve the performance. A procedure is described for the construction of BCM trellis diagrams, and examples that demonstrate the applicability of the procedure are included.<>
{"title":"Block coded modulation: an application to frequency/phase modulation and a procedure for the construction of trellis diagrams","authors":"E. Paravalos, S. Fleisher","doi":"10.1109/PACRIM.1991.160686","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160686","url":null,"abstract":"Block coded modulation (BCM) is a bandwidth efficient scheme that results from the combination of block coding and modulation. The concept of BCM is applied to frequency/phase modulation (FPM) schemes, and the coding gain over uncoded M-PSK, BCM M-PSK, and TCM FPM systems is demonstrated. It is found that block code configurations of low complexity yield coding gains on the order of 3 dB over uncoded modulation while higher complexity codes further improve the performance. A procedure is described for the construction of BCM trellis diagrams, and examples that demonstrate the applicability of the procedure are included.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"39 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":"133478583","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.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.160838
A. Ogunfunmi, C. Pham
The authors present the transform-domain forward-backward least-mean-squares (LMS) (TFBLMS) adaptive algorithm, its properties, and applications. The authors demonstrate that the TFBLMS adaptive line enhancer (ALE) gives significantly improved convergence speed for various applications with colored noise inputs and same level of reduced misadjustment as the forward-backward LMS (FBLMS) ALE for a given convergence factor (adaptive step size). The authors examine the impacts of the backward prediction error and forward prediction error individually on the total misadjustment in both the FBLMS and TFBLMS algorithms. The choice of a suitable transform is discussed as an implementation issue for the TFBLMS algorithm.<>
{"title":"The transform-domain forward-backward LMS adaptive filter with applications","authors":"A. Ogunfunmi, C. Pham","doi":"10.1109/PACRIM.1991.160838","DOIUrl":"https://doi.org/10.1109/PACRIM.1991.160838","url":null,"abstract":"The authors present the transform-domain forward-backward least-mean-squares (LMS) (TFBLMS) adaptive algorithm, its properties, and applications. The authors demonstrate that the TFBLMS adaptive line enhancer (ALE) gives significantly improved convergence speed for various applications with colored noise inputs and same level of reduced misadjustment as the forward-backward LMS (FBLMS) ALE for a given convergence factor (adaptive step size). The authors examine the impacts of the backward prediction error and forward prediction error individually on the total misadjustment in both the FBLMS and TFBLMS algorithms. The choice of a suitable transform is discussed as an implementation issue for the TFBLMS algorithm.<<ETX>>","PeriodicalId":289986,"journal":{"name":"[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings","volume":"24 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":"124854814","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
扫码关注我们
求助内容：
应助结果提醒方式：