{"title":"Mixed-signal System-on-a-Chip (SoC) verification based on SystemVerilog model","authors":"Xiaokun Yang, X. Niu, J. Fan, Chiu Choi","doi":"10.1109/SSST.2013.6524952","DOIUrl":"https://doi.org/10.1109/SSST.2013.6524952","url":null,"abstract":"Simulation speed and a lack of test approaches are the main difficulties in the mixed-signal verification of a complex System-on-a-Chip (SoC). In this paper, an equivalent high-level Radio Frequency (RF) model is created by the SystemVerilog language and integrated into a mixed-signal SoC. Such a model can be executed on a digital simulator, which is dramatically faster than the traditional method using an analog solver. Some mixed-signal verification approaches based on digital methods (including constrained random data generation, assertion-based verification, coverage-driven verification, and Verification Methodology Manual) are also presented as well as a case on the integrated SoC.","PeriodicalId":130704,"journal":{"name":"45th Southeastern Symposium on System Theory","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130052230","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":"System interconnections and combinatorial integer sequences","authors":"W. Gray, M. Thitsa","doi":"10.1109/SSST.2013.6524939","DOIUrl":"https://doi.org/10.1109/SSST.2013.6524939","url":null,"abstract":"Given two nonlinear input-output systems which are analytic in the sense that they have convergent Fliess operator representations, it is known that their interconnection in almost any fashion will produce another system in this same class. Recent work has focused on characterizing the radius of convergence for a variety of such interconnections. A key observation in this analysis was that certain combinatorial integer sequences naturally appear. The first goal of this paper is to gather from the literature all the known relationships between system interconnections and such sequences and organize them in a coherent manner. In the process it becomes clear that Stirling numbers play a central role in the most nontrivial types of system interconnections, namely, cascade and feedback connections. The second goal is to describe these relationships.","PeriodicalId":130704,"journal":{"name":"45th Southeastern Symposium on System Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130976158","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 use of error correcting codes for nanoelectronic systems: Overview and future prospects","authors":"D. Hoe","doi":"10.1109/SSST.2013.6524960","DOIUrl":"https://doi.org/10.1109/SSST.2013.6524960","url":null,"abstract":"As CMOS devices scale to the very deep submicron (VDSM) regime they become more susceptible to transient faults such as memory bit flips due to alpha particles as well as permanent faults due to manufacturing issues. As the transition is made to emerging nanotechnologies, such as carbon nanotube transistors, the reliability of the electronic components will increasingly become a critical concern. One important solution is to borrow an idea from communication theory and use error correcting codes to improve performance. The interconnect or logic circuitry are analogous to a noisy communication channel. The use of error correcting codes (ECCs) has the potential to improve the computational capacity of the nanoscale circuitry and wires. This paper will survey the field of proposed solutions for use of ECCs in the area of interconnect and logic circuits. Discussion of the current state-of-the-art approaches is provided and some suggestions for future work for making ECCs a viable method of improving the performance of nanoelectronic systems is given.","PeriodicalId":130704,"journal":{"name":"45th Southeastern Symposium on System Theory","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122571889","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":"Stream cipher design using cellular automata implemented on FPGAs","authors":"L. Raut, D. Hoe","doi":"10.1109/SSST.2013.6524946","DOIUrl":"https://doi.org/10.1109/SSST.2013.6524946","url":null,"abstract":"Pseudo-random number generators (PRNGs) are a key component of stream ciphers used for encryption purposes. While linear feedback shift registers (LFSRs) combined with nonlinear feedback shift registers (NFSRs) have typically been utilized for PRNGs, the use of cellular automata (CA) is another viable option. This paper explores the combination of LFSRs and CA as the key components of an efficient stream cipher design for implementation on Field Programmable Gate Arrays (FPGAs). The proposed stream cipher design builds upon a recent published design known as A2U2. The suite of statistical tests found in the Diehard program is utilized to evaluate the quality of random numbers from the proposed CA-based stream cipher. Comparisons with the A2U2 design indicate that the use of CA have the potential to improve the quality of the random numbers generated and hence increase the security of the cipher.","PeriodicalId":130704,"journal":{"name":"45th Southeastern Symposium on System Theory","volume":"47 2-3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122301521","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":"Improving the speed of convergence of GMRES for certain perturbed tridiagonal systems","authors":"Huy V. Nguyen, M. Beauregard, R. Morgan","doi":"10.1109/SSST.2013.6524954","DOIUrl":"https://doi.org/10.1109/SSST.2013.6524954","url":null,"abstract":"Numerical approximations of partial differential equations often require the employment of spatial adaptation or the utilization of non-uniform grids to resolve fine details of the solution. While the governing continuous linear operator may be symmetric, the discretized version may lose this essential property as a result of adaptation or utilization of non-uniform grids. Commonly, the matrices can be viewed as a perturbation to a known matrix or to a previous iterate's matrix. In either case, a linear solver is deployed to solve the resulting linear system. Iterative methods provide a plausible and affordable way of completing this task and Krylov subspace methods, such as GMRES, are quite popular. Upon updating the matrices as a result of adaptation or multi-grid methodologies, approximate eigenvector information is known stemming from the prior GMRES iterative method. Hence, this information can be utilized to improve the convergence rate of the subsequent iterative method. A one dimensional Poisson problem is examined to illustrate this methodology while showing notable and quantifiable improvements over standard methods, such as GMRES-DR.","PeriodicalId":130704,"journal":{"name":"45th Southeastern Symposium on System Theory","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127928740","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":"Memristor Drift Model based on conservation of mobile vacancies","authors":"M. R. Rudra, R. Pieper","doi":"10.1109/SSST.2013.6524959","DOIUrl":"https://doi.org/10.1109/SSST.2013.6524959","url":null,"abstract":"A significant percentage of the analysis applied to memristors is based on the Linear Drift Model. In the Linear Drift Model the resistance of the doped region increases in direct proportion to the width of the doped region. It is shown that this is not consistent with the physical conservation of the mobile vacancies. A circuit model is proposed which is consistent with the conservation of the mobile vacancies and takes into account a high constant intrinsic resistivity indicative of the memristor “off state”. A numerical analysis (NA) scheme is tested and compared with reported Hewlett Packard memristor data and with the theoretical solution for the Linear Drift Model.","PeriodicalId":130704,"journal":{"name":"45th Southeastern Symposium on System Theory","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128538604","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":"Managing performance and efficiency of a processor","authors":"A. Shinde, V. Agrawal","doi":"10.1109/SSST.2013.6524953","DOIUrl":"https://doi.org/10.1109/SSST.2013.6524953","url":null,"abstract":"The performance of a processor generally means how fast it can execute a task. For a given architecture we can measure the size of a task as the number of clock cycles it will take to execute. Then clock frequency (f) will determine the execution time. Normally, the frequency can be raised if the supply voltage Vdd is increased. This, however, increases the power and energy used. We introduce a new measure, cycle efficiency (η) as cycles per joule that gives the rate of computational work per unit energy. Similar to f, η is also a function of Vdd. We provide a method of characterizing a processor in terms of its f and η versus Vdd characteristics. Intel Pentium M processor with an assumed 90nm CMOS PTM (predictive technology model) is used as an example. For a demonstration of performance and energy management, we consider a program that executes in 1.8 billion clock cycles. At the nominal operating supply of 1.2V we have f = 1.8GHz and η = 15 megacycles/joule. The program executes in 1 second and uses 120 joules. For operation at 0.6V, f = 277MHz and η = 70 megacycles/joule, resulting in a run time of 6.5 seconds and consumption of 25 joules. We also find a subthreshold voltage extreme of 200mV, f = 54.5MHz and η = 660 megacycles/joule. Now the program will take 33 seconds but will consume only 2.27 joules. Thus, using cycle efficiency and clock frequency one can manage the time and energy performances according to the requirements of a computing task.","PeriodicalId":130704,"journal":{"name":"45th Southeastern Symposium on System Theory","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123497666","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":"Approximation of P-V characteristic curves for use in maximum power point tracking algorithms","authors":"A. Leedy, K. E. Garcia","doi":"10.1109/SSST.2013.6524945","DOIUrl":"https://doi.org/10.1109/SSST.2013.6524945","url":null,"abstract":"A curve fitting method that approximates the P-V characteristic curve of a given solar array with a fourth order polynomial is presented. The coefficients of the approximated P-V characteristic curve are strongly dependent on cell temperature. The strong dependence of the P-V curve on cell temperature allows the P-V characteristic curve of a given system to be written as a function of both panel voltage and cell temperature. The curve fitting method presented can be used in an indirect maximum power point tracking algorithm for use with solar powered systems. Experimental results are presented to confirm the validity of the method.","PeriodicalId":130704,"journal":{"name":"45th Southeastern Symposium on System Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129742813","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":"Unexpected emergent behaviors from elementary swarms","authors":"J. Roach, W. Ewert, R. Marks, B. Thompson","doi":"10.1109/SSST.2013.6524964","DOIUrl":"https://doi.org/10.1109/SSST.2013.6524964","url":null,"abstract":"Swarms are collections of loosely coupled distinct agents each following simple rules. Swarms do not use central coordination AND individual agents need not be aware of the swarm's overall function. As each agent performs its task, the swarm collective can display unusual and unexpected emergent behaviors. For those swarms defying analytic evaluation, simulation remains as the only method to reveal emergent behavior. A number of swarms are simulated each with no more than simple rules to follow. Each simulation reveals an interesting and often surprising emergent behavior. Termites clear areas and stack wood chips, gnats naturally confine themselves to swarm inside a circle of fixed area and sand piles develop instabilities and avalanche. Possibly the most interesting simulation is predator swarms pursuing swarms of prey in a game we dub bullies and dweebs. Individual bullies can be ineffective in killing dweebs, for example, whereas a mob of bullies can be highly effective. Addition of stochastic component to dweeb motion in a swarm is essential for prolonging dweeb life. The swarms are illustrated using screen shots of the swarm dynamics. More interesting and insightful videos of the swarming are available on NeoSwarm.com.","PeriodicalId":130704,"journal":{"name":"45th Southeastern Symposium on System Theory","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116037733","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":"Relay positioning for energy saving in cooperative networks","authors":"V. Sivakumar, Donglin Hu, P. Agrawal","doi":"10.1109/SSST.2013.6524955","DOIUrl":"https://doi.org/10.1109/SSST.2013.6524955","url":null,"abstract":"The number of Access Points (AP) in a network is much smaller than the network users. Hence, some users may be far from Aps requiring more power to transmit data. Cooperative communication has been proposed, which uses the broadcast nature of the wireless medium to exploit the spatial diversity in wireless networks. Users in cooperative communication system work cooperatively by relaying the packets through a relay node(RN). One issue is to find an near optimal positions for the limited number of available relays to reduce energy consumption of the users. In this paper, we investigate the position of the relays and its effect on energy saving in cooperative wireless networks. Initially, we use a greedy algorithm to determine the position of the relays and determine the energy saving achieved from this algorithm. Then, we use our improved iterative algorithm to place the relays. Using simulations, we compare both the algorithms in terms of average energy consumption, average number of hops and average r-cover (RNs form an r-cover if each user is within distance at most r from the RN). It is evident from the simulation results that the improved algorithm outperforms the greedy algorithm in all the above mentioned aspects. The results provide us an insight into positioning of the relays in a cooperative wireless network to reduce energy consumption of the users.","PeriodicalId":130704,"journal":{"name":"45th Southeastern Symposium on System Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116340555","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}