235,026 research outputs found
Luca Sacher's MM Piano Recital 1
No full textSonata in C Major, K 487 by Domenico Scarlatti
Sonata in A Major, K 208 by Domenico Scarlatti
Sonata in C Major, K 420 by Domenico Scarlatti
Drei Klavierstücke, D 946 by Franz Schubert
Ballade No. 2 in F Major, Op. 38 by Frédéric Chopin
Concerto No. 1 in Bb Minor, Op. 23 by Pyotr Ilich TchaikovskyRelated performance for this degree -- Luca Sacher's MM Piano Recital 2: https://hdl.handle.net/2346/98523Recital recordings are archival copies for educational purposes only. Members of the TTU community may request to listen/view them for educational purposes via the PDF link to the left
System-on-chip Computing and Interconnection Architectures for Telecommunications and Signal Processing
No full textThis dissertation proposes novel architectures and design techniques targeting SoC building blocks for telecommunications and signal processing applications.
Hardware implementation of Low-Density Parity-Check decoders is approached at both the algorithmic and the architecture level. Low-Density Parity-Check codes are a promising coding scheme for future communication standards due to their outstanding error correction performance.
This work proposes a methodology for analyzing effects of finite precision arithmetic on error correction performance and hardware complexity. The methodology is throughout employed for co-designing the decoder. First, a low-complexity check node based on the P-output decoding principle is designed and characterized on a CMOS standard-cells library. Results demonstrate implementation loss below 0.2 dB down to BER of 10^{-8} and a saving in complexity up to 59% with respect to other works in recent literature. High-throughput and low-latency issues are addressed with modified single-phase decoding schedules. A new "memory-aware" schedule is proposed requiring down to 20% of memory with respect to the traditional two-phase flooding decoding. Additionally, throughput is doubled and logic complexity reduced of 12%. These advantages are traded-off with error correction performance, thus making the solution attractive only for long codes, as those adopted in the DVB-S2 standard. The "layered decoding" principle is extended to those codes not specifically conceived for this technique. Proposed architectures exhibit complexity savings in the order of 40% for both area and power consumption figures, while implementation loss is smaller than 0.05 dB.
Most modern communication standards employ Orthogonal Frequency Division Multiplexing as part of their physical layer. The core of OFDM is the Fast Fourier Transform and its inverse in charge of symbols (de)modulation. Requirements on throughput and energy efficiency call for FFT hardware implementation, while ubiquity of FFT suggests the design of parametric, re-configurable and re-usable IP hardware macrocells. In this context, this thesis describes an FFT/IFFT core compiler particularly suited for implementation of OFDM communication systems. The tool employs an accuracy-driven configuration engine which automatically profiles the internal arithmetic and generates a core with minimum operands bit-width and thus minimum circuit complexity. The engine performs a closed-loop optimization over three different internal arithmetic models (fixed-point, block floating-point and convergent block floating-point) using the numerical accuracy budget given by the user as a reference point. The flexibility and re-usability of the proposed macrocell are illustrated through several case studies which encompass all current state-of-the-art OFDM communications standards (WLAN, WMAN, xDSL, DVB-T/H, DAB and UWB). Implementations results are presented for two deep sub-micron standard-cells libraries (65 and 90 nm) and commercially available FPGA devices. Compared with other FFT core compilers, the proposed environment produces macrocells with lower circuit complexity and same system level performance (throughput, transform size and numerical accuracy).
The final part of this dissertation focuses on the Network-on-Chip design paradigm whose goal is building scalable communication infrastructures connecting hundreds of core. A low-complexity link architecture for mesochronous on-chip communication is discussed. The link enables skew constraint looseness in the clock tree synthesis, frequency speed-up, power consumption reduction and faster back-end turnarounds. The proposed architecture reaches a maximum clock frequency of 1 GHz on 65 nm low-leakage CMOS standard-cells library. In a complex test case with a full-blown NoC infrastructure, the link overhead is only 3% of chip area and 0.5% of leakage power consumption.
Finally, a new methodology, named metacoding, is proposed. Metacoding generates correct-by-construction technology independent RTL codebases for NoC building blocks. The RTL coding phase is abstracted and modeled with an Object Oriented framework, integrated within a commercial tool for IP packaging (Synopsys CoreTools suite). Compared with traditional coding styles based on pre-processor directives, metacoding produces 65% smaller codebases and reduces the configurations to verify up to three orders of magnitude
Luca Serianni, l’equilibrio della parola
No full textUn breve ricordo in memoria dello storico della lingua italiana Luca Serianni, scomparso tragicamenteA brief note in memory of the historian of the Italian language Luca Serianni, who died tragicall
Luca Signorelli's Illustrationen zu Dante's Divina Commedia
No full textLUCA SIGNORELLI'S ILLUSTRATIONEN ZU DANTE'S DIVINA COMMEDIA
Luca Signorelli's Illustrationen zu Dante's Divina Commedia ( - )
Cover ( - )
Titelseite (I)
Widmung (III)
Vorwort (V)
[Kapitel] I (1)
[Kapitel] II (6)
[Kapitel] III (28)
[Kapitel] IV (31)
[Kapitel] V (33)
Anmerkungen (36)
[Illustration] ( -
Rich, Sturmian, and trapezoidal words
No full textIn this paper we explore various interconnections between rich words, Sturmian words, and trapezoidal words. Rich words, first introduced by the second and third authors together with J. Justin and S. Widmer, constitute a new class of finite and infinite words characterized by having the maximal number of palindromic factors. Every finite Sturmian word is rich, but not conversely. Trapezoidal words were first introduced by the first author in studying the behavior of the subword complexity of finite Sturmian words. Unfortunately this property does not characterize finite Sturmian words. In this note we show that the only trapezoidal palindromes are Sturmian. More generally we show that Sturmian palindromes can be characterized either in terms of their subword complexity (the trapezoidal property) or in terms of their palindromic complexity. We also obtain a similar characterization of rich palindromes in terms of a relation between palindromic complexity and subword complexity
"Ravy me treuve en mon deduire". Études réunies par Luca Pierdominici et Élisabeth Gaucher-Rémond
No full textIl s'agit d'un volume d'études préparé par (/a c. di) Luca Pierdominici et Élisabeth Gaucher-Rémond, de l'Université de Nantes, en l'honneur du grand spécialiste du Moyen Âge français Jean Dufournet, volume publié dans la collection "Piccola Biblioteca di Studi Medievali e Rinascimentali" (deuxième parution dans la coll.) fondée et dirigée par Luca Pierdominici. ISSN de la collection: ISSN: 2039-1412 > Si tratta di un volume miscellaneo di studi e saggi di autori diversi, a c. di Luca Pierdominici (Università di Macerata) e Élisabeth Gaucher-Rémond (co-curatore internazionale, dell'Université de Nantes, Francia) in onore del grande specialista di letteratura francese medievale Jean Dufournet, volume pubblicato nella collezione "Piccola Biblioteca di Studi Medievali e Rinascimentali" (secondo volume apparso nella coll.) fondata e diretta da Luca Pierdominici. ISSN della collezione: ISSN: 2039-1412
Avant-propos
No full textAvant-propos du volume d'études préparé par (/a c. di) Luca Pierdominici et Élisabeth Gaucher-Rémond, de l'Université de Nantes, en l'honneur du grand spécialiste du Moyen Age français Jean Dufournet, volume publié dans la collection "Piccola Biblioteca di Studi Medievali e Rinascimentali" (deuxième parution dans la coll.) fondée et dirigée par Luca Pierdominici. ISSN de la collection: ISSN: 2039-1412 > Avant-propos del volume miscellaneo di studi e saggi di autori diversi, a c. di Luca Pierdominici (Università di Macerata) e Élisabeth Gaucher-Rémond (co-curatrice internazionale, dell'Università di Nantes, Francia) preparato in onore del grande specialista di letteratura francese medievale Jean Dufournet; volume pubblicato nella collezione "Piccola Biblioteca di Studi Medievali e Rinascimentali" (secondo volume apparso nella coll.) fondata e diretta da Luca Pierdominici. ISSN della collezione: ISSN: 2039-1412
Immagine e scrittura. Filosofia, pittura, schema. A c. di Luca Bagetto e Jean-Claude Lévêque
No full textIl volume tratta del rapporto tra il vedere e il prender nota, soffermandosi sulla prossimità tra scrittura e disegno e tra filosofia e pittura. I saggi raccolti articolano in questo contesto la tesi che i modi di ordinare il mondo non si configurano innanzitutto nel linguaggio, ma corrispondono a una capacità di visione e di orientamento.
Hanno collaborato al volume: Reiner Wiehl (Heidelberg), Riccardo Dottori (Roma), Marcus Müller (Heidelberg), Gaetano Chiurazzi (Torino), Ana María Leyra (Parigi), Juliàn Santos Guerrero (Madrid), Antonio Castro Cuadra (Madrid), Marco Vozza (Torino), Alessandro Bertinetto (Udine), Luca Bagetto (Pavia)
Christoffel words and the Calkin-Wilf tree
No full textIn this note we present some results on the Calkin-Wilf tree of irreducible fractions, giving an insight on the duality relating it to the Stern-Brocot tree, and proving noncommutative versions of known results relating labels of the Calkin-Wilf trees to hyperbinary expansions of positive integers. The main tool is the Christoffel tree introduced in a paper by Berstel and de Luca
- …
