Pub Date : 1979-12-01DOI: 10.1049/IJ-CDT.1979.0056
J. Nelson
A tabular method is described which permits immediate evaluation of the consequences of incomplete address decoding in microprocessor systems. The method is easy to apply and aids microprocessor system design in several ways: (a) the minimal address decoding requirements for a given system can be readily determined (b) undesirable simultaneous addressing of more than one device is avoided (c) address ranges which are available for system expansion are immediately apparent (d) if the available ranges are inadequate, the required additional decoding is readily determined.
{"title":"Tabular method for evaluation of incomplete address decoding in microprocessor systems","authors":"J. Nelson","doi":"10.1049/IJ-CDT.1979.0056","DOIUrl":"https://doi.org/10.1049/IJ-CDT.1979.0056","url":null,"abstract":"A tabular method is described which permits immediate evaluation of the consequences of incomplete address decoding in microprocessor systems. The method is easy to apply and aids microprocessor system design in several ways: (a) the minimal address decoding requirements for a given system can be readily determined (b) undesirable simultaneous addressing of more than one device is avoided (c) address ranges which are available for system expansion are immediately apparent (d) if the available ranges are inadequate, the required additional decoding is readily determined.","PeriodicalId":344610,"journal":{"name":"Iee Journal on Computers and Digital Techniques","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123550487","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":"6th annual symposium on computer architecture","authors":"G. Rao","doi":"10.1049/IJ-CDT:19790058","DOIUrl":"https://doi.org/10.1049/IJ-CDT:19790058","url":null,"abstract":"","PeriodicalId":344610,"journal":{"name":"Iee Journal on Computers and Digital Techniques","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121490314","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 : 1979-12-01DOI: 10.1049/IJ-CDT.1979.0052
K. Sohraby
A store-and-forward message-switching system is considered, in which the capacity of a channel can be changed dynamically in response to the number of messages awaiting transmission. Three different control strategies are considered. In one, the channel capacity is decided at fixed intervals of time; in the second, the interdecision intervals are random but conform to a fixed distribution; in the third, the decision is made on the arrival and departure of each message. The three strategies are analysed and compared.
{"title":"Adaptive-channel-capacity store-and-forward buffers","authors":"K. Sohraby","doi":"10.1049/IJ-CDT.1979.0052","DOIUrl":"https://doi.org/10.1049/IJ-CDT.1979.0052","url":null,"abstract":"A store-and-forward message-switching system is considered, in which the capacity of a channel can be changed dynamically in response to the number of messages awaiting transmission. Three different control strategies are considered. In one, the channel capacity is decided at fixed intervals of time; in the second, the interdecision intervals are random but conform to a fixed distribution; in the third, the decision is made on the arrival and departure of each message. The three strategies are analysed and compared.","PeriodicalId":344610,"journal":{"name":"Iee Journal on Computers and Digital Techniques","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131944388","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}
A method is presented for the segmentation of serial photographs of terrain on the basis of textural as well as spectral characteristics. The method addresses the problems of determining an optimum texture window size, avoiding misclassified areas near region boundaries (owing to the texture window overlapping two or more regions), and coping with textured and untextured regions co-existing in the same scene. The technique is illustrated by an example.
{"title":"Segmentation of terrain images using textural and spectral characteristics","authors":"D. Mason","doi":"10.1049/IJ-CDT:19790055","DOIUrl":"https://doi.org/10.1049/IJ-CDT:19790055","url":null,"abstract":"A method is presented for the segmentation of serial photographs of terrain on the basis of textural as well as spectral characteristics. The method addresses the problems of determining an optimum texture window size, avoiding misclassified areas near region boundaries (owing to the texture window overlapping two or more regions), and coping with textured and untextured regions co-existing in the same scene. The technique is illustrated by an example.","PeriodicalId":344610,"journal":{"name":"Iee Journal on Computers and Digital Techniques","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125365026","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":"4th international conference on software engineering","authors":"D. Cook","doi":"10.1049/IJ-CDT:19790060","DOIUrl":"https://doi.org/10.1049/IJ-CDT:19790060","url":null,"abstract":"","PeriodicalId":344610,"journal":{"name":"Iee Journal on Computers and Digital Techniques","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128676516","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 : 1979-12-01DOI: 10.1049/IJ-CDT.1979.0054
I. Witten, C. Corbett
This paper extends the well-known technique of linear signal analysis by predictive filtering to the case where the signals are multidimensional. The properties of the simplest possible multidimensional filter, with a 2-dimensional input and of first order, are examined in detail. It is shown that such filters generate linearly deformed logarithmic spirals, including conies as a special case. The technique can be used to identify segments of such curves drawn freehand in a computer graphics environment; and a system which incorporates it is described. One of the most useful features of the system is its ability to transform the curve by controlling the amount of spiralling, rotation, scaling and translation, on command from the user; this is easy to do because the geometric properties can be calculated from the predictive filter coefficients.
{"title":"Identification of multidimensional time series and its application in computer graphics","authors":"I. Witten, C. Corbett","doi":"10.1049/IJ-CDT.1979.0054","DOIUrl":"https://doi.org/10.1049/IJ-CDT.1979.0054","url":null,"abstract":"This paper extends the well-known technique of linear signal analysis by predictive filtering to the case where the signals are multidimensional. The properties of the simplest possible multidimensional filter, with a 2-dimensional input and of first order, are examined in detail. It is shown that such filters generate linearly deformed logarithmic spirals, including conies as a special case. The technique can be used to identify segments of such curves drawn freehand in a computer graphics environment; and a system which incorporates it is described. One of the most useful features of the system is its ability to transform the curve by controlling the amount of spiralling, rotation, scaling and translation, on command from the user; this is easy to do because the geometric properties can be calculated from the predictive filter coefficients.","PeriodicalId":344610,"journal":{"name":"Iee Journal on Computers and Digital Techniques","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116860862","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":"5th Symposium on microprocessors and microprogramming","authors":"P. Depledge","doi":"10.1049/IJ-CDT:19790057","DOIUrl":"https://doi.org/10.1049/IJ-CDT:19790057","url":null,"abstract":"","PeriodicalId":344610,"journal":{"name":"Iee Journal on Computers and Digital Techniques","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132203922","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 : 1979-10-01DOI: 10.1049/IJ-CDT.1979.0041
J. Muzio
Standard methods for Rademacher-Walsh spectral coefficients involve n2n operations to deduce the complete spectrum for a function of n variables. The number of operations required to evaluate only the low-order coefficients is discussed in this paper and an exact result for the number of operations in the evaluation of all coefficients of orders up to z (for some z less than n) is deduced. Although the number of operations is considerably reduced, data structures of greater complexity are required.
{"title":"Concerning low-order spectral coefficients","authors":"J. Muzio","doi":"10.1049/IJ-CDT.1979.0041","DOIUrl":"https://doi.org/10.1049/IJ-CDT.1979.0041","url":null,"abstract":"Standard methods for Rademacher-Walsh spectral coefficients involve n2n operations to deduce the complete spectrum for a function of n variables. The number of operations required to evaluate only the low-order coefficients is discussed in this paper and an exact result for the number of operations in the evaluation of all coefficients of orders up to z (for some z less than n) is deduced. Although the number of operations is considerably reduced, data structures of greater complexity are required.","PeriodicalId":344610,"journal":{"name":"Iee Journal on Computers and Digital Techniques","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117035341","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}
The paper presents a technique, based on probability theory, which detects a well behaved intermittent fault in combinatorial logic circuits. The procedure employs repeated applications of tests that detect solid faults in the circuit. The time period, during which a test is repeatedly applied, depends on the probability of detection desired and is derived from the Poisson distribution of statistics. The percentage of faults located using repeated tests via software simulation agrees very well with the statistical prediction.
{"title":"Method for the diagonosis of a single intermittent fault in combinatorial logic circuits","authors":"P. Lala, J. Missen","doi":"10.1049/IJ-CDT:19790039","DOIUrl":"https://doi.org/10.1049/IJ-CDT:19790039","url":null,"abstract":"The paper presents a technique, based on probability theory, which detects a well behaved intermittent fault in combinatorial logic circuits. The procedure employs repeated applications of tests that detect solid faults in the circuit. The time period, during which a test is repeatedly applied, depends on the probability of detection desired and is derived from the Poisson distribution of statistics. The percentage of faults located using repeated tests via software simulation agrees very well with the statistical prediction.","PeriodicalId":344610,"journal":{"name":"Iee Journal on Computers and Digital Techniques","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130994960","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 : 1979-10-01DOI: 10.1049/IJ-CDT.1979.0049
M. B. Webster, P. W. Baker
B.C.D. versions of known multiplier designs are presented; both achieve fast multiplication times without the high hardware cost typically associated with high speed. Serial b.c.d. addition and r.o.m. single-digit multipliers permit the substantial reductions in hardware cost, while higher clock frequencies offset the inherent slowness of the serial methods. Greatest cost-effectiveness is seen to be achieved through l.s.i. implementationn of a serial design which is easily extended for higher radix b.c.d. multiplication.
{"title":"B.C.D. multipliers","authors":"M. B. Webster, P. W. Baker","doi":"10.1049/IJ-CDT.1979.0049","DOIUrl":"https://doi.org/10.1049/IJ-CDT.1979.0049","url":null,"abstract":"B.C.D. versions of known multiplier designs are presented; both achieve fast multiplication times without the high hardware cost typically associated with high speed. Serial b.c.d. addition and r.o.m. single-digit multipliers permit the substantial reductions in hardware cost, while higher clock frequencies offset the inherent slowness of the serial methods. Greatest cost-effectiveness is seen to be achieved through l.s.i. implementationn of a serial design which is easily extended for higher radix b.c.d. multiplication.","PeriodicalId":344610,"journal":{"name":"Iee Journal on Computers and Digital Techniques","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115402287","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}