Search for dissertations about: "design codes"
Showing result 6 - 10 of 188 swedish dissertations containing the words design codes.
-
6. Designing Space-Time Codes Using Orthogonal Designs
Abstract : This thesis deals with coding schemes for systems with multiple transmit antennas. The problem of finding optimal transmission schemes for the case when the transmitter knows the channel and the case when the transmitter does not know the channel are considered. READ MORE
-
7. Addressing the complexity of sustainability-driven structural design: Computational design, optimization, and decision making
Abstract : Being one of the sectors with the largest environmental burden and high socio-economic impacts sets high requirements on the construction industry. At the same time, this provides the sector with great opportunities to contribute to the globally pursued sustainability transition. READ MORE
-
8. Design for Serviceability - A probabilistic approach
Abstract : In many design situations the acceptable performance of structures is defined by serviceability requirements. To estimate the probability of serviceability failure three main design aspects should be considered: (1) the relevant exposures, (2) the structural response and (3) the performance criteria. READ MORE
-
9. Efficient Coding Techniques for Networks & Channels with Transmission Errors
Abstract : This thesis consists of two parts, both of whichinvestigate coding techniques for information transmission throughchannels in the presence of errors. Part I discusses topics ofnetwork coding and rateless codes. Part~II considers channel codesfor continuous phase modulation. These two parts are clearlydifferent, but they are also related. READ MORE
-
10. Analysis and Design of Rateless Codes
Abstract : The invention of turbo codes and the re-discovery of sparse graph codes constitute a milestone in error-correction codes designed for communication and storage systems. Sparse graph codes such as low-density parity-check codes can offer a performance that approaches the previously elusive Shannon capacity with reasonable practical computational complexity. READ MORE