• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 8
  • 3
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 18
  • 7
  • 5
  • 5
  • 5
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Etologie dravců a sov v záchranné stanici pro dravé ptáky Rajhrad

Sedláčková, Ivana January 2006 (has links)
No description available.
2

Výr velký (Bubo bubo, Linnaeus, 1758) jako modelový druh pro environmentální výchovu / Eagle Owl (Bubo bubo, Linnaeus, 1758) as a Model Species for Environmental Education

Žmolil, Matouš January 2019 (has links)
This diploma thesis deals with an eagle owl as a model species for environmental education. The first part focuses on this species and how it was perceived in the past and the possible reasons for its pursuit. The second part focuses on the progressive return of this owl to Czech nature and legal measures to protect it. In the third part the thesis focuses on the presence of eagle owl in neighbouring countries of the Czech Republic and their latest states and legal measures. The last and practical part is focused on the perception of secondary forestry students and grammar school students on the return of selected vertebrates to Czech nature. This part focuses mainly on comparing the perception of eagle owl to other vertebrates in Czech nature.
3

出力分布に応じてゆう度に上限を設けるターボ復号に関する一検討

松井, 宗大, 山里, 敬也, 片山, 正昭, 小川, 明 01 May 2002 (has links)
No description available.
4

Performance Evaluation of Turbo code in LTE system

Wu, Han-Ying 25 July 2011 (has links)
As the increasing demand for high data-rate multimedia servicesin wireless broadband access, the advance wireless communication technologies have been developed rapidly. The Long-Term Evolution (LTE) is the new standard for wireless broadband access recently specified by the 3GPP(3rd Generation Partnership Project) on the way towards the fourth-generation mobile. In this thesis, we are interested in the 3GPP-LTE technology and focus on the turbo coding technique used therein. By employing MATLAB/Simulink, we build up the turbo codec simulation platform for 3GPP-LTE system. Two convolutional encoders that realize the concept of parallel concatenated convolutional codes (PCCCs) and a quadratic permutation polynomial (QPP) interleaver are used to implement the turbo encoder. The a posteriori probability (APP) decoder built-in Simulink is utilized to design the decoder that performs the soft-input and soft-output Viterbi Algorithm (SOVA). The zero-order hold block is used to control the number of decoding iteration for the iterative decoding process. We carry out the 3GPP-LTE turbo codec performance in the AWGN channel on the developed platform. Various cases that consider different data length, the number of decoding iteration, interleaver and decoding algorithm are simulated. The simulation results are compared to those of the Xilinx 3GPP-LTE turbo codec. The comparisons show that our turbo codec works properly and meets the LTE standard.
5

Implementation of Turbo Code Decoder IP Builder

Ko, Meng-chang 08 July 2004 (has links)
Turbo Code, due to its excellent error correction capability, has been widely used in many modern wireless digital communication systems as well as data storage systems in recent years. However, because the decoding of the Turbo Code involves finding all the state probability and transition sequence, its hardware implementation is not straightforward as it requires a lot of memory and memory operation. In this thesis, a design of Turbo Code decoder IP (Intellectual Property) is proposed which can be parameterized with different word-lengths and code rates. The design of the core SISO (Soft-In Soft-Out) unit used in Turbo Code decoder is based on the algorithm of SOVA (Soft-Output Viterbi Algorithm). Based on the hybrid trace-back scheme, the SISO proposed in this thesis can achieve fast path searching and path memory reduction which can be up to 70% compared with the traditional trace-back approach. In addition, every iterative of Turbo Code decoding performs two SISO operations on the block of data with normal and interleaving order. In our proposed architecture, these two SISO operations can be implemented on a single SISO unit with only slightly control overhead. In order to improve the bit error rate performance, the threshold and normalization techniques are applied to our design. In addition, the termination criteria circuit is also included in our design such that the iteration cycle of the decoding can be reduced. The proposed Turbo Code decoder has been thoroughly tested and verified, and can be qualified as a robust IP.
6

Reconfigurable Turbo Decoding for 3G Applications.

Chaikalis, Costas, Noras, James M. January 2004 (has links)
No / Software radio and reconfigurable systems represent reconfigurable functionalities of the radio interface. Considering turbo decoding function in battery-powered devices like 3GPP mobile terminals, it would be desirable to choose the optimum decoding algorithm: SOVA in terms of latency, and log-MAP in terms of performance. In this paper it is shown that the two algorithms share common operations, making feasible a reconfigurable SOVA/log-MAP turbo decoder with increased efficiency. Moreover, an improvement in the performance of the reconfigurable architecture is also possible at minimum cost, by scaling the extrinsic information with a common factor. The implementation of the improved reconfigurable decoder within the 3GPP standard is also discussed, considering different scenarios. In each scenario various frame lengths are evaluated, while the four possible service classes are applied. In the case of AWGN channels, the optimum algorithm is proposed according to the desired quality of service of each class, which is determined from latency and performance constraints. Our analysis shows the potential utility of the reconfigurable decoder, since there is an optimum algorithm for most scenarios.
7

Drobní savci v potravě sovy pálené ve východním Středomoří. / Small mammals in diet of barn owl in the Eastern Meditarranean

