#### Filter Results:

- Full text PDF available (26)

#### Publication Year

2008

2017

- This year (4)
- Last 5 years (16)
- Last 10 years (35)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ulugbek Kamilov, Pedram Pad, Arash Amini, Michael Unser
- IEEE Trans. Signal Processing
- 2013

We investigate a stochastic signal-processing framework for signals with sparse derivatives, where the samples of a Lévy process are corrupted by noise. The proposed signal model covers the well-known Brownian motion and piecewise-constant Poisson process; moreover, the Lévy family also contains other interesting members exhibiting heavy-tail statistics… (More)

- Pedram Pad, Farrokh Marvasti, Kasra Alishahi, Saieed Akbari
- 2008 IEEE International Symposium on Information…
- 2008

In this paper we introduce a new class of codes for over-loaded synchronous wireless and optical CDMA systems which increases the number of users for fixed number of chips without introducing any errors. Equivalently, the chip rate can be reduced for a given number of users, which implies bandwidth reduction for downlink wireless systems. An upper bound for… (More)

In this paper we introduce a new class of codes for over-loaded synchronous wireless CDMA systems which increases the number of users for a fixed number of chips without introducing any errors. In addition these codes support active user detection. We derive an upper bound on the number of users with a fixed spreading factor. Also we propose an ML decoder… (More)

- A. Makhdoumi Kakhaki, H. Karkeh Abadi, Pedram Pad, Hamid Saeedi, Farrokh Marvasti, Kasra Alishahi
- 2012 IEEE International Symposium on Information…
- 2012

In this paper, we prove the existence of capacity achieving linear codes with random binary sparse generating matrices over the Binary Symmetric Channel (BSC). The results on the existence of capacity achieving linear codes in the literature are limited to the random binary codes with equal probability generating matrix elements and sparse parity-check… (More)

- Seyed Amirhossein Hosseini, Omid Javidbakht, Pedram Pad, Farrokh Marvasti
- EURASIP J. Wireless Comm. and Networking
- 2011

This paper is a tutorial review on important issues related to code-division multiple-access (CDMA) systems such as channel capacity, power control, and optimum codes; specifically, we consider optimum overloaded codes that achieve errorless transmission in the absence of noise for the binary and nonbinary cases. A survey of lower and upper bounds for the… (More)

- Adrien Depeursinge, Pedram Pad, +4 authors Michael Unser
- ISBI
- 2015

Our aim is to optimize wavelet–based feature extraction for differentiating between the classical versus atypical pattern of usual interstitial pneumonia (UIP) in volumetric CT. Our proposal is to act on the bandwidth of steerable wavelets while maintaining their tight frame property. To that end, we designed a family of maximally localized wavelet pyramids… (More)

- Pedram Pad, Virginie Uhlmann, Michael Unser
- 2014 IEEE International Conference on Image…
- 2014

We study the issue of localization in the context of isotropic wavelet frames. We define a variance-type measure of localization and propose an algorithm based on calculus of variations to minimize this criterion under the constraint of a tight wavelet frame. Based on these calculations, we design the variance-optimal wavelet (VOW). Finally, we demonstrate… (More)

- Pedram Pad, Farrokh Marvasti, Kasra Alishahi, Saieed Akbari
- IEEE Transactions on Information Theory
- 2009

In this paper, we introduce a new class of codes for overloaded synchronous wireless and optical code-division multiple-access (CDMA) systems which increases the number of users for fixed number of chips without introducing any errors. Equivalently, the chip rate can be reduced for a given number of users, which implies bandwidth reduction for downlink… (More)

- Kasra Alishahi, Farrokh Marvasti, Vahid Aref, Pedram Pad
- IEEE Transactions on Information Theory
- 2009

In this paper, we obtain a family of lower bounds for the sum capacity of code-division multiple-access (CDMA) channels assuming binary inputs and binary signature codes in the presence of additive noise with an arbitrary distribution. The envelope of this family gives a relatively tight lower bound in terms of the number of users, spreading gain, and the… (More)

- Kasra Alishahi, Shayan Dashmiz, Pedram Pad, Farrokh Marvasti
- IEEE Transactions on Information Theory
- 2012

In this paper, we explore some of the fundamentals of synchronous Code Division Multiple Access (CDMA) as applied to wireless and optical communication systems under very general settings (of any size) for the user symbols and the signature matrix entries. The channel is modeled by real/complex additive noise of arbitrary distribution. Two problems are… (More)