Sharif Digital Repository

The minimum cost subgraph for joint distributed source and network coding has been studied using a linear programming approach. This problem considers some statistically correlated information sources in a network, where sending over each link has a defined cost. The desired solution to this problem is a set of coding rates over the graph links, that minimizes the total communication costs. But in this problem, the placement of the sources is pre-defined, which is not necessarily optimal. In this paper, for the first time, we find a "good" placement for the sources using a genetic programming approach. This problem can be seen as the generalized mirror sites problem, where sources are not... 

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... 

In this paper we study the performance of spectrally-encoded spread-time (SE/ST) technique when applied to ultrawideband (UWB) signals in the context of wireless code-division multiple-access (CDMA) communication. In this technique UWB pulses are spectrally encoded with pseudorandom codes that are assigned uniquely to each user. We shall show that the SE/ST ultrawideband system provides an appropriate multi-user capacity in realistic UWB channels, along with the ability of narrowband interference (NBI) suppression. To this end, after obtaining a suitable statistical model for spectrally encoded spread-time signals, we investigate the performance of the system in the presence of... 

In this paper we use the Output Statistics of Random Binning (ORSB) framework to extend the noisy network coding of Lim et al. to include an eavesdropper  

In this paper, we present a decentralized algorithm to find minimum cost quality of service (QoS) flow subgraphs in network coded multicast schemes. The main objective is to find minimum cost subgraphs that also satisfy user-specified QoS constraints, specifically with respect to rate and delay demands. We consider networks with multiple multicast sessions. Although earlier network coding algorithms in this area have demonstrated performance improvements in terms of QoS parameters, the proposed QoS network coding approach provides a framework that guarantees QoS constraints are actually met over the network. Flow optimization, network coding, quality of service (QoS)  

One of the categories of decoding techniques for DFT codes in erasure channels is the class of iterative algorithms. Iterative algorithms can be considered as kind of alternating mapping methods using the given information in a repetitive way. In this paper, we propose a new iterative method for decoding DFT codes. It will be shown that the proposed method outperforms the well-known methods such as Wiley/Marvasti, and ADPW methods in the decoding of DFT codes in erasure channels. © Springer-Verlag 2004  

In this paper, a new on-line handwritten signature verification system using Hidden Markov Model (HMM) is presented. The proposed system segments each signature based on its perceptually important points and then computes for each segment a number of features that are scale and displacement invariant. The resulted sequence is then used for training an HMM to achieve signature verification. Our database includes 622 genuine signatures and 1010 forgery signatures that were collected from a population of 69 human subjects. Our verification system has achieved a false acceptance rate (FAR) of 4% and a false rejection rate (FRR) of 12%. © 2003 IEEE  

In this paper, we introduce a new and advanced algorithm, namely, multiple-shift algorithm for code acquisition in optical code-division multiple access (CDMA) systems using unipolar optical orthogonal codes (OOCs) as signature sequences. We analyze the performance of the newly proposed algorithm and obtain a bound on its performance and show its advantage in reducing the mean time of synchronization when compared with other synchronization methods. The algorithm can be used with many different receiver structures, like active or passive correlator with or without hardlimiter(s). However, in this paper, we only consider the simple active correlator structure for further discussions and... 

This paper presents a high level method called Matrix code to protect SRAM-based memories against multiple bit upsets. The proposed method combines hamming code and parity code to assure the reliability of memory in presence of multiple bit-upsets with low area and performance overhead. The method is evaluated using one million multiple-fault injection experiments; next reliability and MTTF of the protected memories are estimated based on fault injection experiments and several equations. The fault detection/correction coverage are also calculated and compared with previous methods i.e., Reed-Muller and hamming code. The results reveal that the proposed method behaves better than these... 

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... 

One of the approaches to modify the McEliece cryptosystem to overcome its large key size is replacing binary Goppa codes with a new structured code. However, this modification makes such cryptosystems encounter some new attacks. There are a few modified McEliece cryptosystem variants which are known to be secure. One of them is the cryptosystem introduced by Baldi et al. which uses quasi-cyclic low-density parity check (QC-LDPC) codes. This cryptosystem is still unbroken as no efficient attack has been reported against it since 2008. In this study, an attack has been applied to this cryptosystem which is feasible when the code length is a multiple of a power of 2. Also an important weakness... 

