Pub Date : 1962-12-21DOI: 10.1109/TEC.1962.5219362
G. Dillard, R. E. Simmons
{"title":"An Electronic Generator of Random Numbers","authors":"G. Dillard, R. E. Simmons","doi":"10.1109/TEC.1962.5219362","DOIUrl":"https://doi.org/10.1109/TEC.1962.5219362","url":null,"abstract":"","PeriodicalId":177496,"journal":{"name":"IRE Trans. Electron. Comput.","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1962-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128609893","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 : 1962-12-01DOI: 10.1109/TEC.1962.5219464
R. Elfant
{"title":"Approximations for the Demagnetizing Factors of Hollow Cylinders Represented by Confocal Hollow Prolate Spheroids","authors":"R. Elfant","doi":"10.1109/TEC.1962.5219464","DOIUrl":"https://doi.org/10.1109/TEC.1962.5219464","url":null,"abstract":"","PeriodicalId":177496,"journal":{"name":"IRE Trans. Electron. Comput.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1962-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133963307","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 : 1962-12-01DOI: 10.1109/TEC.1962.5219463
H. Schmid
A single-variable function generator, based on a pulse averaging method,1 accepts a width-modulated pulse input. The clock generator accuracy determines the precision with which this device can produce a linear-segment curve. With 300-kc flip-flops in the clock, a static repeatability of ±0.02 per cent has been obtained with a carrier frequency of 100 cps, and ±1 per cent with a 10-kc carrier frequency. This device can multiply the single-variable function by a second input variable at no loss of accuracy and with no additional circuitry.
{"title":"Linear-Segment Function Generator","authors":"H. Schmid","doi":"10.1109/TEC.1962.5219463","DOIUrl":"https://doi.org/10.1109/TEC.1962.5219463","url":null,"abstract":"A single-variable function generator, based on a pulse averaging method,1 accepts a width-modulated pulse input. The clock generator accuracy determines the precision with which this device can produce a linear-segment curve. With 300-kc flip-flops in the clock, a static repeatability of ±0.02 per cent has been obtained with a carrier frequency of 100 cps, and ±1 per cent with a 10-kc carrier frequency. This device can multiply the single-variable function by a second input variable at no loss of accuracy and with no additional circuitry.","PeriodicalId":177496,"journal":{"name":"IRE Trans. Electron. Comput.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1962-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129318607","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 : 1962-12-01DOI: 10.1109/TEC.1962.5219458
R. Short
Using the contact network as a representative of the class of combinational branch-type networks, various realization techniques are examined for their applicability or adaptability to the particular class of complementary-output networks, that is, two-output networks which have exactly one active output for each combination of the independent variables. Some elementary structural characteristics are developed and a particular class of functions which are minimally realized in separate parts is discussed. Upper and lower bounds are derived for the the number of contacts required to realize an arbitrary n-variable specification. Rudin's interconnection rules are extended to the non-series-parallel case and examples are given of their application. Trees are discussed in terms of a specific procedure proposed for their realization. Finally, Calingaert's reduction of the general multi-output problem to a single-output problem is reviewed in terms of the specific class of networks of interest here, and results, in conjunction with Moore's tables of minimal four-variable networks, in a table of minimal three-variable complementary-output networks.
{"title":"The Design of Complementary-Output Networks","authors":"R. Short","doi":"10.1109/TEC.1962.5219458","DOIUrl":"https://doi.org/10.1109/TEC.1962.5219458","url":null,"abstract":"Using the contact network as a representative of the class of combinational branch-type networks, various realization techniques are examined for their applicability or adaptability to the particular class of complementary-output networks, that is, two-output networks which have exactly one active output for each combination of the independent variables. Some elementary structural characteristics are developed and a particular class of functions which are minimally realized in separate parts is discussed. Upper and lower bounds are derived for the the number of contacts required to realize an arbitrary n-variable specification. Rudin's interconnection rules are extended to the non-series-parallel case and examples are given of their application. Trees are discussed in terms of a specific procedure proposed for their realization. Finally, Calingaert's reduction of the general multi-output problem to a single-output problem is reviewed in terms of the specific class of networks of interest here, and results, in conjunction with Moore's tables of minimal four-variable networks, in a table of minimal three-variable complementary-output networks.","PeriodicalId":177496,"journal":{"name":"IRE Trans. Electron. Comput.","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1962-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130839245","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 : 1962-12-01DOI: 10.1109/TEC.1962.5219459
H. Yamada
As an attempt to investigate a general theory of real-time computability in digital computers, a subclass of Turing machines is formally introduced together with some classes of functions that are computable by them in real time. Then the existence is established of a class of recursive functions that are not computable in real time by use of a class of machines, no matter how general we make the machines subject to a given constraint.
{"title":"Real-Time Computation and Recursive Functions Not Real-Time Computable","authors":"H. Yamada","doi":"10.1109/TEC.1962.5219459","DOIUrl":"https://doi.org/10.1109/TEC.1962.5219459","url":null,"abstract":"As an attempt to investigate a general theory of real-time computability in digital computers, a subclass of Turing machines is formally introduced together with some classes of functions that are computable by them in real time. Then the existence is established of a class of recursive functions that are not computable in real time by use of a class of machines, no matter how general we make the machines subject to a given constraint.","PeriodicalId":177496,"journal":{"name":"IRE Trans. Electron. Comput.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1962-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114605410","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 : 1962-12-01DOI: 10.1109/TEC.1962.5219460
G. Metze
Binary division methods employing a redundant quotient representation in which quotient digits assume the values 0, 1, or ?1 have been analyzed previously. The method in which partial remainders are always normalized is of particular interest; it yields quotients represented with a minimal number of nonzero digits for all divisors D in the range ??|D|??. This method is extended to yield minimally represented quotients for all normalized divisors.
{"title":"A Class of Binary Divisions Yielding Minimally Represented Quotients","authors":"G. Metze","doi":"10.1109/TEC.1962.5219460","DOIUrl":"https://doi.org/10.1109/TEC.1962.5219460","url":null,"abstract":"Binary division methods employing a redundant quotient representation in which quotient digits assume the values 0, 1, or ?1 have been analyzed previously. The method in which partial remainders are always normalized is of particular interest; it yields quotients represented with a minimal number of nonzero digits for all divisors D in the range ??|D|??. This method is extended to yield minimally represented quotients for all normalized divisors.","PeriodicalId":177496,"journal":{"name":"IRE Trans. Electron. Comput.","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1962-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131843603","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 : 1962-12-01DOI: 10.1109/TEC.1962.5219461
L. Shew
The information storage density in digital magnetic recording is dependent on both the pulse resolution and the track definition. This paper is concerned with these two factors in the design of magnetic heads for noncontact recording.1 A concept of changed pole-tip geometry which led to a significant improvement of pulse resolution is introduced. A general expression based on ``single-pulse'' superposition is derived for various bit densities2 and data codes. In addition, several recording methods are discussed for achieving near-maximum track density2 under various head-repositioning error3 conditions. As shown, high-density heads for noncontact recording have been designed successfully by applying the concept and techniques developed. Good correlation has been realized between analytical and experimental results. Performance characteristics under simulated machine conditions are presented.
{"title":"High-Density Magnetic Head Design for Noncontact Recording","authors":"L. Shew","doi":"10.1109/TEC.1962.5219461","DOIUrl":"https://doi.org/10.1109/TEC.1962.5219461","url":null,"abstract":"The information storage density in digital magnetic recording is dependent on both the pulse resolution and the track definition. This paper is concerned with these two factors in the design of magnetic heads for noncontact recording.1 A concept of changed pole-tip geometry which led to a significant improvement of pulse resolution is introduced. A general expression based on ``single-pulse'' superposition is derived for various bit densities2 and data codes. In addition, several recording methods are discussed for achieving near-maximum track density2 under various head-repositioning error3 conditions. As shown, high-density heads for noncontact recording have been designed successfully by applying the concept and techniques developed. Good correlation has been realized between analytical and experimental results. Performance characteristics under simulated machine conditions are presented.","PeriodicalId":177496,"journal":{"name":"IRE Trans. Electron. Comput.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1962-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132353543","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
扫码关注我们
求助内容：
应助结果提醒方式：