Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
NoC-based architectures overcome the limitations of traditional buses by exploiting parallelism and offer large band-widths. NoC adoption also increases communication latency, which is especially penalising for data-flow applications (DF). We introduce the notifying memories (NM) concept to reduce this overhead. Our original approach eliminates useless memory requests. This paper demonstrates NM in...
As improvements on acoustic modeling have rapidly progressed in recent years thanks to the impressive gains in performance obtained using deep neural networks (DNNs), language modeling remains a bottleneck for high performance large vocabulary continuous speech recognition (LVCSR) systems. In this paper an algorithm for automatic words extraction from a stream of phones is suggested to be used in...
This paper addresses the problem of reducing the delivery time of data messages to cellular users using instantly decodable network coding (IDNC) with physical-layer rate awareness. While most of the existing literature on IDNC does not consider any physical layer complications, this paper proposes a cross-layer scheme that incorporates the different channel rates of the various users in the decision...
In this paper, we propose a selectively polarized concatenation structure for polar codes. We first divide the polarized bit-channels into three types, i.e., good, intermediate and bad bit-channels according to their Bhattacharyya parameter. Then, through combining several information blocks, the intermediate bit-channels are further polarized to enhance polarization rate. Theoretical and numerical...
Huffman coding algorithm is widely used for seismic data compression because it offers good performance in terms of compression ratio. The algorithm compresses the data by assigning shorter code-words to the most frequent symbols, while the other symbols have longer code-words. It is difficult to accelerate the decoding process by exploiting the parallel architectures because the variable length of...
Lattice vector quantization is an ascendant technique that suits very well for multiple description coding (MDC) system. This paper introduces the lattice ℤ4 to be utilized for labeling function in the three description MDC system that consists of three encoders and seven decoders. Projection of a tesseract in three-space of lattice ℤ4 yields four outputs and the data are transmitted via three channels...
In this paper, a highly efficient protograph-based repeat-accumulate (P-RA) anytime code is proposed, which is derived from the combination of protograph-based low-density parity-check convolutional (P-LDPCC) and spatially coupled low-density parity-check convolutional (SC-LDPCC) codes. Density evolution technique is applied to demonstrate the anytime properties of the P-RA codes over the binary erasure...
In several problems in network information theory, it is important to jointly decode the codewords transmitted by several encoders. For ensembles of i.i.d. random codes, such joint decoding can be analyzed directly with standard methods. In this paper, we develop a general framework to analyze joint decoding for ensembles of random linear codes and ensembles of nested linear codes. The technical difficulty...
In this paper, the problem of achieving information integrity in the classical Wyner-Ziv lossy source coding model is considered. A discrete memoryless source encodes its source sequence using the standard Wyner-Ziv coding technique and forwards the bin index to another source that employs the bin index and its own correlated sequence to decode the first source's sequence. There is an adversary who...
In this paper, we suggest how to efficiently convert a Korean character string into an encoded numeral string for format-preserving encryption (FPE). We also present a decoding method that transforms the encoded numeral string into the data string with the original format. When Korean characters as well as English alphabets, numbers, and special characters are used in letters consisting of input of...
We consider a problem of secure PUF-based authentication under a privacy constraint on the PUF responses. Given a randomly chosen challenge, an adversary who has access to the (publicly) stored helper data and side information correlated with the challenge-response pairs may try to mimic the corresponding PUF response in order to get authenticated. We characterize the optimal tradeoff between rate...
Emerging applications including semantic information processing impose priorities on the possible realizations of information sources, so that not all source sequences are important. This paper proposes an initial framework for optimal lossless compression of subsets of the output of a discrete memoryless source (DMS). It turns out that, the optimal source code may not index the conventional source-typical...
A general framework for analyzing linear codes with joint typicality encoders and decoders is presented. Using this approach, we provide a new perspective on the compute-forward framework. In particular, an achievable rate region for computing the weighted sum of nested linear codewords over a discrete memoryless multiple access channel (MAC) is established. When specialized to the Gaussian MAC, we...
In this paper presents an efficient table lookup algorithm for high-throughput decoding of the (71, 36, 11) Quadratic Residue (QR) code. The main ideas behind this decoding technique are based on one-to-one mapping between the syndromes "S1" and correctable error patterns. As compared with the binary lookup table method, the presented technique is faster than binary searching method for...
Global System for Mobile Communications (GSM) technology still plays a key role because of its availability, reliability and robustness. Recently, additional consumer applications are proposed in which GSM is used as a backup or data transmission service. Unfortunately sending data via GSM channel is a challenging task since it is speech sensitive and suppresses other forms of signals. In this paper,...
We address the utilization of short erasure correcting codes to recover the erased data in opportunistic spectrum access (OSA) due to collisions among multiple users. The main application of using short codes over long codes is to avoid long delays in the network. Various erasure correcting codes are envisioned and their decoding methods are compared to analyze the erasure recovery capability. The...
In recent years, a significant effort has been invested in the development of kinematics-decoding models from electromyographic (EMG) signals to achieve more natural control interfaces for rehabilitation therapies. However, the development of a dexterous EMG-based control interface including multiple degrees of freedom (DOFs) of the upper limb still remains a challenge. Another persistent issue in...
An index coding scheme in which the source (transmitter) transmits symbols over a wireless fading channel is considered. Index codes with the transmitter using minimum number of transmissions are known as optimal index codes. Different optimal index codes give different performances in terms of probability of error in a fading environment and this also varies from receiver to receiver. In this paper...
Adaptive differential pulse code modulation (ADPCM) has been standardized in ITU-T Recommendations G.726 and G.722 and is widely used in IP and cordless telephony. Although adaptive quantization and adaptive prediction is employed in ADPCM using a fixed scalar quantization codebook/lookup table, residual correlation of the quantizer input samples is yet observed. Exploiting source correlation, it...
This paper has analyzed the property of the structure of MP3 file, and provided a parallel decoding method for the property. Thus, for CPU with multiple cores, this paper has provided a parallel decoding method based on multi-thread. The method can increase the utilization rate of CPU and decrease the decoding time while the load of each core of CPU is not balanced. At last, we have conducted three...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.