Refine
Year of publication
- 2021 (56) (remove)
Document Type
- Article (22)
- Bachelor Thesis (11)
- Report (7)
- Master's Thesis (4)
- Conference Proceeding (3)
- Journal (Complete Issue of a Journal) (3)
- Doctoral Thesis (2)
- Working Paper (2)
- Part of a Book (1)
- Preprint (1)
Has Fulltext
- yes (56) (remove)
Keywords
- Abtragsprinzip (1)
- Additive Fertigung (1)
- Alpine area (1)
- Antidumping (1)
- Arrival and departure (1)
- Bernstein polynomial (1)
- Botswana (1)
- Brettschichtholz (1)
- Buddhism (1)
- Busnetz (1)
Institute
- Fakultät Architektur und Gestaltung (1)
- Fakultät Bauingenieurwesen (14)
- Fakultät Elektrotechnik und Informationstechnik (3)
- Fakultät Informatik (4)
- Fakultät Maschinenbau (2)
- Fakultät Wirtschafts-, Kultur- und Rechtswissenschaften (10)
- Institut für Angewandte Forschung - IAF (8)
- Institut für Optische Systeme - IOS (1)
- Institut für Systemdynamik - ISD (6)
- Institut für angewandte Thermo- und Fluiddynamik - IATF (1)
Jahresbericht 2021
(2021)
Monitor Energiewende 2020
(2021)
Experimentelle Untersuchung einer Kontaktverbindung für die Anwendung im konstruktiven Holzbau
(2021)
Im Rahmen dieser Arbeit wurde eine Holz-Holz-Kontaktverbindung aus Brettschichtholz ohne mechanische Verbindungsmittel hinsichtlich ihrer Steifigkeit experimentell untersucht. Eine Druckstrebe wurde mit Hilfe eines versteckten Treppenversatzes unter einem Winkel von 30° bzw. 60° an einen Gurt angeschlossen. Insgesamt wurden in den zwei Prüfreihen 20 Prüfkörper untersucht.
Das für die Versuche verwendete Brettschichtholz wurde von vier verschiedenen Firmen und Ingenieurbüros in Deutschland zur Verfügung gestellt. Für die experimentellen Untersuchungen in dieser privatfinanzierten Masterthesis standen so immerhin ca. 50 Meter Brettschichtholz zur Verfügung.
Die Versuche wurden in der Öffentlichen Prüfstelle für Baustoffe und Geotechnik an der HTWG durchgeführt.
Die Auswertung der Versuchsergebnisse soll Aufschluss über die Steifigkeit, die Tragfähigkeit und das mechanische Verhalten eines solchen modifizierten Versatzes geben. Diese Erkenntnisse sollen eine Grundlage für die computergestützte Modellierung von Verbindungen schaffen, um lokale Effekte in Anschlussbereichen besser zu verstehen und möglichst realitätsnah implementieren zu können.
Compliance wirkt, wenn sie in den Köpfen der Menschen ankommt – und wenn sie adaptiv die Themen der Zeit aufgreift.
Eine Führungskräftebefragung der Kommunikationsagentur A&B One, unterstützt vom Zentrum für Wirtschaftsethik (ZfW), zeichnet hierzu ein aktuelles Bild der wichtigen Zielgruppe “Management”. Der Beitrag skizziert die Sicht von Führungsverantwortlichen aller Ebenen auf die viel diskutierte unternehmerische Verantwortung, auf die Wirksamkeit von Compliance-Maßnahmen und auf Compliance-Risiken im Homeoffice. Er gibt Impulse für die Praxis: von Synergien zwischen Purpose und Integrität bis hin zur Förderung von Regelbewusstsein beim (coronabedingten) Remote Working.
Error correction coding for optical communication and storage requires high rate codes that enable high data throughput and low residual errors. Recently, different concatenated coding schemes were proposed that are based on binary BCH codes with low error correcting capabilities. In this work, low-complexity hard- and soft-input decoding methods for such codes are investigated. We propose three concepts to reduce the complexity of the decoder. For the algebraic decoding we demonstrate that Peterson's algorithm can be more efficient than the Berlekamp-Massey algorithm for single, double, and triple error correcting BCH codes. We propose an inversion-less version of Peterson's algorithm and a corresponding decoding architecture. Furthermore, we propose a decoding approach that combines algebraic hard-input decoding with soft-input bit-flipping decoding. An acceptance criterion is utilized to determine the reliability of the estimated codewords. For many received codewords the stopping criterion indicates that the hard-decoding result is sufficiently reliable, and the costly soft-input decoding can be omitted. To reduce the memory size for the soft-values, we propose a bit-flipping decoder that stores only the positions and soft-values of a small number of code symbols. This method significantly reduces the memory requirements and has little adverse effect on the decoding performance.
The performance and reliability of non-volatile NAND flash memories deteriorate as the number of program/erase cycles grows. The reliability also suffers from cell to cell interference, long data retention time, and read disturb. These processes effect the read threshold voltages. The aging of the cells causes voltage shifts which lead to high bit error rates (BER) with fixed pre-defined read thresholds. This work proposes two methods that aim on minimizing the BER by adjusting the read thresholds. Both methods utilize the number of errors detected in the codeword of an error correction code. It is demonstrated that the observed number of errors is a good measure for the voltage shifts and is utilized for the initial calibration of the read thresholds. The second approach is a gradual channel estimation method that utilizes the asymmetrical error probabilities for the one-to-zero and zero-to-one errors that are caused by threshold calibration errors. Both methods are investigated utilizing the mutual information between the optimal read voltage and the measured error values.
Numerical results obtained from flash measurements show that these methods reduce the BER of NAND flash memories significantly.
The McEliece cryptosystem is a promising candidate for post-quantum public-key encryption. In this work, we propose q-ary codes over Gaussian integers for the McEliece system and a new channel model. With this one Mannheim error channel, errors are limited to weight one. We investigate the channel capacity of this channel and discuss its relation to the McEliece system. The proposed codes are based on a simple product code construction and have a low complexity decoding algorithm. For the one Mannheim error channel, these codes achieve a higher error correction capability than maximum distance separable codes with bounded minimum distance decoding. This improves the work factor regarding decoding attacks based on information-set decoding.
Generalized Concatenated Codes over Gaussian and Eisenstein Integers for Code-Based Cryptography
(2021)
The code-based McEliece and Niederreiter cryptosystems are promising candidates for post-quantum public-key encryption. Recently, q-ary concatenated codes over Gaussian integers were proposed for the McEliece cryptosystem together with the one-Mannheim error channel, where the error values are limited to Mannheim weight one. Due to the limited error values, the codes over Gaussian integers achieve a higher error correction capability than maximum distance separable (MDS) codes with bounded minimum distance decoding. This higher error correction capability improves the work factor regarding decoding attacks based on information-set decoding. The codes also enable a low complexity decoding algorithm for decoding beyond the guaranteed error correction capability. In this work, we extend this coding scheme to codes over Eisenstein integers. These codes have advantages for the Niederreiter system. Additionally, we propose an improved code construction based on generalized concatenated codes. These codes extent the rate region where the work factor is beneficial compared to MDS codes. Moreover, generalized concatenated codes are more robust against structural attacks than ordinary concatenated codes.