Browsing by Subject "Codes (symbols)"

Now showing 1 - 19 of 19

Open Access
Access pattern-based code compression for memory-constrained systems
(Association for Computing Machinery, 2008-09) Ozturk, O.; Kandemir, M.; Chen, G.
As compared to a large spectrum of performance optimizations, relatively less effort has been dedicated to optimize other aspects of embedded applications such as memory space requirements, power, real-time predictability, and reliability. In particular, many modern embedded systems operate under tight memory space constraints. One way of addressing this constraint is to compress executable code and data as much as possible. While researchers on code compression have studied efficient hardware and software based code compression strategies, many of these techniques do not take application behavior into account; that is, the same compression/decompression strategy is used irrespective of the application being optimized. This article presents an application-sensitive code compression strategy based on control flow graph (CFG) representation of the embedded program. The idea is to start with a memory image wherein all basic blocks of the application are compressed, and decompress only the blocks that are predicted to be needed in the near future. When the current access to a basic block is over, our approach also decides the point at which the block could be compressed. We propose and evaluate several compression and decompression strategies that try to reduce memory requirements without excessively increasing the original instruction cycle counts. Some of our strategies make use of profile data, whereas others are fully automatic. Our experimental evaluation using seven applications from the MediaBench suite and three large embedded applications reveals that the proposed code compression strategy is very successful in practice. Our results also indicate that working at a basic block granularity, as opposed to a procedure granularity, is important for maximizing memory space savings. © 2008 ACM.
Open Access
Analysis of an Adaptive Modulation and Coding scheme with HARQ for TCP traffic
(IEEE, 2015-04) Öztürk, Onur; Akar, Nail
In this paper, we analyze the aggregate TCP throughput performance of a wireless link utilizing Active Queue Management (AQM) and an Adaptive Modulation and Coding (AMC) scheme with Hybrid ARQ (HARQ) based on the probability of failure in the first transmission attempt. We assume packets arriving out-of-order at the wireless receiver due to random retransmissions are resequenced before being released to the network. For this reason, an approximate model for the delay experienced at the resequencing buffer is also presented. In the light of the results obtained from the presented analysis, we propose a threshold for the aforementioned probability of failure making the investigated AMC scheme work at an overall performance close to that of the optimum policy. © 2015 IEEE.
Open Access
Blind data detection in the presence of PLL phase noise by sequential Monte Carlo method
(IEEE, 2006-06) Panayırcı, Erdal; Çırpan H. A.; Moeneclaey, M.; Noels, N.
In this paper, based on a sequential Monte Carlo method, a computationally efficient algorithm is presented for blind data detection in the presence of residual phase noise generated at the output the phase tracking loop employed in a digital receiver. The basic idea is to treat the transmitted symbols as" missing data" and draw samples sequentially of them based on the observed signal samples up to time t. This way, the Bayesian estimates of the phase noise and the incoming data are obtained through these samples, sequentially drawn,together with their importance weights. The proposed receiver structure is seen to be ideally suited for high-speed parallel implementation using VLSI technology. © 2006 IEEE.
Open Access
Challenges and some new directions in channel coding
(Korean Institute of Communication Sciences, 2015) Arikan, E.; Ul Hassan, N.; Lentmaier, M.; Montorsi, G.; Sayir, J.
Three areas of ongoing research in channel coding are surveyed, and recent developments are presented in each area: Spatially coupled low-density parity-check (LDPC) codes, nonbinary LDPC codes, and polar coding.
Open Access
Channel polarization: A method for constructing capacity-achieving codes
(IEEE, 2008-07) Arıkan, Erdal
A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity I(W) of any given binary-input discrete memoryless channel (B-DMC) W. The symmetric capacity I(W) is the highest rate achievable subject to using the input letters of the channel equiprobably and equals the capacity C(W) if the channel has certain symmetry properties. Channel polarization refers to the fact that it is possible to synthesize, out of N independent copies of a given B-DMC W, a different set of N binary-input channels such that the capacities of the latter set, except for a negligible fraction of them, are either near 1 or near 0. This second set of N channels are well-conditioned for channel coding: one need only send data at full rate through channels with capacity near 1 and at 0 rate through the others. The main coding theorem about polar coding states that, given any B-DMC W with I(W) > 0 and any fixed 0 < δ < I(W), there exist finite constants n1 (W, δ) and c(W, δ) such that for all n ≥ n1, there exist polar codes with block length N = 2n, rate R > I(W)-δ, and probability of block decoding error Pe ≤ cN-1/4. The codes with this performance can be encoded and decoded within complexity O(N log N). © 2008 IEEE.
Open Access
A comparison of epidemic algorithms in wireless sensor networks
(Elsevier BV, 2006-08-21) Akdere, M.; Bilgin, C. C.; Gerdaneri, O.; Korpeoglu, I.; Ulusoy, O.; Çetintemel, U.
We consider the problem of reliable data dissemination in the context of wireless sensor networks. For some application scenarios, reliable data dissemination to all nodes is necessary for propagating code updates, queries, and other sensitive information in wireless sensor networks. Epidemic algorithms are a natural approach for reliable distribution of information in such ad hoc, decentralized, and dynamic environments. In this paper we show the applicability of epidemic algorithms in the context of wireless sensor environments, and provide a comparative performance analysis of the three variants of epidemic algorithms in terms of message delivery rate, average message latency, and messaging overhead on the network. © 2006 Elsevier B.V. All rights reserved.
Open Access
Design of trellis waveform coders with near-optimum structure
(IET, 1992) Kuruoglu, E.E.; Ayanoglu, E.
In this Letter the combinatorial optimisation algorithm known as simulated annealing is used for the optimisation of the trellis structure of the next-state map of the decoder finite-state machine in trellis waveform coding. The generalised Lloyd algorithm which finds the optimum codebook is incorporated into simulated annealing so that near-optimum coding systems are designed. Comparison of simulation results with previous work in the literature shows that this method yields better coding systems than those published in the literature.
Open Access
Fibre products of superelliptic curves and codes therefrom
(IEEE, 1997) Stepanov, Serguei A.; Özbudak, Ferruh
A method of constructing long geometric Goppa codes coming from fiber products of superelliptic curves is presented. A family of smooth projective curves with a lot of Fq-rational points are needed to produce a family of asymptotically good geometric Goppa codes. The genus in every such family is considerably less than the number of rational points, so the corresponding geometric Goppa codes have rather good parameters. Examples of such families are provided by modular curves, by Drinfeld modular curves, and by Artin-Schreier coverings of the projective line.
Open Access
Generalized approximate message-passing decoder for universal sparse superposition codes
(IEEE, 2017-06) Bıyık, Erdem; Barbier, J.; Dia, M.
Sparse superposition (SS) codes were originally proposed as a capacity-achieving communication scheme over the additive white Gaussian noise channel (AWGNC) [1]. Very recently, it was discovered that these codes are universal, in the sense that they achieve capacity over any memoryless channel under generalized approximate message-passing (GAMP) decoding [2], although this decoder has never been stated for SS codes. In this contribution we introduce the GAMP decoder for SS codes, we confirm empirically the universality of this communication scheme through its study on various channels and we provide the main analysis tools: state evolution and the potential. We also compare the performance of GAMP with the Bayes-optimal MMSE decoder. We empirically illustrate that despite the presence of a phase transition preventing GAMP to reach the optimal performance, spatial coupling allows to boost the performance that eventually tends to capacity in a proper limit. We also prove that, in contrast with the AWGNC case, SS codes for binary input channels have a vanishing error floor in the limit of large codewords. Moreover, the performance of Hadamard-based encoders is assessed for practical implementations. © 2017 IEEE.
Open Access
Implementing the Han-Kobayashi scheme using low density parity check codes over Gaussian interference channels
(Institute of Electrical and Electronics Engineers Inc., 2015) Sharifi S.; Tanc, A. K.; Duman, T. M.
We focus on Gaussian interference channels (GICs) and study the Han-Kobayashi coding strategy for the two-user case with the objective of designing implementable (explicit) channel codes. Specifically, low-density parity-check codes are adopted for use over the channel, their benefits are studied, and suitable codes are designed. Iterative joint decoding is used at the receivers, where independent and identically distributed channel adapters are used to prove that log-likelihood-ratios exchanged among the nodes of the Tanner graph enjoy symmetry when BPSK or QPSK with Gray coding is employed. This property is exploited in the proposed code optimization algorithm adopting a random perturbation technique. Code optimization and convergence threshold computations are carried out for different GICs employing finite constellations by tracking the average mutual information. Furthermore, stability conditions for the admissible degree distributions under strong and weak interference levels are determined. Via examples, it is observed that the optimized codes using BPSK or QPSK with Gray coding operate close to the capacity boundary for strong interference. For the case of weak interference, it is shown that nontrivial rate pairs are achievable via the newly designed codes, which are not possible by single user codes with time sharing. Performance of the designed codes is also studied for finite block lengths through simulations of specific codes picked with the optimized degree distributions with random constructions, where, for one instance, the results are compared with those of some structured designs. © 1972-2012 IEEE.
Open Access
Model-driven transformations for mapping parallel algorithms on parallel computing platforms
(MDHPCL, 2013) Arkin, E.; Tekinerdoğan, Bedir
One of the important problems in parallel computing is the mapping of the parallel algorithm to the parallel computing platform. Hereby, for each parallel node the corresponding code for the parallel nodes must be implemented. For platforms with a limited number of processing nodes this can be done manually. However, in case the parallel computing platform consists of hundreds of thousands of processing nodes then the manual coding of the parallel algorithms becomes intractable and error-prone. Moreover, a change of the parallel computing platform requires considerable effort and time of coding. In this paper we present a model-driven approach for generating the code of selected parallel algorithms to be mapped on parallel computing platforms. We describe the required platform independent metamodel, and the model-to-model and the model-to-text transformation patterns. We illustrate our approach for the parallel matrix multiplication algorithm. Copyright © 2013 for the individual papers by the papers' authors.
Open Access
On capacity and coding for segmented deletion channels
(IEEE, 2011) Wang, F.; Aktaş, Defne; Duman, T. M.
We consider binary deletion channels with a segmentation assumption which appears to be suited for more practical scenarios. Unlike the binary independent and identically distributed (i.i.d.) deletion channel where each bit is independently deleted with an equal probability, the segmentation assumption prohibits certain transmitted bits to be deleted, i.e., in a block of bits of a certain length, only a limited number of deletions can occur. We first propose several upper and lower capacity bounds for the segmented deletion channel. Then we focus on an interleaved concatenation of an outer low-density parity check (LDPC) code with error-correction capabilities and an inner marker code with synchronization capabilities over these channels. With the help of a specifically designed maximum-a-posteriori (MAP) detector, we demonstrate reliable transmission at higher code rates than the existing ones reported in the literature.
Open Access
On LDPC codes for Gaussian interference channels
(IEEE, 2014) Sharifi, S.; Tanç, A. K.; Duman, Tolga M.
In this paper, we focus on the two-user Gaussian interference channel (GIC), and study the Han-Kobayashi (HK) coding/decoding strategy with the objective of designing low-density parity-check (LDPC) codes. A code optimization algorithm is proposed which adopts a random perturbation technique via tracking the average mutual information. The degree distribution optimization and convergence threshold computation are carried out for strong and weak interference channels, employing binary phase-shift keying (BPSK). Under strong interference, it is observed that optimized codes operate close to the capacity boundary. For the case of weak interference, it is shown that via the newly designed codes, a nontrivial rate pair is achievable, which is not attainable by single user codes with time-sharing. Performance of the designed LDPC codes are also studied for finite block lengths through simulations of specific codes picked from the optimized degree distributions.
Open Access
Performance analysis of code-multiplexed transmitted-reference ultra-wideband systems
(IEEE, 2011) Tutay, Mehmet Emin; Gezici, Sinan; Poor H.V.
In code-multiplexed transmitted-reference (CM-TR) ultra-wideband (UWB) systems, data signals and reference signals are transmitted using two distinct orthogonal codes. In this way, performance improvements and/or implementation advantages are obtained compared to transmitted-reference (TR) and frequency-shifted reference (FSR) ultra-wideband (UWB) systems. In this study, performance of CM-TR systems is investigated, and probability of error expressions are obtained. For the single user case, a closed-form expression for the exact probability of error is derived, whereas a Gaussian approximation, the accuracy of which depends on the number of frames per symbol, is considered for the multiuser case. Also, the maximum likelihood detector is derived, and numerical examples are presented. © 2011 IEEE.
Open Access
Performance analysis of turbo codes over Rician fading channels with impulsive noise
(IEEE, 2007) Ali, Syed Amjad; Ince, E.A.
The statistical characteristics of impulsive noise differ greatly from those of Gaussian noise. Hence, the performance of conventional decoders, optimized for additive white Gaussian noise (AWGN) channels is not promising in non-Gaussian environments. In order to achieve improved performance in impulsive environments the decoder structure needs to be modified in accordance with the impulsive noise model. This paper provides performance analysis of turbo codes over fully interleaved Rician fading channels with Middleton's additive white Class-A impulsive noise (MAWCAIN). Simulation results for the memoryless Rician fading channels using coherent BPSK signaling for both the cases of ideal channel state information (ICSI) and no channel state information (NCSI) at the decoder are provided. An eight state turbo encoder having (1, 13/15, 13/15) generator polynomial is used throughout the analysis. The novelty of this work lies in the fact that this is an initial attempt to provide a detailed analysis of turbo codes over Rician fading channels with impulsive noise rather than AWGN. ©2007 IEEE.
Open Access
Source polarization
(IEEE, 2010) Arıkan, Erdal
The notion of source polarization is introduced and investigated. This complements the earlier work on channel polarization. An application to Slepian-Wolf coding is also considered. The paper is restricted to the case of binary alphabets. Extension of results to non-binary alphabets is discussed briefly.
Open Access
A strong user authentication protocol for GSM
(IEEE, 2005-06) Aydemir, Özer; Selçuk, Ali Aydın
Traditionally, the authentication protocols for cellular phone networks have been designed for device authentication rather than user authentication, which brings certain limitations and restrictions on the functionality of the system. In this paper we propose a user authentication protocol for the Global Standards for Mobile (GSM) which permits the use of weak secrets (e.g. passwords or PINs) for authentication, providing new flexibilities for the GSM users. © 2005 IEEE.
Open Access
Uçtan uca modelleme ile kesintisiz stereo video iletimi
(IEEE, 2008-04) Tan, A. Serdar; Aksay, A; Akar, G. B.; Arıkan, Erdal
Bu çalışmamızda, hata koruma yöntemi olarak oransız kodları (Raptor Kodları) kullanan kesintisiz bir stereo video iletim sistemi önermekteyiz. İlk olarak video kodlayıcının hızbozulum (HB) eğrisini ve kanal koruma kodunun performansını analitik olarak modelledik. Daha sonra, paket kayıplarından kaynaklanan stereo videodaki kalite bozulumunu kestirdik. Son olarak, analitik modelleri ve kestirilmiş paket kayıp bozulumlarını kullanarak uçtan uca bozulum enküçültmesi uyguladık ve en iyi video kodlayıcı bit hızlarını ve eşit olmayan hata koruması (EOHK) oranlarını elde ettik. Benzetim sonuçlarında, önerilen sistemin getirdiği önemli kalite kazanımları açıkça gözlenmektedir.
Open Access
Vision-based single-stroke character recognition for wearable computing
(IEEE, 2001) Özer, Ö. F.; Özün, O.; Tüzel, C. Ö.; Atalay, V.; Çetin, A. Enis
Particularly when compared to traditional tools such as a keyboard or mouse, wearable computing data entry tools offer increased mobility and flexibility. Such tools include touch screens, hand gesture and facial expression recognition, speech recognition, and key systems. We describe a new approach for recognizing characters drawn by hand gestures or by a pointer on a user's forearm captured by a digital camera. We draw each character as a single, isolated stroke using a Graffiti-like alphabet. Our algorithm enables effective and quick character recognition. The resulting character recognition system has potential for application in mobile communication and computing devices such as phones, laptop computers, handheld computers and personal data assistants.