Sharif Digital Repository

A new neutron spectrum unfolding code TGASU (Two-steps Genetic Algorithm Spectrum Unfolding) has been developed to unfold the neutron spectrum from a pulse height distribution which was calculated using the MCNPX-ESUT computational Monte Carlo code. To perform the unfolding process, the response matrices were generated using the MCNPX-ESUT computational code. Both one step (common GA) and two steps GAs have been implemented to unfold the neutron spectra. According to the obtained results, the new two steps GA code results has shown closer match in all energy regions and particularly in the high energy regions. The results of the TGASU code have been compared with those of the standard... 

In this study, the secret polar encoding and secret successive cancellation decoding algorithms are introduced; with these algorithms, secure and efficient communication can be enhanced between the honest parties. Also, the key size of the proposed polar code-based secure channel coding system is reduced significantly compared to the existing systems. To decrease the key size, the authors employ the three following methods: (i) a new approach is proposed to save some bit-channel indices instead of saving the generator matrix of the used polar code; (ii) the permutation and scrambling matrices are not used in this scheme; and (iii) by the help of the properties of polar codes, it does not... 

In this paper, we study the problem of simulating a discrete memoryless channel (DMC) from another DMC under an average-case and an exact model. We present several achievability and infeasibility results, with tight characterizations in special cases. In particular, for the exact model, we fully characterize when a binary symmetric channel can be simulated from a binary erasure channel when there is no shared randomness. We also provide infeasibility and achievability results for the simulation of a binary channel from another binary channel in the case of no shared randomness. To do this, we use the properties of Rényi capacity of a given order. We also introduce a notion of 'channel... 

We introduce the blind index coding (BIC) problem, in which a single sender communicates distinct messages to multiple users over a shared channel. Each user has partial knowledge of each message as side information. However, unlike classical index coding, in BIC, the sender is uncertain of what side information is available to each user. In particular, the sender only knows the amount of bits in each user's side information but not its content. This problem can arise naturally in caching and wireless networks. In order to blindly exploit side information in the BIC problem, we develop a hybrid coding scheme that XORs uncoded bits of a subset of messages with random combinations of bits from... 

We develop an analytical framework for queueing and delay analysis in the case of a number of distinct flows arriving at a network node, where asynchronous partial network coding is applied for an efficient packet transmission. In order to perfectly model and analyze the practical communication networks, the arriving flows are assumed to be general Markovian arrival processes. As a key example, we apply the proposed model to the problem of coded caching in single bottleneck caching networks. In addition, we verify the accuracy of the proposed model through simulations and real trace-driven experiments. © 1967-2012 IEEE  

This article presents a study on the capability of the time domain OMA method, NExT-ERA, to identify closely spaced structural dynamic modes. A survey in the literature reveals that few experimental studies have been conducted on the effectiveness of the NExT-ERA methodology in case of closely spaced modes specifically. In this paper we present the formulation for NExT-ERA. This formulation is then implemented in an algorithm and a code, developed in house to identify the modal parameters of different systems using their generated time history data. Some numerical models are firstly investigated to validate the code. Two different case studies involving a plate with closely spaced modes and... 

Instruction cache misses are a significant source of performance degradation in server workloads because of their large instruction footprints and complex control flow. Due to the importance of reducing the number of instruction cache misses, there has been a myriad of proposals for hardware instruction prefetchers in the past two decades. While effectual, state-of-the-art hardware instruction prefetchers either impose considerable storage overhead or require significant changes in the frontend of a processor. Unlike hardware instruction prefetchers, code-layout optimization techniques profile a program and then reorder the code layout of the program to increase spatial locality, and hence,... 

A variable-length code is called a fix-free code if it is both prefix-free and suffix-free. In this paper, we consider some basic properties of fix-free codes. We obtain one lower and one upper bound on the redundancy of the optimal fix-free code. Comparing these bounds, we derive an upper bound on the length of the most likely source symbol in terms of its probability. © 2008 IEEE  

We introduce a new communication model consisting of two interfering broadcast channels with one cognitive transmitter, who knows the message transmitted by the other non-cognitive transmitter, in a non-causal manner. An achievable rate region is derived for this model. The region is computed based on the Marton region for the general broadcast channel and its extension by Steinberg to the broadcast channel with the states known at the transmitter. By using the region evaluated, an achievable rate for the Gaussian broadcast channel is derived. © 2008 IEEE  

A new technique for coding and decoding of optical signals through the use of polarization is described. In this technique the concept of coding is translated to polarization. In other words, coding is done in such a way that each code represents a unique polarization. This is done by implementing a binary pattern on a spatial light modulator in such a way that the reflected light has the required polarization. Decoding is done by the detection of the received beam's polarization. By linking the concept of coding to polarization we can use each of these concepts in measuring the other one, attaining some gains. In this paper the construction of a simple point-to-point communication where... 