We propose a novel cooperative transmission scheme called Convolutional Network-Coded Cooperation (CNCC) for a network including N sources, one M-antenna relay, and one common destination. The source-relay (S-R) channels are assumed to be Nakagami-m fading, while the source-destination (S-D) and the relay-destination (R-D) channels are considered Rayleigh fading. The CNCC scheme exploits the generator matrix of a good (N + M', N,v) systematic convolutional code, with the free distance of dfree designed over GF(2), as the network coding matrix which is run by the network's nodes, such that the systematic symbols are directly transmitted from the sources, and the parity symbols are sent by the... 

This paper focuses on cross-layer transmission based on rateless coding for relay channels. In the proposed method, rateless coding is used at packet level and a separate physical layer coding is used at the physical layer. As rateless codes are originally designed and optimized for erasure channels, using these codes at the physical layer can lead to significant performance degradation. The proposed scheme has the advantage of a cross-layer design which uses a rateless code at the packet level modeled by an erasure channel. Based on the analysis and simulation results provided in this paper, there is an exact tradeoff between physical layer code rate and rateless code depth, and the optimum... 

In this paper, we introduce a new and advanced algorithm, namely, multiple-shift algorithm for code acquisition in optical code-division multiple access (CDMA) systems using unipolar optical orthogonal codes (OOCs) as signature sequences. We analyze the performance of the newly proposed algorithm and obtain a bound on its performance and show its advantage in reducing the mean time of synchronization when compared with other synchronization methods. The algorithm can be used with many different receiver structures, like active or passive correlator with or without hardlimiter(s). However, in this paper, we only consider the simple active correlator structure for further discussions and... 

In this letter, we introduce a whole new approach in defining and representing optical orthogonal codes (OOCs), namely, outer-product matrix representation. Instead of applying commonly used approaches based on inner product to construct OOC codes, we use the newly defined approach to obtain a more efficient algorithm in constructing and generating OOC codes. The outer-product matrix approach can obtain a family of OOC codes with a cardinality closer to the Johnson upper bound, when compared with the previously defined accelerated greedy algorithm using the inner-product approach. We believe the new look introduced in this letter on OOCs could help to devise new approaches in designing and... 

In this paper, we propose CodedSketch, as a distributed straggler-resistant scheme to compute an approximation of the multiplication of two massive matrices. The objective is to reduce the recovery threshold, defined as the total number of worker nodes that the master node needs to wait for to be able to recover the final result. To exploit the fact that only an approximated result is required, in reducing the recovery threshold, some sorts of pre-compression are required. However, compression inherently involves some randomness that would lose the structure of the matrices. On the other hand, considering the structure of the matrices is crucial to reduce the recovery threshold. In... 

In this paper, we provide multiuser performance analysis of a multicarrier frequency-hopping (MC-FH) code-division multiple-access system as first introduced in the work of Lance and Kaleh. We propose to use a practical low-rate convolutional error-correcting code in this system, which does not require any additional bandwidth than what is needed by the frequency-hopping spread-spectrum modulation. We provide multiuser exact performance analysis of the system for both uncoded and coded schemes in additive white Gaussian noise and fading channels for a single-user correlator receiver. We also derive the performance analysis of the system based on a Gaussian distribution assumption for... 

In this paper, we propose using a soft-input decoder for the decoding of internally convolutional coded Poisson noise-dominated fiber-optic code-division multiple-access (CDMA) communication systems using optical orthogonal codes. We first compute the coded symbol log-likelihoods at the output of the Poisson noise-dominated channel, which is then used by a soft-input maximum-likelihood decoder, for a fiber-optic CDMA system assuming both on-off keying and binary pulse position modulation schemes. Furthermore, we develop a discrete soft-output channel model for a Poisson noise-dominated channel, with which we evaluate the upper bound on the bit error probability of the internally coded... 

In this paper, we consider the structure and performance of a multistage decoding scheme for an internally bandwidth efficient convolutionally coded Poisson fiber-optic code division multiple access (CDMA) communication system. The decoder is implemented electronically in several stages in which in each stage, the interfering users' coded bit decisions obtained in the previous stage is applied for computing the likelihood of the coded symbols of the desired user. The first stage is a soft-input Viterbi decoder for the internally coded scheme, in which the soft-input coded symbol likelihood values are computed by considering the multiuser interference as a noise signal. The likelihood of... 

In this paper, we consider using practical low-rate error correcting codes in fiber-optic code division multiple-access (CDMA) communication systems. To this end, a different method of low-rate channel coding is proposed. As opposed to the conventional coding schemes, this method does not require any further bandwidth expansion for error correction in fiber-optic CDMA communication systems. The low-rate channel codes that are used for demonstrating the capabilities of the proposed method are super-orthogonal codes. These codes are near optimal and have a relatively low complexity. We evaluate the upper bounds on the bit-error probability of the proposed coded fiber-optic CDMA system assuming...