Refine
Year of publication
- 2018 (197) (remove)
Document Type
- Conference Proceeding (88)
- Article (47)
- Part of a Book (16)
- Report (11)
- Book (8)
- Doctoral Thesis (8)
- Other Publications (8)
- Working Paper (5)
- Journal (Complete Issue of a Journal) (4)
- Patent (2)
Keywords
- 3D Skelett Wickeltechnik (1)
- Actuators (1)
- Agenda 2030 (1)
- Aktuatorik (1)
- Anisotropic hyperelasticity (1)
- Anstand (3)
- Antenna arrays (1)
- Application Integration (1)
- Architektur (1)
- Auffangnorm UWG (1)
Institute
- Fakultät Architektur und Gestaltung (6)
- Fakultät Bauingenieurwesen (6)
- Fakultät Elektrotechnik und Informationstechnik (1)
- Fakultät Informatik (19)
- Fakultät Maschinenbau (9)
- Fakultät Wirtschafts-, Kultur- und Rechtswissenschaften (8)
- Institut für Angewandte Forschung - IAF (7)
- Institut für Optische Systeme - IOS (13)
- Institut für Strategische Innovation und Technologiemanagement - IST (11)
- Institut für Systemdynamik - ISD (15)
Embodiments are generally related to the field of channel and source coding of data to be sent over a channel, such as a communication link or a data memory. Some specific embodiments are related to a method of encoding data for transmission over a channel, a corresponding decoding method, a coding device for performing one or both of these methods and a computer program comprising instructions to cause said coding device to perform one or both of said methods.
The Role of Support-Activities for the successful Implementation of Internal Corporate Accelerators
(2018)
New Technology-Based Firms (NTBFs) learn their business in the early-stages of their life-cycle. As a central element of the entrepreneurial learning process, the business model describes the value-creation functions that are conceptualized in different stages of the NTBF’s life-cycle. Transaction relations connect the model with the business reality and ideally mature in strength over time to a functioning value-network. This chapter describes the development of a research design that determines, extracts, and evaluates semantics constructs of this entrepreneurial learning out of a convenient sample and three cohorts of business plans submitted to a business plan award between 2008 and 2010. The analysis shows empirical evidence for the survival and growth of those NTBFs that exhibit a balanced status of entrepreneurial learning in the maturity of the value-network that can be characterized as early startup-stage. The empirical findings of the network theory based business plan analysis will allow for a better explanation of the performance in the entrepreneurial process that is discussed for NTBFs based on theory of organizational learning.
Beidhändig zum Erfolg
(2018)
Alles digital – was nun?
(2018)
Beidhändig gestalten
(2018)
Today’s markets are characterized by fast and radical changes, posing an essential challenge to established companies. Startups, yet, seem to be more capable in developing radical innovations to succeed in those volatile markets. Thus, established companies started to experiment with various approaches to implement startup-like structures in their organization. Internal corporate accelerators (ICAs) are a novel form of corporate venturing, aiming to foster bottom-up innovations through intrapreneurship. However, ICAs still lack empirical investigations. This work contributes to a deeper understanding of the interface between the ICA and the core organization and the respective support activities (resource access and support services) that create an innovation-supportive work environment for the intrapreneurial team. The results of this qualitative study, comprising 12 interviews with ICA teams out of two German high-tech companies, show that the resources provided by ICAs differ from the support activities of external accelerators. Further, the study shows that some resources show both supportive as well as obstructive potential for the intrapreneurial teams within the ICA.
This work proposes a construction for low-density parity-check (LDPC) codes over finite Gaussian integer fields. Furthermore, a new channel model for codes over Gaussian integers is introduced and its channel capacity is derived. This channel can be considered as a first order approximation of the additive white Gaussian noise channel with hard decision detection where only errors to nearest neighbors in the signal constellation are considered. For this channel, the proposed LDPC codes can be decoded with a simple non-probabilistic iterative decoding algorithm similar to Gallager's decoding algorithm A.
Generalized concatenated (GC) codes with soft-input decoding were recently proposed for error correction in flash memories. This work proposes a soft-input decoder for GC codes that is based on a low-complexity bit-flipping procedure. This bit-flipping decoder uses a fixed number of test patterns and an algebraic decoder for soft-input decoding. An acceptance criterion for the final candidate codeword is proposed. Combined with error and erasure decoding of the outer Reed-Solomon codes, this bit-flipping decoder can improve the decoding performance and reduce the decoding complexity compared to the previously proposed sequential decoding. The bit-flipping decoder achieves a decoding performance similar to a maximum likelihood decoder for the inner codes.
Error correction coding based on soft-input decoding can significantly improve the reliability of non-volatile flash memories. This work proposes a soft-input decoder for generalized concatenated (GC) codes. GC codes are well suited for error correction in flash memories for high reliability data storage. We propose GC codes constructed from inner extended binary Bose-Chaudhuri-Hocquenghem (BCH) codes and outer Reed-Solomon codes. The extended BCH codes enable an efficient hard-input decoding. Furthermore, a low-complexity soft-input decoding method is proposed. This bit-flipping decoder uses a fixed number of test patterns and an algebraic decoder for soft-decoding. An acceptance criterion for the final candidate codeword is proposed. Combined with error and erasure decoding of the outer Reed-Solomon codes, this acceptance criterion can improve the decoding performance and reduce the decoding complexity. The presented simulation results show that the proposed bit-flipping decoder in combination with outer error and erasure decoding can outperform maximum likelihood decoding of the inner codes.