Mohammad Javad Salariseddigh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mohammad Javad Salariseddigh has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Christian Deppe
Technische Universität Braunschweig
7 shared publications - Holger Boche
Technical University of Munich
6 shared publications - Robert Schober
Friedrich-Alexander-Universität Erlangen-Nürnberg, Erlangen, Germany
4 shared publications - Uzi Pereg
Faculty of Electrical and Computer Engineering and the Helen Diller Quantum Center, TechnionIsrael Institute of Technology, Haifa, Israel
4 shared publications - Vahid Jamali
TU Darmstadt, Darmstadt, Germany
4 shared publications - Emad Zinoghli
Department of Electrical Engineering Sharif University of Technology
1 shared publication
Latest Publications
- Open Access
Identification Codes via Prime Numbers
We introduce a method for construction of identification codes based on prime number generation over the noiseless channels. The earliest method for such construction based on prime numbers was proposed by Ahlswede which relies on algorithms for generation of prime numbers. This method requires knowledge of $2^n$ first prime numbers for identification codes with block length $n,$ which is not computationally efficient. In this work, we revisit Ahlswede's scheme and propose a number of modifications. In particular, employing probabilistic prime generation algorithm, we guarantee that the prime keys generation is possible in polynomial time. Furthermore, additional improvements in terms of type II upper bound are derived and presented. Finally, we propose a method for identification coding based on hash functions which generalizes the Ahlswede's scheme.Open AccessIdentification Codes via Prime Numbers
We introduce a method for construction of identification codes based on prime number generation over the noiseless channels. The earliest method for such construction based on prime numbers was proposed by Ahlswede which relies on algorithms for generation of prime numbers. This method requires knowledge of $2^n$ first prime numbers for identification codes with block length $n,$ which is not computationally efficient. In this work, we revisit Ahlswede's scheme and propose a number of modifications. In particular, employing probabilistic prime generation algorithm, we guarantee that the prime keys generation is possible in polynomial time. Furthermore, additional improvements in terms of type II upper bound are derived and presented. Finally, we propose a method for identification coding based on hash functions which generalizes the Ahlswede's scheme. - Open Access
- 26 February 2024
- Published by MDPI AG in Future Internet
- Vol. 16 (3) , 78
Deterministic K-Identification for Future Communication Networks: The Binary Symmetric Channel Results
Numerous applications of the Internet of Things (IoT) feature an event recognition behavior where the established Shannon capacity is not authorized to be the central performance measure. Instead, the identification capacity for such systems is considered to be an alternative metric, and has been developed in the literature. In this paper, we develop deterministic K-identification (DKI) for the binary symmetric channel (BSC) with and without a Hamming weight constraint imposed on the codewords. This channel may be of use for IoT in the context of smart system technologies, where sophisticated communication models can be reduced to a BSC for the aim of studying basic information theoretical properties. We derive inner and outer bounds on the DKI capacity of the BSC when the size of the goal message set K may grow in the codeword length n. As a major observation, we find that, for deterministic encoding, assuming that K grows exponentially in n, i.e., , where is the identification goal rate, then the number of messages that can be accurately identified grows exponentially in n, i.e., , where R is the DKI coding rate. Furthermore, the established inner and outer bound regions reflects impact of the input constraint (Hamming weight) and the channel statistics, i.e., the cross-over probability.- 26 February 2024
- Published by MDPI AG in Future Internet
- Vol. 16 (3) , 78
Open AccessDeterministic K-Identification for Future Communication Networks: The Binary Symmetric Channel Results
Numerous applications of the Internet of Things (IoT) feature an event recognition behavior where the established Shannon capacity is not authorized to be the central performance measure. Instead, the identification capacity for such systems is considered to be an alternative metric, and has been developed in the literature. In this paper, we develop deterministic K-identification (DKI) for the binary symmetric channel (BSC) with and without a Hamming weight constraint imposed on the codewords. This channel may be of use for IoT in the context of smart system technologies, where sophisticated communication models can be reduced to a BSC for the aim of studying basic information theoretical properties. We derive inner and outer bounds on the DKI capacity of the BSC when the size of the goal message set K may grow in the codeword length n. As a major observation, we find that, for deterministic encoding, assuming that K grows exponentially in n, i.e., , where is the identification goal rate, then the number of messages that can be accurately identified grows exponentially in n, i.e., , where R is the DKI coding rate. Furthermore, the established inner and outer bound regions reflects impact of the input constraint (Hamming weight) and the channel statistics, i.e., the cross-over probability. - Open Access
- 29 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 5, 1101-1122
Deterministic K-Identification for MC Poisson Channel With Inter-Symbol Interference
Various applications of molecular communications (MCs) feature an alarm-prompt behavior for which the prevalent Shannon capacity may not be the appropriate performance metric. The identification capacity as an alternative measure for such systems has been motivated and established in the literature. In this paper, we study deterministic K-identification (DKI) for the discrete-time Poisson channel (DTPC) with inter-symbol interference (ISI), where the transmitter is restricted to an average and a peak molecule release rate constraint. Such a channel serves as a model for diffusive MC systems featuring long channel impulse responses and employing molecule-counting receivers. We derive lower and upper bounds on the DKI capacity of the DTPC with ISI when the size of the target message set K and the number of ISI channel taps L may grow with the codeword length n. As a key finding, we establish that for deterministic encoding, assuming that K and L both grow sub-linearly in n, i.e., K = 2κlogn and L = 2llogn with κ + 4l ϵ 0,1), where κ ϵ 0,1) is the identification target rate and l ϵ 0,1/4) is the ISI rate, then the number of different messages that can be reliably identified scales super-exponentially in n, i.e., ~2(nlogn)R, where R is the DKI coding rate. Moreover, since l and κ must fulfill κ + 4l ϵ 0,1), we show that optimizing l (or equivalently the symbol rate) leads to an effective identification rate bits/s that scales sub-linearly with n. This result is in contrast to the typical transmission rate bits/s which is independent of n.
- 29 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 5, 1101-1122
Open AccessDeterministic K-Identification for MC Poisson Channel With Inter-Symbol Interference
Various applications of molecular communications (MCs) feature an alarm-prompt behavior for which the prevalent Shannon capacity may not be the appropriate performance metric. The identification capacity as an alternative measure for such systems has been motivated and established in the literature. In this paper, we study deterministic K-identification (DKI) for the discrete-time Poisson channel (DTPC) with inter-symbol interference (ISI), where the transmitter is restricted to an average and a peak molecule release rate constraint. Such a channel serves as a model for diffusive MC systems featuring long channel impulse responses and employing molecule-counting receivers. We derive lower and upper bounds on the DKI capacity of the DTPC with ISI when the size of the target message set K and the number of ISI channel taps L may grow with the codeword length n. As a key finding, we establish that for deterministic encoding, assuming that K and L both grow sub-linearly in n, i.e., K = 2κlogn and L = 2llogn with κ + 4l ϵ 0,1), where κ ϵ 0,1) is the identification target rate and l ϵ 0,1/4) is the ISI rate, then the number of different messages that can be reliably identified scales super-exponentially in n, i.e., ~2(nlogn)R, where R is the DKI coding rate. Moreover, since l and κ must fulfill κ + 4l ϵ 0,1), we show that optimizing l (or equivalently the symbol rate) leads to an effective identification rate bits/s that scales sub-linearly with n. This result is in contrast to the typical transmission rate bits/s which is independent of n.
- Top Cited Papers
- 13 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Molecular, Biological, and Multi-Scale Communications
- Vol. 9 (4) , 408-424
Deterministic Identification for Molecular Communications Over the Poisson Channel
Various applications of molecular communications (MC) are event-triggered, and, as a consequence, the prevalent Shannon capacity may not be the right measure for performance assessment. Thus, in this paper, we motivate and establish the identification capacity as an alternative metric. In particular, we study deterministic identification (DI) for the discrete-time Poisson channel (DTPC), subject to an average and a peak molecule release rate constraint, which serves as a model for MC systems employing molecule counting receivers. It is established that the number of different messages that can be reliably identified for this channel scales as 2(nlogn)R, where n and R are the codeword length and coding rate, respectively. Lower and upper bounds on the DI capacity of the DTPC are developed. The obtained large capacity of the DI channel sheds light on the performance of natural DI systems such as natural olfaction, which are known for their extremely large chemical discriminatory power in biology. Furthermore, numerical results for the empirical miss-identification and false identification error rates are provided for finite length codes. This allows us to characterize the behaviour of the error rate for increasing codeword lengths, which complements our theoretically-derived scale for asymptotically large codeword lengths.
- 13 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Molecular, Biological, and Multi-Scale Communications
- Vol. 9 (4) , 408-424
Top Cited PapersDeterministic Identification for Molecular Communications Over the Poisson Channel
Various applications of molecular communications (MC) are event-triggered, and, as a consequence, the prevalent Shannon capacity may not be the right measure for performance assessment. Thus, in this paper, we motivate and establish the identification capacity as an alternative metric. In particular, we study deterministic identification (DI) for the discrete-time Poisson channel (DTPC), subject to an average and a peak molecule release rate constraint, which serves as a model for MC systems employing molecule counting receivers. It is established that the number of different messages that can be reliably identified for this channel scales as 2(nlogn)R, where n and R are the codeword length and coding rate, respectively. Lower and upper bounds on the DI capacity of the DTPC are developed. The obtained large capacity of the DI channel sheds light on the performance of natural DI systems such as natural olfaction, which are known for their extremely large chemical discriminatory power in biology. Furthermore, numerical results for the empirical miss-identification and false identification error rates are provided for finite length codes. This allows us to characterize the behaviour of the error rate for increasing codeword lengths, which complements our theoretically-derived scale for asymptotically large codeword lengths.
- Open Access
- 25 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 448-453
Deterministic Identification for MC Binomial Channel
The Binomial channel serves as a fundamental model for molecular communication (MC) systems employing molecule-counting receivers. Here, deterministic identification (DI) is addressed for the discrete-time Binomial channels (DTBC), subject to an average and a peak constraint on the molecule release rate. We establish that the number of different messages that can be reliably identified for the DTBC scales as 2 (n log n)R , where n and R are the codeword length and coding rate, respectively. Lower and upper bounds on the DI capacity of the DTBC are developed.
- 25 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 448-453
Open AccessDeterministic Identification for MC Binomial Channel
The Binomial channel serves as a fundamental model for molecular communication (MC) systems employing molecule-counting receivers. Here, deterministic identification (DI) is addressed for the discrete-time Binomial channels (DTBC), subject to an average and a peak constraint on the molecule release rate. We establish that the number of different messages that can be reliably identified for the DTBC scales as 2 (n log n)R , where n and R are the codeword length and coding rate, respectively. Lower and upper bounds on the DI capacity of the DTBC are developed.
- Open Access
Deterministic $K$-identification For Slow Fading Channel
Deterministic $K$-identification (DKI) is addressed for Gaussian channels with slow fading (GSF), where the transmitter is restricted to an average power constraint and channel side information is available at the decoder. We derive lower and upper bounds on the DKI capacity when the number of identifiable messages $K$ may grow sub-linearly with the codeword length $n$. As a key finding, we establish that for deterministic encoding, assuming that the number of identifiable messages $K = 2^{\kappa \log n}$ with $\kappa \in [0,1)$ being the identification target rate, the codebook size scales as $2^{(n\log n)R}$, where $R$ is the coding rate.Open AccessDeterministic $K$-identification For Slow Fading Channel
Deterministic $K$-identification (DKI) is addressed for Gaussian channels with slow fading (GSF), where the transmitter is restricted to an average power constraint and channel side information is available at the decoder. We derive lower and upper bounds on the DKI capacity when the number of identifiable messages $K$ may grow sub-linearly with the codeword length $n$. As a key finding, we establish that for deterministic encoding, assuming that the number of identifiable messages $K = 2^{\kappa \log n}$ with $\kappa \in [0,1)$ being the identification target rate, the codebook size scales as $2^{(n\log n)R}$, where $R$ is the coding rate. - Open Access
Deterministic Identification For MC ISI-Poisson Channel
Several applications of molecular communications (MC) feature an alarm-prompt behavior for which the prevalent Shannon capacity may not be the appropriate performance metric. The identification capacity as an alternative measure for such systems has been motivated and established in the literature. In this paper, we study deterministic identification (DI) for the discrete-time \emph{Poisson} channel (DTPC) with inter-symbol interference (ISI) where the transmitter is restricted to an average and a peak molecule release rate constraint. Such a channel serves as a model for diffusive MC systems featuring long channel impulse responses and employing molecule counting receivers. We derive lower and upper bounds on the DI capacity of the DTPC with ISI when the number of ISI channel taps $K$ may grow with the codeword length $n$ (e.g., due to increasing symbol rate). As a key finding, we establish that for deterministic encoding, the codebook size scales as $2^{(n\log n)R}$ assuming that the number of ISI channel taps scales as $K = 2^{\kappa \log n}$, where $R$ is the coding rate and $\kappa$ is the ISI rate. Moreover, we show that optimizing $\kappa$ leads to an effective identification rate [bits/s] that scales linearly with $n$, which is in contrast to the typical transmission rate [bits/s] that is independent of $n$.Open AccessDeterministic Identification For MC ISI-Poisson Channel
Several applications of molecular communications (MC) feature an alarm-prompt behavior for which the prevalent Shannon capacity may not be the appropriate performance metric. The identification capacity as an alternative measure for such systems has been motivated and established in the literature. In this paper, we study deterministic identification (DI) for the discrete-time \emph{Poisson} channel (DTPC) with inter-symbol interference (ISI) where the transmitter is restricted to an average and a peak molecule release rate constraint. Such a channel serves as a model for diffusive MC systems featuring long channel impulse responses and employing molecule counting receivers. We derive lower and upper bounds on the DI capacity of the DTPC with ISI when the number of ISI channel taps $K$ may grow with the codeword length $n$ (e.g., due to increasing symbol rate). As a key finding, we establish that for deterministic encoding, the codebook size scales as $2^{(n\log n)R}$ assuming that the number of ISI channel taps scales as $K = 2^{\kappa \log n}$, where $R$ is the coding rate and $\kappa$ is the ISI rate. Moreover, we show that optimizing $\kappa$ leads to an effective identification rate [bits/s] that scales linearly with $n$, which is in contrast to the typical transmission rate [bits/s] that is independent of $n$. - Open Access
- 26 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (1) , 1-24
Deterministic Identification Over Channels With Power Constraints
The deterministic identification (DI) capacity is developed in multiple settings of channels with power constraints. A full characterization is established for the DI capacity of the discrete memoryless channel (DMC) with and without input constraints. Originally, Ahlswede and Dueck established the identification capacity with local randomness at the encoder, resulting in a double exponential number of messages in the block length $n$ . In the deterministic setup, the number of messages scales exponentially, as in Shannon’s transmission paradigm, but the achievable identification rates are higher. An explicit proof was not provided for the deterministic setting. In this paper, a detailed proof is presented for the DMC. Furthermore, Gaussian channels with fast and slow fading are considered, when channel side information is available at the decoder. A new phenomenon is observed as we establish that the number of messages scales as $2^{n\log (n)R}$ by deriving lower and upper bounds on the DI capacity on this scale. Consequently, the DI capacity of the Gaussian channel is infinite in the exponential scale and zero in the double exponential scale, regardless of the channel noise.
- 26 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (1) , 1-24
Open AccessDeterministic Identification Over Channels With Power Constraints
The deterministic identification (DI) capacity is developed in multiple settings of channels with power constraints. A full characterization is established for the DI capacity of the discrete memoryless channel (DMC) with and without input constraints. Originally, Ahlswede and Dueck established the identification capacity with local randomness at the encoder, resulting in a double exponential number of messages in the block length $n$ . In the deterministic setup, the number of messages scales exponentially, as in Shannon’s transmission paradigm, but the achievable identification rates are higher. An explicit proof was not provided for the deterministic setting. In this paper, a detailed proof is presented for the DMC. Furthermore, Gaussian channels with fast and slow fading are considered, when channel side information is available at the decoder. A new phenomenon is observed as we establish that the number of messages scales as $2^{n\log (n)R}$ by deriving lower and upper bounds on the DI capacity on this scale. Consequently, the DI capacity of the Gaussian channel is infinite in the exponential scale and zero in the double exponential scale, regardless of the channel noise.