liu.seSök publikationer i DiVA
Ändra sökning
Avgränsa sökresultatet
1234567 1 - 50 av 10420
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Aamir, Syed Ahmed
    Linköpings universitet. Linköpings universitet, Institutionen för systemteknik.
    A 65nm, Low Voltage, Fully Differential, SC Programmable Gain Amplifier for Video AFE2010Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Due to rapid growth of home entertainment consumer market, video technology has been continuously pushed to deliver sharper pictures with higher resolution. This has brought about stringent requirements on the video analog front end, which often coupled with the low power and low voltage regulations had to deal with short channel effects of the deep submicron CMOS processes.

    This thesis presents the design of a fully differential programmable gain amplifier, as a subcircuit of a larger video digitizing IC designed at division of Electronic Systems. The switched capacitor architecture of the PGA does not only buffer the signal, but performs compensation for the sync-tip of analog video signal.

    The pseudo differential OTA eliminates tail current source and maintains high signal swing and has efficient common mode feedforward mechanism. When coupled with a similar stage provides inherent common moode feedback without using an additional SC-CMFB block.

    The PGA has been implemented using a 65 nm digital CMOS process. Expected difficulties in a 1.2 V OTA design make themselves evident in 65 nm, which is why cascaded OTA structures were inevitable for attaining gain specification of 60 dB. Nested Miller compensation with a pole shifting source follower, stabilizes the multipole system. The final circuit attains up to 200 MHz bandwidth and maintains high output swing of 0.85 V. High slew rate and good common mode and power supply rejection are observed. Noise requirements require careful design of input differential stage. Although output source follower stabilized the system, it reduces significant bandwidth and adds to second order non-linearity.

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 2.
    Aamir, Syed Ahmed
    et al.
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Wikner, J Jacob
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    A 1.2-V pseudo-differential OTA with common-mode feedforward in 65-nm CMOS2010Ingår i: Proceedings of the 17th IEEE International Conference on Electronics, Circuits, and Systems, Institute of Electrical and Electronics Engineers (IEEE), 2010, s. 29-32Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this work, we describe the implementation of a 1. 2-V pseudo-differential operational transconductance amplifier (OTA) with common-mode feedforward (CMFF) and inher­ent common-mode feedback (CMFB) in a 65-nm, digital CMOS process. The OTA architecture provides an inher­ent CMFB when cascaded OTA structures are utilized andthis work has studied a cascaded amplifier consisting of fourstages. Due to the low-gain using core 65-nm circuit de­vices, the overall gain must be distributed on all four stages to acquire a gain of more than 60 dB, while maintaining a-3-dB bandwidth of 200 MHz. To achieve high gain, we propose using a modified, positive-feedback, cross-coupled input differential stage. The modified OTA achieves a high output swing of ± 0.85 V due to only two stacked transistors, 88 dB DC gain and a third-order harmonic of -60 dB for 800 mVpp at 30 MHz. Further on, in a capacitive buffer configuration, we achieve a high slew rate of 1240 V/µS, -3-dB bandwidth of 509 MHz, signal-to-noise ratio of 63 dB while consuming 10.4 mW power.

  • 3.
    Aamir, Syed Ahmed
    et al.
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Wikner, J Jacob
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    A 500-MHz low-voltage programmable gain amplifier for HD video in 65-nm CMOS2010Ingår i: Proceedings of 28th IEEE Norchip Conference., NORCHIP'10, Tampere: www.ieee.org , 2010, s. 1-4Konferensbidrag (Refereegranskat)
    Abstract [en]

    This work describes the implementation of a 1.2-V programmable gain amplifier (PGA) for high-definition (HD) video digitizers in a 65-nm digital CMOS process. The “pseudo” switched-capacitor (SC) PGA architecture buffers the video signal, without switching, during the active video. The SC circuitry is used for setup of DC operating point during horizontal and vertical blanking periods. Additionally, it compensates for the `sync-tip' of analog video signals to an equal blanking level for increased dynamic range to the digitizer following the PGA. The operational transconductance amplifier (OTA) employed as main amplifier in the PGA is a pseudo-differential, positive-feedback input stage architecture with a common-mode feedforward (CMFF) technique. The common-mode feedback (CMFB) is provided once two OTAs are cascaded. Schematic-level simulation results show that the OTA maintains a -3-dB bandwidth of 550 MHz, while keeping the distortion HD3 at -60 dB for a 30-MHz, 850 mVpp high definition video signal. The 88 dB DC gain is distributed among four OTA stages and the overall, combined PGA achieves a signal-to-noise ratio of 63 dB. Due to only two stacked transistors, it achieves high output swing of ±0.85 V, 1240 V/μs slew rate while consuming 10.4 mW power.

  • 4.
    Aasa, Amanda
    et al.
    Linköpings universitet, Institutionen för systemteknik, Elektroniska Kretsar och System.
    Svennblad, Amanda
    Linköpings universitet, Institutionen för systemteknik, Elektroniska Kretsar och System.
    Design of an Automated Test Setup for Power-Controlled Nerve Stimulator Using NFC for Implantable Sensors2021Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Electrical stimulation on nerves is a relatively new area of research and has been proved to speed up recoveryfrom nerve damage. In this work, the efficiency and stability of antennas integrated on printed circuit boards provided by the department of electrical engineering are examined. An automated test bench containing a stepmotor with a slider and an Arduino is created. Different setups were used when measuring on the boards, which resulted in that the largest antenna gave the most stable output despite the distance between transmitterand receiver. The conclusion was that the second best antenna and the smallest one would be suitable as well,and the better choice if it is to be implemented under the skin. A physical setup consisting of LEDs, an Arduino, a computer, and a function generator was created to examinethe voltage control functionality, where colored LEDs were lit depending on the voltage level. The functionality was then implemented in a circuit that in the future shall be integrated on the printed circuit board. To control high voltages a limiter circuit was examined and implemented. The circuit was simulated and tested, with a realization that a feature covering voltage enlargement is needed for the future. 

    Ladda ner fulltext (pdf)
    fulltext
  • 5.
    Abara, Precious Ugo
    et al.
    Univ Padua, Italy; Tech Univ Munich, Germany.
    Ticozzi, Francesco
    Univ Padua, Italy; Dartmouth Coll, NH 03755 USA.
    Altafini, Claudio
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten.
    Spectral Conditions for Stability and Stabilization of Positive Equilibria for a Class of Nonlinear Cooperative Systems2018Ingår i: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 63, nr 2, s. 402-417Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Nonlinear cooperative systems associated to vector fields that are concave or subhomogeneous describe well interconnected dynamics that are of key interest for communication, biological, economical, and neural network applications. For this class of positive systems, we provide conditions that guarantee existence, uniqueness and stability of strictly positive equilibria. These conditions can be formulated directly in terms of the spectral radius of the Jacobian of the system. If control inputs are available, then it is shown how to use state feedback to stabilize an equilibrium point in the interior of the positive orthant.

    Ladda ner fulltext (pdf)
    fulltext
  • 6.
    Abarghouyi, Hadis
    et al.
    IUST, Iran; MTNi Co, Iran.
    Razavizadeh, S. Mohammad
    IUST, Iran.
    Björnson, Emil
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska fakulteten.
    QoE-Aware Beamforming Design for Massive MIMO Heterogeneous Networks2018Ingår i: IEEE Transactions on Vehicular Technology, ISSN 0018-9545, E-ISSN 1939-9359, Vol. 67, nr 9, s. 8315-8323Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    One of the main goals of the future wireless networks is improving the users quality of experience (QoE). In this paper, we consider the problem of the QoE-based resource allocation in the downlink of a massive multiple-input multiple-output heterogeneous network. The network consists of a macrocell with a number of small cells embedded in it. The small cells base stations (BSs) are equipped with a few antennas, while the macro BS is equipped with a massive number of antennas. We consider the two services Video and Web Browsing and design the beamforming vectors at the BSs. The objective is to maximize the aggregated mean opinion score (MOS) of the users under constraints on the BSs powers and the required quality of service of the users. We also consider extra constraints on the QoE of users to more strongly enforce the QoE in the beamforming design. To reduce the complexity of the optimization problem, we suggest suboptimal and computationally efficient solutions. Our results illustrate that increasing the number of antennas at the BSs and also increasing the number of small cells antennas in the network leads to a higher user satisfaction.

  • 7. Beställ onlineKöp publikationen >>
    Abbas, Muhammad
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    On the Implementation of Integer and Non-Integer Sampling Rate Conversion2012Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    The main focus in this thesis is on the aspects related to the implementation of integer and non-integer sampling rate conversion (SRC). SRC is used in many communication and signal processing applications where two signals or systems having different sampling rates need to be interconnected. There are two basic approaches to deal with this problem. The first is to convert the signal to analog and then re-sample it at the desired rate. In the second approach, digital signal processing techniques are utilized to compute values of the new samples from the existing ones. The former approach is hardly used since the latter one introduces less noise and distortion. However, the implementation complexity for the second approach varies for different types of conversion factors. In this work, the second approach for SRC is considered and its implementation details are explored. The conversion factor in general can be an integer, a ratio of two integers, or an irrational number. The SRC by an irrational numbers is impractical and is generally stated for the completeness. They are usually approximated by some rational factor.

    The performance of decimators and interpolators is mainly determined by the filters, which are there to suppress aliasing effects or removing unwanted images. There are many approaches for the implementation of decimation and interpolation filters, and cascaded integrator comb (CIC) filters are one of them. CIC filters are most commonly used in the case of integer sampling rate conversions and often preferred due to their simplicity, hardware efficiency, and relatively good anti-aliasing (anti-imaging) characteristics for the first (last) stage of a decimation (interpolation). The multiplierless nature, which generally yields to low power consumption, makes CIC filters well suited for performing conversion at higher rate. Since these filters operate at the maximum sampling frequency, therefore, are critical with respect to power consumption. It is therefore necessary to have an accurate and efficient ways and approaches that could be utilized to estimate the power consumption and the important factors that are contributing to it. Switching activity is one such factor. To have a high-level estimate of dynamic power consumption, switching activity equations in CIC filters are derived, which may then be used to have an estimate of the dynamic power consumption. The modeling of leakage power is also included, which is an important parameter to consider since the input sampling rate may differ several orders of magnitude. These power estimates at higher level can then be used as a feed-back while exploring multiple alternatives.

    Sampling rate conversion is a typical example where it is required to determine the values between existing samples. The computation of a value between existing samples can alternatively be regarded as delaying the underlying signal by a fractional sampling period. The fractional-delay filters are used in this context to provide a fractional-delay adjustable to any desired value and are therefore suitable for both integer and non-integer factors. The structure that is used in the efficient implementation of a fractional-delay filter is know as Farrow structure or its modifications. The main advantage of the Farrow structure lies in the fact that it consists of fixed finite-impulse response (FIR) filters and there is only one adjustable fractional-delay parameter, used to evaluate a polynomial with the filter outputs as coefficients. This characteristic of the Farrow structure makes it a very attractive structure for the implementation. In the considered fixed-point implementation of the Farrow structure, closed-form expressions for suitable word lengths are derived based on scaling and round-off noise. Since multipliers share major portion of the total power consumption, a matrix-vector multiple constant multiplication approach is proposed to improve the multiplierless implementation of FIR sub-filters.

    The implementation of the polynomial part of the Farrow structure is investigated by considering the computational complexity of different polynomial evaluation schemes. By considering the number of operations of different types, critical path, pipelining complexity, and latency after pipelining, high-level comparisons are obtained and used to short list the suitable candidates. Most of these evaluation schemes require the explicit computation of higher order power terms. In the parallel evaluation of powers, redundancy in computations is removed by exploiting any possible sharing at word level and also at bit level. As a part of this, since exponents are additive under multiplication, an ILP formulation for the minimum addition sequence problem is proposed.

    Delarbeten
    1. Power Estimation of Recursive and Non-Recursive CIC Filters Implemented in Deep-Submicron Technology
    Öppna denna publikation i ny flik eller fönster >>Power Estimation of Recursive and Non-Recursive CIC Filters Implemented in Deep-Submicron Technology
    2010 (Engelska)Ingår i: Proceedings of International Conference on Green Circuits and Systems (ICGCS), 2010, Date: 21-23 June, 2010, IEEE , 2010, s. 221-225Konferensbidrag, Publicerat paper (Refereegranskat)
    Abstract [en]

    The power modeling of different realizations of cascaded integrator-comb (CIC) decimation filters has been a subject of several recent works. In this work we have extended these with modeling of leakage power, which is an important factor since the input sample rate may differ several orders of magnitude. Furthermore, we have pointed out the importance of the input wordlength on the comparison of recursive and nonrecursive implementations.

    Ort, förlag, år, upplaga, sidor
    IEEE, 2010
    Nationell ämneskategori
    Teknik och teknologier
    Identifikatorer
    urn:nbn:se:liu:diva-70451 (URN)10.1109/ICGCS.2010.5543063 (DOI)978-1-4244-6877-5 (ISBN)978-1-4244-6876-8 (ISBN)
    Konferens
    International Conference on Green Circuits and Systems (ICGCS), June 21–23, Shanghai, China
    Tillgänglig från: 2011-09-20 Skapad: 2011-09-08 Senast uppdaterad: 2015-03-11Bibliografiskt granskad
    2. Switching Activity Estimation of CIC Filter Integrators
    Öppna denna publikation i ny flik eller fönster >>Switching Activity Estimation of CIC Filter Integrators
    2010 (Engelska)Ingår i: Proceedings of Asia Pacific Conference on Postgraduate Research in Microelectronics and Electronics (PrimeAsia), 2010, Date:22-24 Sept. 2010, IEEE , 2010, s. 21-24Konferensbidrag, Publicerat paper (Refereegranskat)
    Abstract [en]

    In this work, a method for estimation of the switching activity in integrators is presented. To achieve low power, it is always necessary to develop accurate and efficient methods to estimate the switching activity. The switching activities are then used to estimate the power consumption. In our work, the switching activity is first estimated for the general purpose integrators and then it is extended for the estimation of switching activity in cascaded integrators in CIC filters.

    Ort, förlag, år, upplaga, sidor
    IEEE, 2010
    Nationell ämneskategori
    Teknik och teknologier
    Identifikatorer
    urn:nbn:se:liu:diva-70452 (URN)10.1109/PRIMEASIA.2010.5604971 (DOI)978-1-4244-6736-5 (ISBN)978-1-4244-6735-8 (ISBN)
    Konferens
    Asia Pacific Conference on Postgraduate Research in Microelectronics and Electronics (PrimeAsia), 22-24 September, Shanghai, China
    Anmärkning
    ©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. MUHAMMAD ABBAS and Oscar Gustafsson, Switching Activity Estimation of CIC Filter Integrators, 2010, Asia Pacific Conf. on Postgraduate Research in Microelectronics and Electronics, Shanghai, China. http://dx.doi.org/10.1109/PRIMEASIA.2010.5604971 Tillgänglig från: 2011-09-20 Skapad: 2011-09-08 Senast uppdaterad: 2015-03-11Bibliografiskt granskad
    3. Scaling of fractional delay filters based on the Farrow structure
    Öppna denna publikation i ny flik eller fönster >>Scaling of fractional delay filters based on the Farrow structure
    2009 (Engelska)Ingår i: Proceedings of IEEE International Symposium on Circuits and Systems, 2009. ISCAS 2009, Piscataway: IEEE , 2009, s. 489-492Konferensbidrag, Publicerat paper (Refereegranskat)
    Abstract [en]

    In this work we consider scaling of fractional delay filters using the Farrow structure. Based on the observation that the subfilters approximate the Taylor expansion of a differentiator, we derive estimates of the L2-norm scaling values at the outputs of each subfilter as well as at the inputs of each delay multiplier. The scaling values can then be used to derive suitable wordlengths in a fixed-point implementation.

    Ort, förlag, år, upplaga, sidor
    Piscataway: IEEE, 2009
    Nationell ämneskategori
    Signalbehandling
    Identifikatorer
    urn:nbn:se:liu:diva-51070 (URN)10.1109/ISCAS.2009.5117792 (DOI)000275929800123 ()978-1-4244-3827-3 (ISBN)
    Konferens
    IEEE International Symposium on Circuits and Systems, 24-27 May 2009, Taipei,Taiwan
    Tillgänglig från: 2009-10-15 Skapad: 2009-10-15 Senast uppdaterad: 2018-09-01Bibliografiskt granskad
    4. Computational and Implementation Complexity of Polynomial Evaluation Schemes
    Öppna denna publikation i ny flik eller fönster >>Computational and Implementation Complexity of Polynomial Evaluation Schemes
    2011 (Engelska)Ingår i: Proceedings of NORCHIP, 2011 Date:14-15 Nov. 2011, IEEE conference proceedings, 2011, s. 1-6Konferensbidrag, Publicerat paper (Refereegranskat)
    Abstract [en]

    In this work, we consider the computational complexity of different polynomial evaluation schemes. By considering the number of operations of different types, critical path, pipelining complexity, and latency after pipelining, high-level comparisons are obtained. These can then be used to short list suitable candidates for an implementation given the specifications. Not only multiplications are considered, but they are divided into data-data multiplications, squarers, and data-coefficient multiplications, as the latter can be optimized depending on implementation architecture and application.

    Ort, förlag, år, upplaga, sidor
    IEEE conference proceedings, 2011
    Nyckelord
    Adders, Computer architecture, Delay, Filtering algorithms, ISO, Pipeline processing, Polynomials
    Nationell ämneskategori
    Teknik och teknologier
    Identifikatorer
    urn:nbn:se:liu:diva-73935 (URN)10.1109/NORCHP.2011.6126735 (DOI)978-1-4577-0515-1 (ISBN)978-1-4577-0514-4 (ISBN)
    Konferens
    NORCHIP 2011. The Nordic Microelectronics event, 29th Norchip Conference 14-15 November 2011, Lund, Sweden
    Tillgänglig från: 2012-01-17 Skapad: 2012-01-17 Senast uppdaterad: 2015-03-11Bibliografiskt granskad
    5. Low-Complexity Parallel Evaluation of Powers Exploiting Bit-Level Redundancy
    Öppna denna publikation i ny flik eller fönster >>Low-Complexity Parallel Evaluation of Powers Exploiting Bit-Level Redundancy
    2010 (Engelska)Ingår i: Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers (ASILOMAR), 2010, 7-10 Nov. 2010 / [ed] Michael B. Matthews, Washington, DC, USA: IEEE Computer Society , 2010, s. 1168-1172Konferensbidrag, Publicerat paper (Refereegranskat)
    Abstract [en]

    In this work, we investigate the problem of computing any requested set of power terms in parallel using summations trees. This problem occurs in applications like polynomial approximation, Farrow filters (polynomial evaluation part) etc. In the proposed technique, the partial product of each power term is initially computed independently. A redundancy check is then made in each and among all partial products matrices at bit level. The redundancy here relates to the fact that same three partial products may be present in more than one columns, and, hence, can be mapped to the same full adder. The proposed algorithm is tested for different sets of powers and wordlengths to exploit the sharing potential.

    Ort, förlag, år, upplaga, sidor
    Washington, DC, USA: IEEE Computer Society, 2010
    Serie
    Asilomar Conference on Signals, Systems and Computers. Conference Record, ISSN 1058-6393
    Nationell ämneskategori
    Teknik och teknologier
    Identifikatorer
    urn:nbn:se:liu:diva-70453 (URN)10.1109/ACSSC.2010.5757714 (DOI)978-1-4244-9722-5 (ISBN)
    Konferens
    Signals, Systems and Computers (ASILOMAR), 2010, 7-10 Nov. 2010 , Pacific Grove, CA, USA
    Tillgänglig från: 2011-09-20 Skapad: 2011-09-08 Senast uppdaterad: 2015-03-11Bibliografiskt granskad
    6. Integer Linear Programming Modeling of Addition Sequences With Additional Constraints for Evaluation of Power Terms
    Öppna denna publikation i ny flik eller fönster >>Integer Linear Programming Modeling of Addition Sequences With Additional Constraints for Evaluation of Power Terms
    (Engelska)Manuskript (preprint) (Övrigt vetenskapligt)
    Abstract [en]

    In this work, an integer linear programming (ILP) based model is proposed for the computation of a minimal cost addition sequence for a given set of integers. Since exponents are additive under multiplication, the minimal length addition sequence will provide an optimal solution for the evaluation of a requested set of power terms. This in turn finds application in, e.g., window-based exponentiation for cryptography and polynomial evaluation. Not only is an optimal model proposed, the model is extended to consider different costs for multipliers and squarers as well as controlling the depth of the resulting addition sequence.

    Nationell ämneskategori
    Teknik och teknologier
    Identifikatorer
    urn:nbn:se:liu:diva-73936 (URN)
    Tillgänglig från: 2012-01-17 Skapad: 2012-01-17 Senast uppdaterad: 2015-03-11Bibliografiskt granskad
    7. Switching Activity Estimation of DDFS Phase Accumulators
    Öppna denna publikation i ny flik eller fönster >>Switching Activity Estimation of DDFS Phase Accumulators
    (Engelska)Manuskript (preprint) (Övrigt vetenskapligt)
    Abstract [en]

    In this letter, equations for the one’s probability and switching activities for direct digital frequency synthesis (DDFS) phase accumulators are derived. These results are useful for obtaining good accuracy estimated of both leakage and dynamic power consumption for the phase accumulator and the phase-to-magnitude converter.

    Nationell ämneskategori
    Teknik och teknologier
    Identifikatorer
    urn:nbn:se:liu:diva-73937 (URN)
    Tillgänglig från: 2012-01-17 Skapad: 2012-01-17 Senast uppdaterad: 2015-03-11Bibliografiskt granskad
    Ladda ner fulltext (pdf)
    On the Implementation of Integer and Non-Integer Sampling Rate Conversion
    Ladda ner (pdf)
    omslag
  • 8.
    Abbas, Muhammad
    et al.
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Gustafsson, Oscar
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Computational and Implementation Complexity of Polynomial Evaluation Schemes2011Ingår i: Proceedings of NORCHIP, 2011 Date:14-15 Nov. 2011, IEEE conference proceedings, 2011, s. 1-6Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this work, we consider the computational complexity of different polynomial evaluation schemes. By considering the number of operations of different types, critical path, pipelining complexity, and latency after pipelining, high-level comparisons are obtained. These can then be used to short list suitable candidates for an implementation given the specifications. Not only multiplications are considered, but they are divided into data-data multiplications, squarers, and data-coefficient multiplications, as the latter can be optimized depending on implementation architecture and application.

  • 9.
    Abbas, Muhammad
    et al.
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Gustafsson, Oscar
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Integer Linear Programming Modeling of Addition Sequences With Additional Constraints for Evaluation of Power TermsManuskript (preprint) (Övrigt vetenskapligt)
    Abstract [en]

    In this work, an integer linear programming (ILP) based model is proposed for the computation of a minimal cost addition sequence for a given set of integers. Since exponents are additive under multiplication, the minimal length addition sequence will provide an optimal solution for the evaluation of a requested set of power terms. This in turn finds application in, e.g., window-based exponentiation for cryptography and polynomial evaluation. Not only is an optimal model proposed, the model is extended to consider different costs for multipliers and squarers as well as controlling the depth of the resulting addition sequence.

  • 10.
    Abbas, Muhammad
    et al.
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Gustafsson, Oscar
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Switching Activity Estimation of CIC Filter Integrators2010Ingår i: Proceedings of Asia Pacific Conference on Postgraduate Research in Microelectronics and Electronics (PrimeAsia), 2010, Date:22-24 Sept. 2010, IEEE , 2010, s. 21-24Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this work, a method for estimation of the switching activity in integrators is presented. To achieve low power, it is always necessary to develop accurate and efficient methods to estimate the switching activity. The switching activities are then used to estimate the power consumption. In our work, the switching activity is first estimated for the general purpose integrators and then it is extended for the estimation of switching activity in cascaded integrators in CIC filters.

    Ladda ner fulltext (pdf)
    fulltext
  • 11.
    Abbas, Muhammad
    et al.
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Gustafsson, Oscar
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Switching Activity Estimation of DDFS Phase AccumulatorsManuskript (preprint) (Övrigt vetenskapligt)
    Abstract [en]

    In this letter, equations for the one’s probability and switching activities for direct digital frequency synthesis (DDFS) phase accumulators are derived. These results are useful for obtaining good accuracy estimated of both leakage and dynamic power consumption for the phase accumulator and the phase-to-magnitude converter.

  • 12.
    Abbas, Muhammad
    et al.
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Gustafsson, Oscar
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Blad, Anton
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Low-Complexity Parallel Evaluation of Powers Exploiting Bit-Level Redundancy2010Ingår i: Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers (ASILOMAR), 2010, 7-10 Nov. 2010 / [ed] Michael B. Matthews, Washington, DC, USA: IEEE Computer Society , 2010, s. 1168-1172Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this work, we investigate the problem of computing any requested set of power terms in parallel using summations trees. This problem occurs in applications like polynomial approximation, Farrow filters (polynomial evaluation part) etc. In the proposed technique, the partial product of each power term is initially computed independently. A redundancy check is then made in each and among all partial products matrices at bit level. The redundancy here relates to the fact that same three partial products may be present in more than one columns, and, hence, can be mapped to the same full adder. The proposed algorithm is tested for different sets of powers and wordlengths to exploit the sharing potential.

  • 13.
    Abbas, Muhammad
    et al.
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Gustafsson, Oscar
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Johansson, Håkan
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    On the Fixed-Point Implementation of Fractional-Delay Filters Based on the Farrow Structure2013Ingår i: IEEE Transactions on Circuits and Systems Part 1: Regular Papers, ISSN 1549-8328, E-ISSN 1558-0806, Vol. 60, nr 4, s. 926-937Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper, the fixed-point implementation of adjustable fractional-delay filters using the Farrow structure is considered. Based on the observation that the sub-filters approximate differentiators, closed-form expressions for the L-2-norm scaling values at the outputs of each sub-filter as well as at the inputs of each delay multiplier are derived. The scaling values can then be used to derive suitable word lengths by also considering the round-off noise analysis and optimization. Different approaches are proposed to derive suitable word lengths including one based on integer linear programming, which always gives an optimal allocation. Finally, a new approach for multiplierless implementation of the sub-filters in the Farrow structure is suggested. This is shown to reduce register complexity and, for most word lengths, require less number of adders and subtracters when compared to existing approaches.

  • 14.
    Abbas, Muhammad
    et al.
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Gustafsson, Oscar
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Johansson, Håkan
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Scaling of fractional delay filters based on the Farrow structure2009Ingår i: Proceedings of IEEE International Symposium on Circuits and Systems, 2009. ISCAS 2009, Piscataway: IEEE , 2009, s. 489-492Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this work we consider scaling of fractional delay filters using the Farrow structure. Based on the observation that the subfilters approximate the Taylor expansion of a differentiator, we derive estimates of the L2-norm scaling values at the outputs of each subfilter as well as at the inputs of each delay multiplier. The scaling values can then be used to derive suitable wordlengths in a fixed-point implementation.

  • 15.
    Abbas, Muhammad
    et al.
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Gustafsson, Oscar
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Wanhammar, Lars
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Power Estimation of Recursive and Non-Recursive CIC Filters Implemented in Deep-Submicron Technology2010Ingår i: Proceedings of International Conference on Green Circuits and Systems (ICGCS), 2010, Date: 21-23 June, 2010, IEEE , 2010, s. 221-225Konferensbidrag (Refereegranskat)
    Abstract [en]

    The power modeling of different realizations of cascaded integrator-comb (CIC) decimation filters has been a subject of several recent works. In this work we have extended these with modeling of leakage power, which is an important factor since the input sample rate may differ several orders of magnitude. Furthermore, we have pointed out the importance of the input wordlength on the comparison of recursive and nonrecursive implementations.

  • 16.
    Abbas, Muhammad
    et al.
    Linköpings universitet, Institutionen för systemteknik. Linköpings universitet, Tekniska högskolan.
    Qureshi, Fahad
    Linköpings universitet, Institutionen för systemteknik. Linköpings universitet, Tekniska högskolan.
    Ullah Sheikh, Zaka
    Linköpings universitet, Institutionen för systemteknik. Linköpings universitet, Tekniska högskolan.
    Gustafsson, Oscar
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Johansson, Håkan
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Johansson, Kenny
    Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
    Comparison of Multiplierless Implementation of Nonlinear-Phase Versus Linear-Phase FIR filters2008Konferensbidrag (Refereegranskat)
    Abstract [en]

    FIR filters are often used because of their linear-phase response. However, there are certain applications where the linear-phase property is not required, such as signal energy estimation, but IIR filters can not be used due to the limitation of sample rate imposed by the recursive algorithm. In this work, we discuss multiplierless implementation of minimum order, and therefore nonlinear-phase, FIR filters and compare it to the linear-phase counterpart.

  • 17.
    Abdella, Juhar Ahmed
    et al.
    UAEU, U Arab Emirates.
    Zaki, N. M.
    UAEU, U Arab Emirates.
    Shuaib, Khaled
    UAEU, U Arab Emirates.
    Khan, Fahad
    Linköpings universitet, Institutionen för systemteknik, Datorseende. Linköpings universitet, Tekniska fakulteten.
    Airline ticket price and demand prediction: A survey2021Ingår i: Journal of King Saud University - Computer and Information Sciences, ISSN 1319-1578, Vol. 33, nr 4, s. 375-391Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Nowadays, airline ticket prices can vary dynamically and significantly for the same flight, even for nearby seats within the same cabin. Customers are seeking to get the lowest price while airlines are trying to keep their overall revenue as high as possible and maximize their profit. Airlines use various kinds of computational techniques to increase their revenue such as demand prediction and price discrimination. From the customer side, two kinds of models are proposed by different researchers to save money for customers: models that predict the optimal time to buy a ticket and models that predict the minimum ticket price. In this paper, we present a review of customer side and airlines side prediction models. Our review analysis shows that models on both sides rely on limited set of features such as historical ticket price data, ticket purchase date and departure date. Features extracted from external factors such as social media data and search engine query are not considered. Therefore, we introduce and discuss the concept of using social media data for ticket/demand prediction. (c) 2019 The Authors. Production and hosting by Elsevier B.V. on behalf of King Saud University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

    Ladda ner fulltext (pdf)
    fulltext
  • 18.
    Abdullah Jan, Mirza
    et al.
    Linköpings universitet, Institutionen för systemteknik.
    Ahsan, Mahmododfateh
    Linköpings universitet, Institutionen för systemteknik.
    Multi-View Video Transmission over the Internet2010Självständigt arbete på avancerad nivå (masterexamen), 30 poäng / 45 hpStudentuppsats (Examensarbete)
    Abstract [en]

    3D television using multiple views rendering is receiving increasing interest. In this technology a number of video sequences are transmitted simultaneously and provides a larger view of the scene or stereoscopic viewing experience. With two views stereoscopic rendition is possible. Nowadays 3D displays are available that are capable of displaying several views simultaneously and the user is able to see different views by moving his head.

    The thesis work aims at implementing a demonstration system with a number of simultaneous views. The system will include two cameras, computers at both the transmitting and receiving end and a multi-view display. Besides setting up the hardware, the main task is to implement software so that the transmission can be done over an IP-network.

    This thesis report includes an overview and experiences of similar published systems, the implementation of real time video, its compression, encoding, and transmission over the internet with the help of socket programming and finally the multi-view display in 3D format.  This report also describes the design considerations more precisely regarding the video coding and network protocols.

    Ladda ner fulltext (pdf)
    FULLTEXT02
  • 19.
    Abellán, C.
    et al.
    ICFO - Institut de Ciencies Fotoniques, The Barcelona Institute of Science and Technology, Barcelona, Spain.
    Acín, A.
    ICFO - Institut de Ciencies Fotoniques, The Barcelona Institute of Science and Technology, Barcelona, Spain / ICREA - Institució Catalana de Recerca i Estudis Avançats, Barcelona, Spain.
    Alarcón, A.
    Millennium Institute for Research in Optics, Universidad de Concepción, Concepción, Chile; Departamento de Ingeniería Eléctrica, Universidad de Concepción, Concepción, Chile.
    Alibart, O.
    Université Côte d’Azur, CNRS UMR 7010, Institut de Physique de Nice (INPHYNI), Nice, France.
    Andersen, C. K.
    Department of Physics, ETH Zurich, Zurich, Switzerland.
    Andreoli, F.
    Dipartimento di Fisica, Sapienza Università di Roma, Rome, Italy.
    Beckert, A.
    Department of Physics, ETH Zurich,, Zurich, Switzerland.
    Beduini, F. A.
    ICFO - Institut de Ciencies Fotoniques, The Barcelona Institute of Science and Technology, Barcelona, Spain.
    Bendersky, A.
    Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires; Instituto de Investigación en Ciencias de la Comunicación (ICC), CONICET, Buenos Aires, Argentina.
    Bentivegna, M.
    Dipartimento di Fisica, Sapienza Università di Roma, Rome, Italy.
    Bierhorst, P.
    National Institute of Standards and Technology, Boulder, CO, USA.
    Burchardt, D.
    Ludwig-Maximilians-Universität, Munich, Germany.
    Cabello, A.
    Departamento de Física Aplicada II, Universidad de Sevilla, Seville, Spain.
    Cariñe, J.
    Millennium Institute for Research in Optics, Universidad de Concepción, Universidad de Concepción, Concepción, Chile.
    Carrasco, S.
    ICFO - Institut de Ciencies Fotoniques, The Barcelona Institute of Science and Technology, Barcelona, Spain.
    Carvacho, G.
    Dipartimento di Fisica, Sapienza Università di Roma, Rome, Italy.
    Cavalcanti, D.
    Chaves, R.
    Cortés-Vega, J.
    Cuevas, A.
    Delgado, A.
    de Riedmatten, H.
    Eichler, C.
    Farrera, P.
    Fuenzalida, J.
    García-Matos, M.
    Garthoff, R.
    Gasparinetti, S.
    Gerrits, T.
    Ghafari Jouneghani, F.
    Glancy, S.
    Gómez, E. S.
    González, P.
    Guan, J. -Y.
    Handsteiner, J.
    Heinsoo, J.
    Heintze, G.
    Hirschmann, A.
    Jiménez, O.
    Kaiser, F.
    Knill, E.
    Knoll, L. T.
    Krinner, S.
    Kurpiers, P.
    Larotonda, M. A.
    Larsson, Jan-Åke
    Linköpings universitet, Institutionen för systemteknik, Informationskodning. Linköpings universitet, Tekniska fakulteten.
    Lenhard, A.
    Li, H.
    Li, M. -H.
    Lima, G.
    Liu, B.
    Liu, Y.
    López Grande, I. H.
    Lunghi, T.
    Ma, X.
    Magaña-Loaiza, O. S.
    Magnard, P.
    Magnoni, A.
    Martí­-Prieto, M.
    Martínez, D.
    Mataloni, P.
    Mattar, A.
    Mazzera, M.
    Mirin, R. P.
    Mitchell, M. W.
    Nam, S.
    Oppliger, M.
    Pan, J. -W.
    Patel, R. B.
    Pryde, G. J.
    Rauch, D.
    Redeker, K.
    Rieländer, D.
    Ringbauer, M.
    Roberson, T.
    Rosenfeld, W.
    Salathé, Y.
    Santodonato, L.
    Sauder, G.
    Scheidl, T.
    Schmiegelow, C. T.
    Sciarrino, F.
    Seri, A.
    Shalm, L. K.
    Shi, S. -C
    Slussarenko, S.
    Stevens, M. J.
    Tanzilli, S.
    Toledo, F.
    Tura, J.
    Ursin, R.
    Vergyris, P.
    Verma, V. B.
    Walter, T.
    Wallraff, A.
    Wang, Z.
    Weinfurter, H.
    Weston, M. M.
    White, A. G.
    Wu, C.
    Xavier, Guilherme B.
    Linköpings universitet, Institutionen för systemteknik, Informationskodning. Linköpings universitet, Tekniska fakulteten.
    You, L.
    Yuan, X.
    Zeilinger, A.
    Zhang, Q.
    Zhang, W.
    Zhong, J.
    Challenging Local Realism with Human Choices2018Ingår i: Nature, ISSN 0028-0836, E-ISSN 1476-4687, Vol. 557, s. 212-216Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    A Bell test is a randomized trial that compares experimental observations against the philosophical worldview of local realism , in which the properties of the physical world are independent of our observation of them and no signal travels faster than light. A Bell test requires spatially distributed entanglement, fast and high-efficiency detection and unpredictable measurement settings. Although technology can satisfy the first two of these requirements, the use of physical devices to choose settings in a Bell test involves making assumptions about the physics that one aims to test. Bell himself noted this weakness in using physical setting choices and argued that human 'free will' could be used rigorously to ensure unpredictability in Bell tests. Here we report a set of local-realism tests using human choices, which avoids assumptions about predictability in physics. We recruited about 100,000 human participants to play an online video game that incentivizes fast, sustained input of unpredictable selections and illustrates Bell-test methodology. The participants generated 97,347,490 binary choices, which were directed via a scalable web platform to 12 laboratories on five continents, where 13 experiments tested local realism using photons, single atoms, atomic ensembles and superconducting devices. Over a 12-hour period on 30 November 2016, participants worldwide provided a sustained data flow of over 1,000 bits per second to the experiments, which used different human-generated data to choose each measurement setting. The observed correlations strongly contradict local realism and other realistic positions in bi-partite and tri-partite 12 scenarios. Project outcomes include closing the 'freedom-of-choice loophole' (the possibility that the setting choices are influenced by 'hidden variables' to correlate with the particle properties), the utilization of video-game methods for rapid collection of human-generated randomness, and the use of networking techniques for global participation in experimental science.

    Ladda ner fulltext (pdf)
    Challenging local realism with human choices
  • 20.
    Aberger, Martin
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska högskolan.
    Effects of Nonlinearities in Black Box Identification of an Industrial Robot2000Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This paper discusses effects of nonlinearities in black box identification of one axis of a robot. The used data come from a commercial ABB robot, IRB1400. A three-mass flexible model for the robot was built in MathModelica. The nonlinearities in the model are nonlinear friction and backlash in the gear box.

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 21. Beställ onlineKöp publikationen >>
    Abidin, Aysajan
    Linköpings universitet, Institutionen för systemteknik, Informationskodning. Linköpings universitet, Tekniska högskolan.
    Authentication in Quantum Key Distribution: Security Proof and Universal Hash Functions2013Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    Quantum Key Distribution (QKD) is a secret key agreement technique that consists of two parts: quantum transmission and measurement on a quantum channel, and classical post-processing on a public communication channel. It enjoys provable unconditional security provided that the public communication channel is immutable. Otherwise, QKD is vulnerable to a man-in-the-middle attack. Immutable public communication channels, however, do not exist in practice. So we need to use authentication that implements the properties of an immutable channel as well as possible. One scheme that serves this purpose well is the Wegman-Carter authentication (WCA), which is built upon Almost Strongly Universal2 (ASU2) hashing. This scheme uses a new key in each authentication attempt to select a hash function from an ASU2 family, which is then used to generate the authentication tag for a message.

    The main focus of this dissertation is on authentication in the context of QKD. We study ASU2 hash functions, security of QKD that employs a computationally secure authentication, and also security of authentication with a partially known key. Specifically, we study the following.

    First, Universal hash functions and their constructions are reviewed, and as well as a new construction of ASU2 hash functions is presented. Second, security of QKD that employs a specific computationally secure authentication is studied. We present detailed attacks on various practical implementations of QKD that employs this authentication. We also provide countermeasures and prove necessary and sufficient conditions for upgrading the security of the authentication to the level of unconditional security. Third, Universal hash function based multiple authentication is studied. This uses a fixed ASU2 hash function followed by one-time pad encryption, to keep the hash function secret. We show that the one-time pad is necessary in every round for the authentication to be unconditionally secure. Lastly, we study security of the WCA scheme, in the case of a partially known authentication key. Here we prove tight information-theoretic security bounds and also analyse security using witness indistinguishability as used in the Universal Composability framework.

    Delarbeten
    1. New Universal Hash Functions
    Öppna denna publikation i ny flik eller fönster >>New Universal Hash Functions
    2012 (Engelska)Ingår i: Lecture Notes in Computer Science, Vol. 7242 / [ed] Frederik Armknecht and Stefan Lucks, Springer Berlin Heidelberg , 2012, s. 99-108Konferensbidrag, Publicerat paper (Refereegranskat)
    Abstract [en]

    Universal hash functions are important building blocks for unconditionally secure message authentication codes. In this paper, we present a new construction of a class of Almost Strongly Universal hash functions with much smaller description (or key) length than the Wegman-Carter construction. Unlike some other constructions, our new construction has a very short key length and a security parameter that is independent of the message length, which makes it suitable for authentication in practical applications such as Quantum Cryptography.

    Ort, förlag, år, upplaga, sidor
    Springer Berlin Heidelberg, 2012
    Serie
    Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 7242
    Nationell ämneskategori
    Annan elektroteknik och elektronik
    Identifikatorer
    urn:nbn:se:liu:diva-84711 (URN)10.1007/978-3-642-34159-5_7 (DOI)978-3-642-34158-8 (ISBN)978-3-642-34159-5 (ISBN)
    Konferens
    4th Western European Workshop on Research in Cryptology, WEWoRC 2011, Weimar, Germany, July 20-22, 2011
    Projekt
    ICG QC
    Tillgänglig från: 2012-10-18 Skapad: 2012-10-17 Senast uppdaterad: 2018-01-31
    2. Vulnerability of "A Novel Protocol-Authentication Algorithm Ruling out a Man-in-the-Middle Attack in Quantum Cryptography"
    Öppna denna publikation i ny flik eller fönster >>Vulnerability of "A Novel Protocol-Authentication Algorithm Ruling out a Man-in-the-Middle Attack in Quantum Cryptography"
    2009 (Engelska)Ingår i: International Journal of Quantum Information, ISSN 0219-7499, Vol. 7, nr 5, s. 1047-1052Artikel i tidskrift (Refereegranskat) Published
    Abstract [en]

    In this paper, we review and comment on "A novel protocol-authentication algorithm ruling out a man-in-the-middle attack in quantum cryptography" [M. Peev et al., Int. J. Quant. Inf. 3 (2005) 225]. In particular, we point out that the proposed primitive is not secure when used in a generic protocol, and needs additional authenticating properties of the surrounding quantum-cryptographic protocol.

    Nyckelord
    Quantum cryptography, quantum key distribution, authentication
    Nationell ämneskategori
    Naturvetenskap
    Identifikatorer
    urn:nbn:se:liu:diva-20405 (URN)10.1142/S0219749909005754 (DOI)
    Projekt
    ICG QC
    Tillgänglig från: 2009-09-08 Skapad: 2009-09-07 Senast uppdaterad: 2019-08-15Bibliografiskt granskad
    3. Attacks on quantum key distribution protocols that employ non-ITS authentication
    Öppna denna publikation i ny flik eller fönster >>Attacks on quantum key distribution protocols that employ non-ITS authentication
    Visa övriga...
    2016 (Engelska)Ingår i: Quantum Information Processing, ISSN 1570-0755, E-ISSN 1573-1332, Vol. 15, nr 1, s. 327-362Artikel i tidskrift (Refereegranskat) Published
    Abstract [en]

    We demonstrate how adversaries with unbounded computing resources can break Quantum Key Distribution (QKD) protocols which employ a particular message authentication code suggested previously. This authentication code, featuring low key consumption, is not Information-Theoretically Secure (ITS) since for each message the eavesdropper has intercepted she is able to send a different message from a set of messages that she can calculate by finding collisions of a cryptographic hash function. However, when this authentication code was introduced it was shown to prevent straightforward Man-In-The-Middle (MITM) attacks against QKD protocols.

    In this paper, we prove that the set of messages that collide with any given message under this authentication code contains with high probability a message that has small Hamming distance to any other given message. Based on this fact we present extended MITM attacks against different versions of BB84 QKD protocols using the addressed authentication code; for three protocols we describe every single action taken by the adversary. For all protocols the adversary can obtain complete knowledge of the key, and for most protocols her success probability in doing so approaches unity.

    Since the attacks work against all authentication methods which allow to calculate colliding messages, the underlying building blocks of the presented attacks expose the potential pitfalls arising as a consequence of non-ITS authentication in QKDpostprocessing. We propose countermeasures, increasing the eavesdroppers demand for computational power, and also prove necessary and sufficient conditions for upgrading the discussed authentication code to the ITS level.

    Ort, förlag, år, upplaga, sidor
    Springer Publishing Company, 2016
    Nationell ämneskategori
    Teknik och teknologier
    Identifikatorer
    urn:nbn:se:liu:diva-91260 (URN)10.1007/s11128-015-1160-4 (DOI)000372876800020 ()
    Projekt
    ICG QC
    Anmärkning

    Vid tiden för disputation förelåg publikationen som manuskript

    Funding agencies: Vienna Science and Technology Fund (WWTF) [ICT10-067]; Austrian Research Promotion Agency (FFG) [Bridge-2364544]

    Tillgänglig från: 2013-04-18 Skapad: 2013-04-18 Senast uppdaterad: 2019-08-15Bibliografiskt granskad
    4. On Security of Universal Hash Function Based Multiple Authentication
    Öppna denna publikation i ny flik eller fönster >>On Security of Universal Hash Function Based Multiple Authentication
    2012 (Engelska)Ingår i: Lecture Notes in Computer Science, Vol. 7618 / [ed] Chim, Tat Wing and Yuen, Tsz Hon, 2012, s. 303-310Konferensbidrag, Publicerat paper (Refereegranskat)
    Abstract [en]

    Universal hash function based multiple authentication was originally proposed by Wegman and Carter in 1981. In this authentication, a series of messages are authenticated by first hashing each message by a fixed (almost) strongly universal$_2$ hash function and then encrypting the hash value with a preshared one-time pad. This authentication is unconditionally secure. In this paper, we show that the unconditional security cannot be guaranteed if the hash function output for the first message is not encrypted, as remarked in [Atici and Stinson, CRYPTO '96. LNCS, vol. 1109]. This means that it is not only sufficient, but also necessary, to encrypt the hash of every message to be authenticated in order to have unconditional security. The security loss is demonstrated by a simple existential forgery attack.

    Serie
    Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 7618
    Nationell ämneskategori
    Teknik och teknologier
    Identifikatorer
    urn:nbn:se:liu:diva-84732 (URN)10.1007/978-3-642-34129-8_27 (DOI)978-3-642-34128-1 (ISBN)978-3-642-34129-8 (ISBN)
    Konferens
    14th International Conference on Information and Communications Security, ICICS 2012, Hong Kong, China, October 29-31, 2012
    Projekt
    ICG QC
    Tillgänglig från: 2012-10-18 Skapad: 2012-10-18 Senast uppdaterad: 2018-02-12
    5. Direct proof of security of Wegman-Carter authentication with partially known key
    Öppna denna publikation i ny flik eller fönster >>Direct proof of security of Wegman-Carter authentication with partially known key
    2014 (Engelska)Ingår i: Quantum Information Processing, ISSN 1570-0755, E-ISSN 1573-1332, Vol. 13, nr 10, s. 2155-2170Artikel i tidskrift (Refereegranskat) Published
    Abstract [en]

    Information-theoretically secure (ITS) authentication is needed in Quantum Key Distribution (QKD). In this paper, we study security of an ITS authentication scheme proposed by Wegman& Carter, in the case of partially known authentication key. This scheme uses a new authentication key in each authentication attempt, to select a hash function from an Almost Strongly Universal2 hash function family. The partial knowledge of the attacker is measured as the trace distance between the authentication key distribution and the uniform distribution; this is the usual measure in QKD. We provide direct proofs of security of the scheme, when using partially known key, first in the information-theoretic setting and then in terms of witness indistinguishability as used in the Universal Composability (UC) framework. We find that if the authentication procedure has a failure probability ε and the authentication key has an ε´ trace distance to the uniform, then under ITS, the adversary’s success probability conditioned on an authentic message-tag pair is only bounded by ε +|Ƭ|ε´, where |Ƭ| is the size of the set of tags. Furthermore, the trace distance between the authentication key distribution and the uniform increases to |Ƭ|ε´ after having seen an authentic message-tag pair. Despite this, we are able to prove directly that the authenticated channel is indistinguishable from an (ideal) authentic channel (the desired functionality), except with probability less than ε + ε´. This proves that the scheme is (ε + ε´)-UC-secure, without using the composability theorem.

    Ort, förlag, år, upplaga, sidor
    Springer, 2014
    Nyckelord
    Authentication, Strongly Universal hash functions, Partially known key, Trace distance, Universal Composability, Quantum Key Distribution.
    Nationell ämneskategori
    Elektroteknik och elektronik
    Identifikatorer
    urn:nbn:se:liu:diva-91264 (URN)10.1007/s11128-013-0641-6 (DOI)000341842000002 ()
    Projekt
    ICG QC
    Tillgänglig från: 2013-04-18 Skapad: 2013-04-18 Senast uppdaterad: 2017-12-06Bibliografiskt granskad
    Ladda ner fulltext (pdf)
    Authentication in Quantum Key Distribution: Security Proof and Universal Hash Functions
    Ladda ner (pdf)
    omslag
  • 22.
    Abidin, Aysajan
    Linköpings universitet, Institutionen för systemteknik, Informationskodning.
    On Security of Universal Hash Function Based Multiple Authentication2012Ingår i: Lecture Notes in Computer Science, Vol. 7618 / [ed] Chim, Tat Wing and Yuen, Tsz Hon, 2012, s. 303-310Konferensbidrag (Refereegranskat)
    Abstract [en]

    Universal hash function based multiple authentication was originally proposed by Wegman and Carter in 1981. In this authentication, a series of messages are authenticated by first hashing each message by a fixed (almost) strongly universal$_2$ hash function and then encrypting the hash value with a preshared one-time pad. This authentication is unconditionally secure. In this paper, we show that the unconditional security cannot be guaranteed if the hash function output for the first message is not encrypted, as remarked in [Atici and Stinson, CRYPTO '96. LNCS, vol. 1109]. This means that it is not only sufficient, but also necessary, to encrypt the hash of every message to be authenticated in order to have unconditional security. The security loss is demonstrated by a simple existential forgery attack.

  • 23.
    Abidin, Aysajan
    et al.
    Linköpings universitet, Institutionen för systemteknik, Informationskodning. Linköpings universitet, Tekniska högskolan.
    Larsson, Jan-Åke
    Linköpings universitet, Institutionen för systemteknik, Informationskodning. Linköpings universitet, Tekniska högskolan.
    Direct proof of security of Wegman-Carter authentication with partially known key2014Ingår i: Quantum Information Processing, ISSN 1570-0755, E-ISSN 1573-1332, Vol. 13, nr 10, s. 2155-2170Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Information-theoretically secure (ITS) authentication is needed in Quantum Key Distribution (QKD). In this paper, we study security of an ITS authentication scheme proposed by Wegman& Carter, in the case of partially known authentication key. This scheme uses a new authentication key in each authentication attempt, to select a hash function from an Almost Strongly Universal2 hash function family. The partial knowledge of the attacker is measured as the trace distance between the authentication key distribution and the uniform distribution; this is the usual measure in QKD. We provide direct proofs of security of the scheme, when using partially known key, first in the information-theoretic setting and then in terms of witness indistinguishability as used in the Universal Composability (UC) framework. We find that if the authentication procedure has a failure probability ε and the authentication key has an ε´ trace distance to the uniform, then under ITS, the adversary’s success probability conditioned on an authentic message-tag pair is only bounded by ε +|Ƭ|ε´, where |Ƭ| is the size of the set of tags. Furthermore, the trace distance between the authentication key distribution and the uniform increases to |Ƭ|ε´ after having seen an authentic message-tag pair. Despite this, we are able to prove directly that the authenticated channel is indistinguishable from an (ideal) authentic channel (the desired functionality), except with probability less than ε + ε´. This proves that the scheme is (ε + ε´)-UC-secure, without using the composability theorem.

    Ladda ner fulltext (pdf)
    fulltext
  • 24.
    Abidin, Aysajan
    et al.
    Linköpings universitet, Institutionen för systemteknik, Informationskodning.
    Larsson, Jan-Åke
    Linköpings universitet, Institutionen för systemteknik, Informationskodning.
    New Universal Hash Functions2012Ingår i: Lecture Notes in Computer Science, Vol. 7242 / [ed] Frederik Armknecht and Stefan Lucks, Springer Berlin Heidelberg , 2012, s. 99-108Konferensbidrag (Refereegranskat)
    Abstract [en]

    Universal hash functions are important building blocks for unconditionally secure message authentication codes. In this paper, we present a new construction of a class of Almost Strongly Universal hash functions with much smaller description (or key) length than the Wegman-Carter construction. Unlike some other constructions, our new construction has a very short key length and a security parameter that is independent of the message length, which makes it suitable for authentication in practical applications such as Quantum Cryptography.

  • 25.
    Abidin, Aysajan
    et al.
    Linköpings universitet, Institutionen för systemteknik, Informationskodning. Linköpings universitet, Tekniska högskolan.
    Pacher, Christoph
    Austrian Institute of Technology, Austria.
    Lorünser, Thomas
    Austrian Institute of Technology, Austria.
    Larsson, Jan-Åke
    Linköpings universitet, Institutionen för systemteknik, Informationskodning. Linköpings universitet, Tekniska högskolan.
    Peev, Momtchil
    Austrian Institute of Technology, Austria.
    Quantum cryptography and authentication with low key-consumption2011Ingår i: Proceedings of SPIE - The International Society for Optical Engineering, 2011, s. 818916-Konferensbidrag (Refereegranskat)
    Abstract [en]

    Quantum Key Distribution (QKD - also referred to as Quantum Cryptography) is a technique for secret key agreement. It has been shown that QKD rigged with Information-Theoretic Secure (ITS) authentication (using secret key) of the classical messages transmitted during the key distribution protocol is also ITS. Note, QKD without any authentication can trivially be broken by man-in-the-middle attacks. Here, we study an authentication method that was originally proposed because of its low key consumption; a two-step authentication that uses a publicly known hash function, followed by a secret strongly universal2 hash function, which is exchanged each round. This two-step authentication is not information-theoretically secure but it was argued that nevertheless it does not compromise the security of QKD. In the current contribution we study intrinsic weaknesses of this approach under the common assumption that the QKD adversary has access to unlimited resources including quantum memories. We consider one implementation of Quantum Cryptographic protocols that use such authentication and demonstrate an attack that fully extract the secret key. Even including the final key from the protocol in the authentication does not rule out the possibility of these attacks. To rectify the situation, we propose a countermeasure that, while not informationtheoretically secure, restores the need for very large computing power for the attack to work. Finally, we specify conditions that must be satisfied by the two-step authentication in order to restore informationtheoretic security.

  • 26.
    Abrahamsson, Björn
    Linköpings universitet, Institutionen för systemteknik.
    Architectures for Multiplication in Galois Rings2004Självständigt arbete på grundnivå (yrkesexamen)Studentuppsats
    Abstract [en]

    This thesis investigates architectures for multiplying elements in Galois rings of the size 4^m, where m is an integer.

    The main question is whether known architectures for multiplying in Galois fields can be used for Galois rings also, with small modifications, and the answer to that question is that they can.

    Different representations for elements in Galois rings are also explored, and the performance of multipliers for the different representations is investigated.

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 27.
    Abrahamsson, Henrik
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för systemteknik.
    Carlson, Peter
    Linköpings universitet, Tekniska högskolan.
    Robust Torque Control for Automated Gear Shifting in Heavy Duty Vehicles2008Självständigt arbete på avancerad nivå (yrkesexamen), 20 poäng / 30 hpStudentuppsats
    Abstract [en]

    In an automated manual transmission it is desired to have zero torque in the transmission when disengaging a gear. This minimizes the oscillations in the driveline which increases the comfort and makes the speed synchronization easier. The automated manual transmission system in a Scania truck, called Opticruise, uses engine torque control to achieve zero torque in the transmission.In this thesis different control strategies for engine torque control are proposed in order to minimize the oscillations in the driveline and increase the comfort during a gear shift. A model of the driveline is developed in order to evaluate the control strategies. The main focus was to develop controllers that are easy to implement and that are robust enough to be used in different driveline configurations. This means that model dependent control strategies are not considered.A control strategy with a combination of a feedback from the speed difference between the output shaft speed and the wheel speed, and a feedforward with a linear ramp, showed very good performance in both simulations and tests in trucks. The amplitude of the oscillations in the output shaft speed after neutralengagement are halved compared to the results from the existing method in Scania trucks. The new concept is also more robust against initial conditions and time delay estimations.

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 28.
    Abrahamsson, Lars
    Linköpings universitet, Institutionen för systemteknik.
    A portal based system for indoor environs2006Självständigt arbete på grundnivå (yrkesexamen), 20 poäng / 30 hpStudentuppsats
    Abstract [en]

    The purpose of this thesis is to document the development of the graphics part of an extremely pluggable game engine/lab environment for a course in advanced game programming. This thesis is one out of five, and concerns indoor, realtime computer 3D graphics. It covers state-of-the-art techniques such as GLSL - the OpenGL Shading Language - and more well known techniques such as portal based rendering.

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 29.
    Abrahamsson, Olle
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem.
    Hide and Seek in a Social Network2017Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    In this thesis a known heuristic for decreasing a node's centrality scores while maintaining influence, called ROAM, is compared to a modified version specifically designed to decrease eigenvector centrality. The performances of these heuristics are also tested against the Shapley values of a cooperative game played over the considered network, where the game is such that influential nodes receive higher Shapley values. The modified heuristic performed at least as good as the original ROAM, and in some instances even better (especially when the terrorist network behind the World Trade Center attacks was considered). Both heuristics increased the influence score for a given targeted node when applied consecutively on the WTC network, and consequently the Shapley values increased as well. Therefore the Shapley value of the game considered in this thesis seems to be well suited for discovering individuals that are assumed to actively trying to evade social network analysis.

    Ladda ner fulltext (pdf)
    fulltext
  • 30.
    Abrahamsson, Olle
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska fakulteten.
    On Aggregation and Dynamics of Opinions in Complex Networks2024Licentiatavhandling, monografi (Övrigt vetenskapligt)
    Abstract [sv]

    Avhandlingen studerar två problem definierade på komplexa nätverk, varav det första utforskar en tänkbar utökning av strukturell balansteori och det andra behandlar konvergensfrågor inom opinionsdynamik.

    I avhandlingens första hälft diskuteras möjliga definitioner på villkor för strukturell balans i ett nätverk med preferensordningar som nodattribut. Huvudresultatet är att för fallet med tre alternativ (A, B, C) så kan de (3!)3 = 216 möjliga konfigurationerna av trianglar reduceras till 10 ekvivalensklasser, vilka används som mått på en triangels balans som ett steg mot möjliga utökningar av strukturell balansteori. Vi härleder även en generell formel för antalet ekvivalensklasser för preferensordningar med n alternativ. Slutligen analyseras en empirisk datamängd och dess empiriska sannolikhetsfördelning av triangel-ekvivalensklasser jämförs med en nollhypotes i vilken preferenser tilldelas noderna slumpmässigt.

    Den andra hälften av avhandlingen rör en opinionsdynamikmodell där varje agent agerar slumpmässigt enligt en Bernoullifördelning vars sannolikhet uppdateras vid varje diskret tidssteg, och vi bevisar att denna modell konvergerar nästan säkert till konsensus. Vi ger också en detaljerad kritik av ett påstått bevis av detta resultat i litteraturen. Vi generaliserar resultatet genom att visa att antagandet om irreducibilitet i den ursprungliga modellen inte är nödvändigt. Vidare visar vi, som följdsats av det generaliserade resultatet, att den nästan säkra konvergensen till konsensus även håller om en agent är fullständigt envis och aldrig byter åsikt. I tillägg till detta visar vi att modellen, både i det ursprungliga och i det generaliserade fallet, konvergerar till konsensus även i r:te ordningens moment.  

    Ladda ner fulltext (pdf)
    fulltext
    Ladda ner (png)
    presentationsbild
  • 31.
    Abrahamsson, Olle
    et al.
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska fakulteten.
    Danev, Danyo
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska fakulteten.
    Larsson, Erik G
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska fakulteten.
    Opinion Dynamics with Random Actions and a Stubborn Agent2019Ingår i: CONFERENCE RECORD OF THE 2019 FIFTY-THIRD ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, IEEE , 2019, s. 1486-1490Konferensbidrag (Refereegranskat)
    Abstract [en]

    We study opinion dynamics in a social network with stubborn agents who influence their neighbors but who themselves always stick to their initial opinion. We consider first the well-known DeGroot model. While it is known in the literature that this model can lead to consensus even in the presence of a stubborn agent, we show that the same result holds under weaker assumptions than has been previously reported. We then consider a recent extension of the DeGroot model in which the opinion of each agent is a random Bernoulli distributed variable, and by leveraging on the first result we establish that this model also leads to consensus, in the sense of convergence in probability, in the presence of a stubborn agent. Moreover, all agents opinions converge to that of the stubborn agent.

  • 32.
    Abrahamsson, Olle
    et al.
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska fakulteten.
    Danev, Danyo
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska fakulteten.
    Larsson, Erik G
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska fakulteten.
    Strong Convergence of a Random Actions Model in Opinion Dynamics2024Ingår i: IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS, ISSN 2373-776X, Vol. 10, s. 147-161Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We study an opinion dynamics model in which each agent takes a random Bernoulli distributed action whose probability is updated at each discrete time step, and we prove that this model converges almost surely to consensus. We also provide a detailed critique of a claimed proof of this result in the literature. We generalize the result by proving that the assumption of irreducibility in the original model is not necessary. Furthermore, we prove as a corollary of the generalized result that the almost sure convergence to consensus holds also in the presence of a stubborn agent which never changes its opinion. In addition, we show that the model, in both the original and generalized cases, converges to consensus also in $r$th mean.

    Ladda ner fulltext (pdf)
    fulltext
  • 33.
    Abrahamsson, Olle
    et al.
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska fakulteten.
    Danev, Danyo
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska fakulteten.
    Larsson, Erik G
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska fakulteten.
    Structural Balance Considerations for Networks with Preference Orders as Node Attributes2022Ingår i: 2022 56TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS, IEEE , 2022, s. 1255-1261Konferensbidrag (Refereegranskat)
    Abstract [en]

    We discuss possible definitions of structural balance conditions in a network with preference orderings as node attributes. The main result is that for the case with three alternatives (A, B, C) we reduce the (3!)(3) = 216 possible configurations of triangles to 10 equivalence classes, and use these as measures of balance of a triangle towards possible extensions of structural balance theory. Moreover, we derive a general formula for the number of equivalent classes for preferences on n alternatives. Finally, we analyze a real-world data set and compare its empirical distribution of triangle equivalence classes to a null hypothesis in which preferences are randomly assigned to the nodes.

  • 34.
    Abrahamsson, Per
    Linköpings universitet, Institutionen för systemteknik.
    Combined Platform for Boost Guidance and Attitude Control for Sounding Rockets2004Självständigt arbete på grundnivå (yrkesexamen)Studentuppsats
    Abstract [en]

    This report handles the preliminary design of a control system that includes both attitude control and boost control functionality for sounding rockets. This is done to reduce the weight and volume for the control system.

    A sounding rocket is a small rocket compared to a satellite launcher. It is used to launch payloads into suborbital trajectories. The payload consists of scientific experiments, for example micro-gravity experiments and astronomic observations. The boost guidance system controls the sounding rocket during the launch phase. This is done to minimize the impact dispersion. The attitude control system controls the payload during the experiment phase.

    The system that is developed in this report is based on the DS19 boost guidance system from Saab Ericsson Space AB. The new system is designed by extending DS19 with software and hardware. The new system is therefore named DS19+. Hardware wise a study of the mechanical and electrical interfaces and also of the system budgets for gas, mass and power for the system are done to determine the feasibility for the combined system.

    Further a preliminary design of the control software is done. The design has been implemented as pseudo code in MATLAB for testing and simulations. A simulation model for the sounding rocket andits surroundings during the experiment phase has also been designed and implemented in MATLAB. The tests and simulations that have been performed show that the code is suitable for implementation in the real system.

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 35.
    Abrahamsson, Sebastian
    et al.
    Linköpings universitet, Institutionen för systemteknik.
    Råbe, Markus
    Linköpings universitet, Institutionen för systemteknik.
    An FPGA implementation of a modulator for digital terrestrial television according to the DTMB standard2010Självständigt arbete på avancerad nivå (yrkesexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    The increasing data rates in digital television networks increase the demands on data capacity of the current transmission channels. Through new standards, the capacity of exisiting channels is increased with new methods of error correction coding and modulation.

    This thesis presents the design and implementation of a modulator for transmission of digital terrestrial television according to the Chinese DTMB standard.

    The system is written in VHDL and is intended for implementation on an FPGA.

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 36.
    Abrahamsson, Thomas
    et al.
    Saab Military Aircraft, Sweden.
    Andersson, Magnus
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska högskolan.
    McKelvey, Tomas
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska högskolan.
    A Finite Element Model Updating Formulation Using Frequency Responses and Eigenfrequencies1996Rapport (Övrigt vetenskapligt)
    Abstract [en]

    A novel frequency and modal domain formulation of the model updating problem is presented. Deviations in discrete frequency responses and eigenfrequencies, between the model to be updated and a reference model, constitute the criterion function. A successful updating thus results in a model with the reference's input-output relations at selected fre- quencies. The formulation is demonstrated to produce a criterion function with a global minimum having a large domain of attraction with respect to stiffness and mass variations. The method relies on mode grouping and uses a new extended modal assurance criterion number (eMAC) for identifying related modes. A quadratic objective with inexpensive evaluation of approximate Hessians give a rapid convergence to a minimum by the use of a regularized Gauss-Newton method. Physical bounds on parameters and complementary data, such as structural weight, are treated by imposing set constraints and linear equality constraints. Efficient function computation is obtained by model reduction using a moderately sized base of modes which is recomputed during the minimization. Statistical properties of updated parameters are discussed. A verification example show the performance of the method.

    Ladda ner fulltext (pdf)
    fulltext
    Ladda ner fulltext (ps)
    FULLTEXT01
  • 37.
    Abrahamsson, Tomas
    et al.
    Saab Military Aircraft, Sweden.
    McKelvey, Tomas
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska högskolan.
    Ljung, Lennart
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska högskolan.
    A Study of some Approaches to Vibration Data Analysis1993Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Using data from extensive vibrational tests of the new aircraft Saab 2000 three different methods for vibration analysis are studied. These methods are ERA (eigensystem realization algorithm), N4SID (a subspace method) and PEM (prediction error approach). We find that both the ERA and N4SID methods give good initial model parameter estimates that can be further improved by the use of PEM. We also find that all methods give good insights into the vibrational modes.

    Ladda ner fulltext (pdf)
    fulltext
    Ladda ner fulltext (ps)
    FULLTEXT01
  • 38.
    Acevedo, Miguel
    Linköpings universitet, Institutionen för systemteknik, Datorteknik.
    FPGA-Based Hardware-In-the-Loop Co-Simulator Platform for SystemModeler2016Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This thesis proposes and implements a flexible platform to perform Hardware-In-the-Loop (HIL) co-simulation using a Field-Programmable-Gate-Array (FPGA). The HIL simulations are performed with SystemModeler working as a software simulator and the FPGA as the co-simulator platform for the digital hardware design. The work presented in this thesis consists of the creation of: A communication library in the host computer, a system in the FPGA that allows implementation of different digital designs with varying architectures, and an interface between the host computer and the FPGA to transmit the data. The efficiency of the proposed system is studied with the implementation of two common digital hardware designs, a PID controller and a filter. The results of the HIL simulations of those two hardware designs are used to verify the platform and measure the timing and area performance of the proposed HIL platform.

    Ladda ner fulltext (pdf)
    fulltext
  • 39.
    Acsintoae, Andra
    et al.
    Univ Bucharest, Romania.
    Florescu, Andrei
    Univ Bucharest, Romania.
    Georgescu, Mariana-Iuliana
    Univ Bucharest, Romania; MBZ Univ Artificial Intelligence, U Arab Emirates; SecurifAI, Romania.
    Mare, Tudor
    SecurifAI, Romania.
    Sumedrea, Paul
    Univ Bucharest, Romania.
    Ionescu, Radu Tudor
    Univ Bucharest, Romania; SecurifAI, Romania.
    Khan, Fahad
    Linköpings universitet, Institutionen för systemteknik, Datorseende. Linköpings universitet, Tekniska fakulteten. MBZ Univ Artificial Intelligence, U Arab Emirates.
    Shah, Mubarak
    Univ Cent Florida, FL 32816 USA.
    UBnormal: New Benchmark for Supervised Open-Set Video Anomaly Detection2022Ingår i: 2022 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2022), IEEE COMPUTER SOC , 2022, s. 20111-20121Konferensbidrag (Refereegranskat)
    Abstract [en]

    Detecting abnormal events in video is commonly framed as a one-class classification task, where training videos contain only normal events, while test videos encompass both normal and abnormal events. In this scenario, anomaly detection is an open-set problem. However, some studies assimilate anomaly detection to action recognition. This is a closed-set scenario that fails to test the capability of systems at detecting new anomaly types. To this end, we propose UBnormal, a new supervised open-set benchmark composed of multiple virtual scenes for video anomaly detection. Unlike existing data sets, we introduce abnormal events annotated at the pixel level at training time, for the first time enabling the use of fully-supervised learning methods for abnormal event detection. To preserve the typical open-set formulation, we make sure to include dis-joint sets of anomaly types in our training and test collections of videos. To our knowledge, UBnormal is the first video anomaly detection benchmark to allow a fair head-to-head comparison between one-class open-set models and supervised closed-set models, as shown in our experiments. Moreover, we provide empirical evidence showing that UB-normal can enhance the performance of a state-of-the-art anomaly detection framework on two prominent data sets, Avenue and ShanghaiTech. Our benchmark is freely available at https://github.com/lilygeorgescu/UBnormal.

  • 40.
    Adam, Wettring
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten.
    Adaptive Filtering and Nonlinear Models for Post-processing of Weather Forecasts2015Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Kalman filters have been used by SMHI to improve the quality of their forecasts. Until now they have used a linear underlying model to do this. In this thesis it is investigated whether the performance can be improved by the use of nonlinear models such as polynomials and neural networks. The results suggest that an improvement is hard to achieve by this approach and that it is likely not worth the effort to implement a nonlinear model.

    Ladda ner fulltext (pdf)
    fulltext
  • 41.
    Adamsson, Gustav
    Linköpings universitet, Institutionen för systemteknik, Informationskodning. Linköpings universitet, Tekniska fakulteten.
    Fast and Approximate Text Rendering Using Distance Fields2015Självständigt arbete på avancerad nivå (magisterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Distance field text rendering has many advantages compared to most other text renderingsolutions. Two of the advantages are the possibility  to scale the glyphs without losing the crisp edge and less memory consumption. A drawback with distance field text renderingcan be high distance field generation time. The solution for fast distance field text renderingin this thesis generates the distance fields by drawing distance gradients locally over the outlines of the glyphs. This method is much faster than the old exact methods for generating distance fields that often includes multiple passes over the whole image.

    Using the solution for text rendering proposed in this thesis results in good looking text that is generated on the fly. The distance fields are generated on a mobile device in less than 10 ms for most of the glyphs in good quality which is less than the time between two frames.

    Ladda ner fulltext (pdf)
    fulltext
  • 42.
    Adib Yaghmaie, Farnaz
    et al.
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten.
    Gunnarsson, Svante
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten.
    A New Result on Robust Adaptive Dynamic Programming for Uncertain Partially Linear Systems2019Ingår i: 2019 IEEE 58TH CONFERENCE ON DECISION AND CONTROL (CDC), IEEE , 2019, s. 7480-7485Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we present a new result on robust adaptive dynamic programming for the Linear Quadratic Regulation (LQR) problem, where the linear system is subject to unmatched uncertainty. We assume that the states of the linear system are fully measurable and the matched uncertainty models unmeasurable states with an unspecified dimension. We use the small-gain theorem to give a sufficient condition such that the generated policies in each iteration of on-policy and off-policy routines guarantee robust stability of the overall uncertain system. The sufficient condition can be used to design the weighting matrices in the LQR problem. We use a simulation example to demonstrate the result.

  • 43.
    Adib Yaghmaie, Farnaz
    et al.
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten.
    Gunnarsson, Svante
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten.
    Lewis, Frank L.
    Univ Texas Arlington, TX 76019 USA; Northeastern Univ, Peoples R China.
    Output regulation of unknown linear systems using average cost reinforcement learning2019Ingår i: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 110, artikel-id 108549Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this paper, we introduce an optimal average cost learning framework to solve output regulation problem for linear systems with unknown dynamics. Our optimal framework aims to design the controller to achieve output tracking and disturbance rejection while minimizing the average cost. We derive the Hamilton-Jacobi-Bellman (HJB) equation for the optimal average cost problem and develop a reinforcement algorithm to solve it. Our proposed algorithm is an off-policy routine which learns the optimal average cost solution completely model-free. We rigorously analyze the convergence of the proposed algorithm. Compared to previous approaches for optimal tracking controller design, we elevate the need for judicious selection of the discounting factor and the proposed algorithm can be implemented completely model-free. We support our theoretical results with a simulation example. (C) 2019 Elsevier Ltd. All rights reserved.

    Ladda ner fulltext (pdf)
    fulltext
  • 44.
    Adib Yaghmaie, Farnaz
    et al.
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten.
    Gustafsson, Fredrik
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten.
    Using Reinforcement Learning for Model-free Linear Quadratic Control with Process and Measurement Noises2019Ingår i: 2019 IEEE 58TH CONFERENCE ON DECISION AND CONTROL (CDC), IEEE , 2019, s. 6510-6517Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we analyze a Linear Quadratic (LQ) control problem in terms of the average cost and the structure of the value function. We develop a completely model-free reinforcement learning algorithm to solve the LQ problem. Our algorithm is an off-policy routine where each policy is greedy with respect to all previous value functions. We prove that the algorithm produces stable policies given that the estimation errors remain small. Empirically, our algorithm outperforms the classical Q and off-policy learning routines.

  • 45.
    Adib Yaghmaie, Farnaz
    et al.
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten.
    Gustafsson, Fredrik
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten.
    Ljung, Lennart
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten.
    Linear Quadratic Control Using Model-Free Reinforcement Learning2023Ingår i: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 68, nr 2, s. 737-752Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this article, we consider linear quadratic (LQ) control problem with process and measurement noises. We analyze the LQ problem in terms of the average cost and the structure of the value function. We assume that the dynamics of the linear system is unknown and only noisy measurements of the state variable are available. Using noisy measurements of the state variable, we propose two model-free iterative algorithms to solve the LQ problem. The proposed algorithms are variants of policy iteration routine where the policy is greedy with respect to the average of all previous iterations. We rigorously analyze the properties of the proposed algorithms, including stability of the generated controllers and convergence. We analyze the effect of measurement noise on the performance of the proposed algorithms, the classical off-policy, and the classical Q-learning routines. We also investigate a model-building approach, inspired by adaptive control, where a model of the dynamical system is estimated and the optimal control problem is solved assuming that the estimated model is the true model. We use a benchmark to evaluate and compare our proposed algorithms with the classical off-policy, the classical Q-learning, and the policy gradient. We show that our model-building approach performs nearly identical to the analytical solution and our proposed policy iteration based algorithms outperform the classical off-policy and the classical Q-learning algorithms on this benchmark but do not outperform the model-building approach.

    Ladda ner fulltext (pdf)
    fulltext
  • 46.
    Adib Yaghmaie, Farnaz
    et al.
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten.
    Modares, Hamidreza
    Michigan State University, USA.
    Online Optimal Tracking of Linear Systems with Adversarial Disturbances2023Ingår i: Transactions on Machine Learning Research, E-ISSN 2835-8856, nr 04Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This paper presents a memory-augmented control solution to the optimal reference tracking problem for linear systems subject to adversarial disturbances. We assume that the dynamics of the linear system are known and that the reference signal is generated by a linear system with unknown dynamics. Under these assumptions, finding the optimal tracking controller is formalized as an online convex optimization problem that leverages memory of past disturbance and reference values to capture their temporal effects on the performance. That is, a (disturbance, reference)-action control policy is formalized, which selects the control actions as a linear map of the past disturbance and reference values. The online convex optimization is then formulated over the parameters of the policy on its past disturbance and reference values to optimize general convex costs. It is shown that our approach outperforms robust control methods and achieves a tight regret bound O(√T) where in our regret analysis, we have benchmarked against the best linear policy.

    Ladda ner fulltext (pdf)
    fulltext
  • 47.
    Adib Yaghmaie, Farnaz
    et al.
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten. Nanyang Technol Univ, Singapore.
    Movric, Kristian Hengster
    Czech Tech Univ, Czech Republic.
    Lewis, Frank L.
    Univ Texas Arlington, TX 76019 USA; Northeastern Univ, Peoples R China.
    Su, Rong
    Nanyang Technol Univ, Singapore.
    Differential graphical games for H-infinity control of linear heterogeneous multiagent systems2019Ingår i: International Journal of Robust and Nonlinear Control, ISSN 1049-8923, E-ISSN 1099-1239, Vol. 29, nr 10, s. 2995-3013Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Differential graphical games have been introduced in the literature to solve state synchronization problem for linear homogeneous agents. When the agents are heterogeneous, the previous notion of graphical games cannot be used anymore and a new definition is required. In this paper, we define a novel concept of differential graphical games for linear heterogeneous agents subject to external unmodeled disturbances, which contain the previously introduced graphical game for homogeneous agents as a special case. Using our new formulation, we can solve both the output regulation and H-infinity output regulation problems. Our graphical game framework yields coupled Hamilton-Jacobi-Bellman equations, which are, in general, impossible to solve analytically. Therefore, we propose a new actor-critic algorithm to solve these coupled equations numerically in real time. Moreover, we find an explicit upper bound for the overall L2-gain of the output synchronization error with respect to disturbance. We demonstrate our developments by a simulation example.

    Ladda ner fulltext (pdf)
    fulltext
  • 48.
    Adolfson, Magnus
    Linköpings universitet, Institutionen för systemteknik.
    Simulation of Emission Related Faults on a Diesel Engine2002Självständigt arbete på grundnivå (yrkesexamen)Studentuppsats
    Abstract [en]

    Today's legislation on exhaust gas emissions for heavy duty diesel (HDD) vehicles is more stringent than ever and will be even more tough in the future. More over, in a few years HDD vehicles have to be equipped with OBD (On-Board Diagnostics). This place very high demands on the manufacturers to develop better engines and strategies for OBD. As an aid in the process models can be used.

    This thesis presents extensions of an existing diesel engine model in Matlab/Simulink to be able to simulate emissions during standardized european test cycles. Faults in the sensor and actuator signals are implemented into the model to find out if there is an increase or decrease in the emissions. This is used to create a fault tree where it can be seen why predefined emission thresholds are exceeded. The tree is an aid when developing OBD.

    The results from the simulations showed that almost no faults made the emissions cross the thresholds. The only interesting faults were faults in the ambient temperature sensor and the injection angle actuator. This means that the OBD-system only needs to monitor a few components which implies a smaller system and less work.

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 49.
    Adolfsson, Klas
    Linköpings universitet, Institutionen för systemteknik.
    TCP performance in an EGPRS system2003Självständigt arbete på avancerad nivå (magisterexamen), 20 poäng / 30 hpStudentuppsats
    Abstract [en]

    The most widely used protocol for providing reliable service and congestion control in the Internet is the Transmission Control Protocol (TCP). When the Internet is moving towards more use in mobile applications it is getting more important to know how TCP works for this purpose.

    One of the technologies used for mobile Internet is the Enhanced General Packet Radio Service (EGPRS) extension to the popular GSM system. This thesis presents a low-level analysis of TCP performance in an EGPRS system and an overview of existing TCP, GSM and EGPRS technologies.

    The bottleneck in an EGPRS system is the wireless link – the connection between the mobile phone and the GSM base station. The data transfer over the wireless link is mainly managed by the complex RLC/MAC protocol.

    In this thesis, simulations were made to identify some problems with running TCP and RLC/MAC together. The simulations were made using existing EGPRS testing software together with a new TCP module. The simulation software is also briefly described in the thesis.

    Additionaly, some suggestions are given in order to enhance performance, both by changing the EGPRS system and by modifying the TCP algorithms and parameters.

    Ladda ner fulltext (pdf)
    FULLTEXT01
  • 50.
    Adén, Sebastian
    Linköpings universitet, Institutionen för systemteknik, Fordonssystem. Linköpings universitet, Tekniska högskolan.
    Modellbaserad diagnostik tillämpad för hydrauliska applikationer2013Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    I en globaliserad värld där produktägare finner sina produkter på alltmer avslägsna platser, ökar behovet av att på ett så ekonomiskt och tidseffektivt sätt som möjligt, utföra reperationer och underhållningsarbeten. Att erbjuda en stark och mer effektiv eftermarknadssupport kan öka företagens konkurrenskraft och framför allt göra dem kostnadseffektiva med avseende på lägre bemanningsstyrka. Ett sätt att underlätta underhållningsarbetet är genom att använda modellbaserad diagnos för att generera underlag vid exempelvis reperationsarbeten.

    Denna rapport undersöker möjligheterna att utifrån en modell av en hydraulisk applikation, utföra autogenererad diagnostik bland annat iform av felträdsanalys.

    Innehållet i rapporten beskriver även hur modelleringsarbetet har gått till och utveckling av modellens ingående komponenter.

    Examensarbetet är utfört på Combitech AB, Linköping. 

    Ladda ner fulltext (pdf)
    fulltext
1234567 1 - 50 av 10420
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf