@inproceedings{GrimmFreudenberger,
author = {Grimm, Simon and Freudenberger, J{\"u}rgen},
title = {A phase reference for a multichannel Wiener filter by a delay and sum beamformer},
series = {Fortschritte der Akustik : DAGA 2015, N{\"u}rnberg : 16.-19. M{\"a}rz 2015 : 41. Jahrestagung f{\"u}r Akustik, Tagungsband},
publisher = {Dt. Gesellschaft f{\"u}r Akustik e.V.},
address = {Berlin},
isbn = {978-3-939296-089},
pages = {1027 -- 1030},
language = {en}
}
@inproceedings{FreudenbergerWegmannSpinner,
author = {Freudenberger, J{\"u}rgen and Wegmann, Thomas and Spinner, Jens},
title = {An efficient hardware implementation of sequential stack decoding of binary block codes},
series = {IEEE 5th International Conference on Consumer Electronics - Berlin, (ICCE-Berlin), 6-9 Sept. 2015},
isbn = {978-1-4799-8748-1},
doi = {10.1109/ICCE-Berlin.2015.7391215},
pages = {135 -- 138},
abstract = {This work proposes an efficient hardware Implementation of sequential stack decoding of binary block codes. The decoder can be applied for soft input decoding for generalized concatenated (GC) codes. The GC codes are constructed from inner nested binary Bose-Chaudhuri-Hocquenghem (BCH) codes and outer Reed-Solomon (RS) codes. In order to enable soft input decoding for the inner BCH block codes, a sequential stack decoding algorithm is used.},
language = {en}
}
@article{SpinnerFreudenberger,
author = {Spinner, Jens and Freudenberger, J{\"u}rgen},
title = {Datenrettung f{\"u}r die Speicherkarte},
series = {horizonte},
number = {45},
issn = {1432-9174},
pages = {18 -- 20},
abstract = {Flash-Speicher wurden urspr{\"u}nglich als Speichermedium f{\"u}r Digitalkameras entwickelt, finden inzwischen aber in vielen Bereichen Anwendung. Die in Konstanz ans{\"a}ssige Firma Hyperstone GmbH ist ein f{\"u}hrender Anbieter von Flashcontrollern f{\"u}r Anwendungen mit erh{\"o}hten Anforderungen an Zuverl{\"a}ssigkeit und Datenintegrit{\"a}t. Bereits seit April 2011 kooperiert die Firma Hyperstone mit der HTWG Konstanz bei der Entwicklung von Fehlerkorrekturverfahren f{\"u}r einen zuverl{\"a}ssigen Einsatz von Flash-Speichern. Aufgrund der rasanten Entwicklung bei Flashspeicherbausteinen ist auch eine stetige Weiterentwicklung der Korrekturverfahren notwendig. Im Rahmen dieser Kooperation wurde inzwischen zwei Flashcontroller mit sehr leistungsf{\"a}higer Fehlerkorrektur entwickelt. Der folgende Artikel gibt Einblick in den Einsatz von Flash-Speichern und erl{\"a}utert die Notwendigkeit f{\"u}r eine leistungsf{\"a}hige Fehlerkorrektur.},
language = {de}
}
@inproceedings{SpinnerFreudenberger,
author = {Spinner, Jens and Freudenberger, J{\"u}rgen},
title = {Soft input decoding of generalized concatenated codes using a stack decoding algorithm},
series = {BW-CAR Symposium on Information and Communication Systems, SInCom 2015, 13. November 2015, Konstanz},
isbn = {978-3-00-051859-1},
pages = {1 -- 6},
abstract = {This work investigates soft input decoding for generalized concatenated (GC) codes. The GC codes are constructed from inner nested binary Bose-Chaudhuri-Hocquenghem (BCH)codes and outer Reed-Solomon (RS) codes. In order to enable soft input decoding for the inner BCH block codes, a sequential stack decoding algorithm is used. Ordinary stack decoding of binary block codes requires the complete trellis of the code. In this work a representation of the block codes based on the trellises of supercodes is proposed in order to reduce the memory requirements for the representation of the BCH codes. Results for the decoding performance of the overall GC code are presented. Furthermore, an efficient hardware implementation of the GC decoder is proposed.},
language = {en}
}
@article{FreudenbergerShavgulidze,
author = {Freudenberger, J{\"u}rgen and Shavgulidze, Sergo},
title = {New Four-Dimensional Signal Constellations From Lipschitz Integers for Transmission Over the Gaussian Channel},
series = {IEEE Transactions on Communications},
volume = {Volume 63},
number = {Issue 7},
issn = {1558-0857},
doi = {10.1109/TCOMM.2015.2441691},
pages = {2420 -- 2427},
abstract = {Codes over quotient rings of Lipschitz integers have recently attracted some attention. This work investigates the performance of Lipschitz integer constellations for transmission over the AWGN channel by means of the constellation figure of merit. A construction of sets of Lipschitz integers that leads to a better constellation figure of merit compared to ordinary Lipschitz integer constellations is presented. In particular, it is demonstrated that the concept of set partitioning can be applied to quotient rings of Lipschitz integers where the number of elements is not a prime number. It is shown that it is always possible to partition such quotient rings into additive subgroups in a manner that the minimum Euclidean distance of each subgroup is strictly larger than in the original set. The resulting signal constellations have a better performance for transmission over an additive white Gaussian noise channel compared to Gaussian integer constellations and to ordinary Lipschitz integer constellations. In addition, we present multilevel code constructions for the new signal constellations.},
language = {en}
}
@article{SpinnerFreudenberger,
author = {Spinner, Jens and Freudenberger, J{\"u}rgen},
title = {Decoder architecture for generalised concatenated codes},
series = {IET Circuits, Devices \& Systems},
volume = {9},
number = {5},
issn = {1751-858X},
doi = {10.1049/iet-cds.2014.0278},
pages = {328 -- 335},
abstract = {This paper proposes a pipelined decoder architecture for generalised concatenated (GC) codes. These codes are constructed from inner binary Bose-Chaudhuri-Hocquenghem (BCH) and outer Reed-Solomon codes. The decoding of the component codes is based on hard decision syndrome decoding algorithms. The concatenated code consists of several small BCH codes. This enables a hardware architecture where the decoding of the component codes is pipelined. A hardware implementation of a GC decoder is presented and the cell area, cycle counts as well as the timing constraints are investigated. The results are compared to a decoder for long BCH codes with similar error correction performance. In comparison, the pipelined GC decoder achieves a higher throughput and has lower area consumption.},
language = {en}
}
@inproceedings{FreudenbergerBeckRajab,
author = {Freudenberger, J{\"u}rgen and Beck, Alexander and Rajab, Mohammed},
title = {A data compression scheme for reliable data storage in non-volatile memories},
series = {IEEE 5th International Conference on Consumer Electronics - Berlin, (ICCE-Berlin), 6-9 Sept. 2015},
isbn = {978-1-4799-8748-1},
doi = {10.1109/ICCE-Berlin.2015.7391216},
pages = {139 -- 142},
abstract = {This contribution presents a data compression scheme for applications in non-volatile flash memories. The objective of the data compression algorithm is to reduce the amount of user data such that the redundancy of the error correction coding can be increased in order to improve the reliability of the data storage system. The data compression is performed on block level considering data blocks of 1 kilobyte. We present an encoder architecture that has low memory requirements and provides a fast data encoding.},
language = {en}
}
@inproceedings{FreudenbergerShavgulidze,
author = {Freudenberger, J{\"u}rgen and Shavgulidze, Sergo},
title = {New signal constellations for coding over Lipschitz integers},
series = {SCC 2015; 10th International ITG Conference on Systems, Communications and Coding, 2-5 Feb. 2015, Hamburg, Germany},
isbn = {978-3-8007-3659-1},
pages = {1 -- 6},
abstract = {Codes over quotient rings of Lipschitz integers have recently attracted some attention. This work investigates the performance of Lipschitz integer constellations for transmission over the AWGN channel by means of the constellation figure of merit. A construction of sets of Lipschitz integers is presented that leads to a better constellation figure of merit compared to ordinary Lipschitz integer constellations. In particular, it is demonstrated that the concept of set partitioning can be applied to quotient rings of Lipschitz integers where the number of elements is not a prime number. It is shown that it is always possible to partition such quotient rings into additive subgroups in a manner that the minimum Euclidean distance of each subgroup is strictly larger than in the original set. The resulting signal constellations have a better performance for transmission over an additive white Gaussian noise channel compared to Gaussian integer constellations and to ordinary Lipschitz integer constellations.},
language = {en}
}