In this paper, the detection of a coded signal in additive white Gaussian noise and the interference is studied, where there is no knowledge about the correlation between the received symbols and about the noise and interference parameters. The Maximum Likelihood (ML) estimates of the unknown parameters are found, they are substituted in the probability density functions of the observation and the Generalized Likelihood Ratio (GLR) detector is derived. This detector can also be used for the activity detection of a signal in unknown Inter-Symbol Interference (ISI). In this case, the interference is modeled as the unknown correlation between the received symbols. Simulation examples are... 

A new time-hopping ultrawideband (TH-UWB) CDMA scheme for indoor wireless communications is presented. In the proposed method, the duration of each bit is divided into Ns1 frames, each one containing Ns2 subframes. Two pseudorandom sequences are assigned to each user. During each bit interval, based on the output of a super-orthogonal encoder and the user's first dedicated pseudorandom sequence, the transmitter selects one of the Ns1 frames and then transmits Ns2 narrow pulses in that frame, one in each of the Ns2 subframes. The location of the pulse in each subframe is determined by the user's second dedicated PN sequence. Four different detection techniques are considered at the receiver... 

Space-time transmit diversity results in coupling of transmitted symbols across different antennas, which increases the complexity of maximum-likelihood decoding. Symbol coupling can be completely or partially avoided if the space-time code (STC) satisfies specific decoupling conditions; examples of such codes are orthogonal space-time block codes and quasi-orthogonal codes. In this letter, we study decoupling conditions for a linear full-diversity STC. Quasi-decoupled codes are proposed as a partially decoupled full-diversity STC of any rate for any number of transmit antennas with minimum decoding delay. By optimizing the coding gain of quasi-decoupled codes, it is shown that... 

Turbocharging of gasoline engines has been improved less than diesel engines due to some difficulties, especially knock phenomena. They require wider air flow range and faster response too. A computer code is developed to simulate turbocharged gasoline engine behavior. A three zone combustion model is employed. Different performance curves at speed and equivalence ratio ranges are prepared. By this code naturally aspirated and turbocharged behavior are compared. A turbocharged aftercooled engine has been studied in various cases to complete the investigation. Some aftercooler effects are described experimentally. Modeling and experimental results are compared providing valuable achievements.... 

We consider the problem of recovering channel code parameters over a candidate set by merely analyzing the received encoded signals. We propose a deep learning-based solution that I) is capable of identifying the channel code parameters for several coding scheme (such as LDPC, Convolutional, Turbo, and Polar codes), II) is robust against channel impairments like multi-path fading, III) does not require any previous knowledge or estimation of channel state or signal-to-noise ratio (SNR), and IV) outperforms related works in terms of probability of detecting the correct code parameters. © 2012 IEEE  

Context: Software testing is a pivotal activity in the development of high-quality software. As software is evolving through its life cycle, the need for a fault-revealing criterion assessing the effectiveness of the test suite grows. Over the years, researchers have proposed coverage-based criteria, including statement and branch coverage, to solve this issue. In literature, the effectiveness of such criteria is attested in terms of their correlations with the mutation score. Objective: In this paper, we aim at proposing a coverage-based criterion named statement frequency coverage, which outperforms statement and branch coverage in terms of correlation with mutation score. Method: To this... 

Context: Software testing is a pivotal activity in the development of high-quality software. As software is evolving through its life cycle, the need for a fault-revealing criterion assessing the effectiveness of the test suite grows. Over the years, researchers have proposed coverage-based criteria, including statement and branch coverage, to solve this issue. In literature, the effectiveness of such criteria is attested in terms of their correlations with the mutation score. Objective: In this paper, we aim at proposing a coverage-based criterion named statement frequency coverage, which outperforms statement and branch coverage in terms of correlation with mutation score. Method: To this... 

This paper analyzes the problem of transient-error recovery of several protecting techniques used in fault-tolerant cache memories. In this paper, reliability and mean-time-to-failure (MTTF) equations for several protecting techniques are derived and estimated. The results of the considered techniques are compared with those of cache memories without redundancies and with only parity codes in both tag and data arrays of caches. Depending on the error rate under which a cache memory will operate, and the size of the cache memory, one of the analyzed cases could be used. If the transient-error rate is very small or the size of cache memory is relatively small, then a protected with only single... 

Multirate time hopping ultra wideband (TH-UWB) communication systems are considered where each user can have several multirate services. Three methods named as parallel mapping, serial mapping with variable spreading factor, and multicode using Walsh subcode concatenation schemes are investigated. In the parallel mapping method, one kind of signature code (PN code) is used to distinguish users and their diverse services alike. For the serial mapping with variable spreading factor scheme, one signature code is assigned to each user and different services send their data in distinct frames. Whereas in the multicode using Walsh subcode method, different users and different services of the same... 

Composition of a concurrent system out of components involves coordination of their mutual interactions. In component-based construction, this coordination becomes the responsibility of the glue-code language and its underlying run-time middle-ware. Reo offers an expressive glue-language for construction of coordinating component connectors out of primitive channels. In this paper we consider the problem of synthesizing Reo coordination code from a specification of a behavior as a relation on scheduled-data streams. The specification is given as a constraint automaton that describes the desired input/output behavior at the ports of the components. The main contribution in this paper is an...