Šindelář, Jiří January 2012 (has links)
The extensive material of skeletal remains of mammals from a diet of barn owl in the eastern Mediterranean has been processed and evaluated with different techniques of chorological and morphometric analysis. At least 8400 individuals of 45 species of insectivores, rodents and bats were found in our total collection of samples, which represents a significant portion of fauna of the region. We have evaluated a chorological composition of the taphocoenoses and the interregional differences, manifested primarily by differences in the representation of satellite and accessory elements. We found a highly significant impoverishment of the isolated island taphocenoses (Cyprus, Karpathos, partly on Crete), where Cricetidae, Arvicolidae, C. leucodon etc. are missing. On the other hand the essential part of the dominance structure takes up the Rattus rattus, which acts here as an invasive species, significantly more successful than in the ragged continental contexts. The species diversity of the examined samples is positively correlated with the geographic latitude (taphocenoses of the northern regions are significantly richer) and negatively with the island effect and the degree of aridization. The morphometric analysis of the three most abundant species of Soricidae within the studied region showed...
8

Design of low-power error-control code decoder architecture based on reference path generation

Lin, Wang-Ting 14 February 2011 (has links)
In this thesis, the low-power design of two popular error-control code decoders has been presented. It first proposes a low-power Viterbi decoder based on the improved reference path generation method which can lead to significant reduction of the memory accesses during the trace-back operation of the survival memory unit. The use of the reference path has been addressed in the past; this mechanism is further extended in this thesis to take into account the selection of starting states for the trace-back and path prediction operations. Our simulation results show that the best saving ratio of memory access can be up to 92% by choosing the state with the minimum state-metric for both trace-back and path prediction. However, the implementation of our look-ahead path prediction initiated from the minimum state will suffer a lot of area overhead especially for Viterbi applications with large state number. Therefore, this thesis instead realizes a 64-state Viterbi decoder whose path prediction starts from the predicted state obtained from the previous prediction phase. Our implementation results show that the actual power reduction ratio ranges from 31% to 47% for various signal-to-noise ratio settings while the area overhead is about 10%. The second major contribution of this thesis is to apply the similar low-power technique to the design of Soft-Output-Viterbi-Algorithm (SOVA) based Turbo code decoders. Our experimental results show that for eight-state SOVA Turbo code, our reference path generation mechanism can reduce more that 95% memory accesses, which can help saving the overall power consumption by 15.6% with a slight area overhead of 3%.
9

Reducing the complexity of equalisation and decoding of shingled writing

Abdulrazaq, Muhammad Bashir January 2017 (has links)
Shingled Magnetic Recording (SMR) technology is important in the immediate need for expansion of magnetic hard disk beyond the limit of current disk technology. SMR provides a solution with the least change from current technology among contending technologies. Robust easy to implement Digital Signal Processing (DSP) techniques are needed to achieve the potentials of SMR. Current DSP techniques proposed border on the usage of Two Dimensional Magnetic Recording (TDMR) techniques in equalisation and detection, coupled with iterative error correction codes such as Low Density Parity Check (LDPC). Currently, Maximum Likelihood (ML) algorithms are normally used in TDMR detection. The shortcomings of the ML detections used is the exponential complexities with respect to the number of bits. Because of that, reducing the complexity of the processes in SMR Media is very important in order to actualise the deployment of this technology to personal computers in the near future. This research investigated means of reducing the complexities of equalisation and detection techniques. Linear equalisers were found to be adequate for low density situations. Combining ML detector across-track with linear equaliser along-track was found to provide low complexity, better performing alternative as compared to use of linear equaliser across track with ML along track. This is achieved if density is relaxed along track and compressed more across track. A gain of up to 10dB was achieved. In a situation with high density in both dimensions, full two dimensional (2D) detectors provide better performance. Low complexity full 2D detector was formed by serially concatenating two ML detectors, one for each direction, instead of single 2D ML detector used in other literature. This reduces complexity with respect to side interference from exponential to linear. The use of a single bit parity as run length limited code at the same time error correction code is also presented with a small gain of about 1dB at BER of 10^-5 recorded for the situation of high density.
10

Turbo kódy a jejich aplikace / Turbo codes and their applications

Ploštica, Stanislav January 2009 (has links)
This Diploma thesis aims to explain the data coding using turbo codes. These codes belong to the group of error correction codes. We can reach the high efficiency using these codes. The first part describes process of encoding and decoding. There are describes parts of encoder and decoder. Principle of encoding and decoding demonstrate a simple example. The end of this part contains description of two most frequently used decoding algorithms (SOVA and MAP). The second part contains description of computer program that was made for using as teaching aid. This program was created in Matlab GUI. This program enables to browse error correction process step by step. This program contains graphic interface with many options and display results. In the third part is described program created in Matlab Simulink that was implemented into the TMS320C6713 kit and there is description of measuring procedure. For verification of efficiency of turbo codes was measured any parameters. Some of these parameters are: number of decoding iterations, generating polynoms and using of puncturing. The last part contains measured value and result evaluation.

Page generated in 0.0475 seconds