Scan Science and Technology
Contact Leading Edge Experts & Companies
Arbitrary Mapping
The Experts below are selected from a list of 249 Experts worldwide ranked by ideXlab platform
Sundar B. Rajan – 1st expert on this subject based on the ideXlab platform

Index Coded PSK Modulation for Prioritized Receivers
IEEE Transactions on Vehicular Technology, 2017CoAuthors: Divya Usha Sudhakaran, Sundar B. RajanAbstract:A noisy index coding problem (ICP) over additive white Gaussian noise (AWGN) and Rayleigh fading channels is studied. First, a singleinput singleoutput AWGN broadcast channel is considered. For a chosen index code and an Arbitrary Mapping (of broadcast vectors to phaseshift keying (PSK) signal points), a decision rule for the maximumlikelihood (ML) decoder is derived. The message error performance of a receiver at high signaltonoise ratio (SNR) is characterized by a parameter called PSKindex coding gain (PSKICG). The PSKICG of a receiver is determined by a metric called minimum interset distance. For a given ICP with an order of priority among the receivers, and a chosen 2NPSK constellation, an algorithm to find (index code, Mapping) pairs, each of which gives the best performance in terms of PSKICG of the receivers, is proposed. No other pair of index code (of length N with 2N broadcast vectors) and Mapping can give a better PSKICG for the highest priority receiver. Also, given that the highest priority receiver achieves its best performance, the next highest priority receiver achieves its maximum gain possible and so on in the specified order of priority. Next, the noisy ICP over a multipleinput multipleoutput (MIMO) Rayleigh fading channel is considered. The receivers are equipped with a single antenna and a server with two antennas. To obtain the diversity gain along with the coding gain, a MIMO scheme that employs spacetime coding along with index coded PSK modulation is proposed. For a chosen index code, an Arbitrary Mapping (of broadcast vectors to PSK signal points), and a 2 × 1 MIMO system employing Alamouti code, we derive a decision rule for the ML decoding. We show that for the best coding gain at high SNR, the Mapping must maximize the minimum interset distance.

AlamoutiIndexCoded PSK Modulation for Priority Ordered Receivers
GLOBECOM 2017 – 2017 IEEE Global Communications Conference, 2017CoAuthors: Divya Usha Sudhakaran, Sundar B. RajanAbstract:Noisy index coding problem over a Rayleigh fading channel is studied. The receivers are assumed to be priority ordered with each of them equipped with single antenna and the server with two antennas. To obtain diversity gain along with coding gain, a multipleinput multipleoutput (MIMO) scheme which employs space time coding along with index coded PSK modulation, is proposed. For a chosen index code, an Arbitrary Mapping (of broadcast vectors to PSK signal points) and a 2×1 MIMO system employing Alamouti code, a decision rule for the maximum likelihood (ML) decoding is derived. It is shown that, at very high SNR, the message error performance of the receiver employing ML decoder, depends on the metric called minimum interset distance, and for the best coding gain at high SNR, the Mapping must maximize the minimum interset distance.

Maximum Likelihood Decoder for Index Coded PSK Modulation for Priority Ordered Receivers
2017 IEEE 86th Vehicular Technology Conference (VTCFall), 2017CoAuthors: Divya Usha Sudhakaran, Sundar B. RajanAbstract:Index coded PSK modulation over an AWGN broadcast channel, for a given index coding problem (ICP) is studied. For a chosen index code and an Arbitrary Mapping (of broadcast vectors to PSK signal points), a decision rule for the maximum likelihood (ML) decoder is derived. The message error performance of a receiver at high SNR is characterized by a parameter called PSKindex coding gain (PSKICG). The PSKICG of a receiver is determined by a metric called minimum interset distance. For a given ICP with an order of priority among the receivers, and a chosen 2NPSK constellation an algorithm to find (index code, Mapping) pairs, each of which gives the best performance in terms of PSKICG of the receivers, is proposed. No other pair of index code (of length N with 2N broadcast vectors) and Mapping can give a better PSKICG for the highest priority receiver. Also, given that the highest priority receiver achieves its best performance, the next highest priority receiver achieves its maximum gain possible and so on in the specified order of priority.
Igor N. Aizenberg – 2nd expert on this subject based on the ideXlab platform

Classification of the images of gene expression patterns using neural networks based on multivalued neurons with the minimal number of inputs
electronic imaging, 2002CoAuthors: Igor N. Aizenberg, Maria Samsonova, Ekaterina Myasnikova, Constantine Butakoff, John ReinitzAbstract:Multivalued neurons (MVN) are the neural processing elements with complexvalued weights and high functionality. It is possible to implement an Arbitrary Mapping described by partialdefined multiplevalued function on the single MVN. The MVNbased neural networks are applied to temporal classification of images of gene expression patterns, obtained by confocal scanning microscopy. The classification results confirmed the efficiency of this method for image recognition. It was shown that frequency domain of the representation of gene expression images is highly effective for their description.

Fuzzy Days – Application of the Neural Networks Based on Multivalued Neurons to Classification of the Images of Gene Expression Patterns
Computational Intelligence. Theory and Applications, 2001CoAuthors: Igor N. Aizenberg, Maria Samsonova, Ekaterina Myasnikova, John ReinitzAbstract:Multivalued neurons (MVN) are the neural processing elements with complexvalued weights and high functionality. It is possible to implement an Arbitrary Mapping described by partialdefined multiplevalued function on the single MVN. The MVNbased neural networks are applied to temporal classification of images of gene expression patterns, obtained by confocal scanning microscopy. The classification results confirmed the efficiency of this method for image recognition. It was shown that frequency domain of the representation of images is highly effective for their description.

Fuzzy Days – Multivalued and Universal Binary Neurons: New Applications in Intelligent Image Processing
Computational Intelligence. Theory and Applications, 2001CoAuthors: Igor N. AizenbergAbstract:Multivalued neurons (MVN) and universal binary neurons (UBN) are neural elements with complexvalued weights and high functionality. It is possible to implement the Arbitrary Mapping described by partially defined multiplevalued function on the single MVN and the Arbitrary Mapping described by Boolean function (which may not be threshold) on the single UBN. In this paper we consider some applications carried out using these wonderful features of MVN and UBN. Conception of cellular neural networks based on MVN and UBN becomes a base for nonlinear cellular neural filtering. Application of the corresponding filters for edge detection and solving of the superresolution problem are considered in the paper.
Divya Usha Sudhakaran – 3rd expert on this subject based on the ideXlab platform

Index Coded PSK Modulation for Prioritized Receivers
IEEE Transactions on Vehicular Technology, 2017CoAuthors: Divya Usha Sudhakaran, B. Sundar RajanAbstract:A noisy index coding problem (ICP) over additive white Gaussian noise (AWGN) and Rayleigh fading channels is studied. First, a singleinput singleoutput AWGN broadcast channel is considered. For a chosen index code and an Arbitrary Mapping (of broadcast vectors to phaseshift keying (PSK) signal points), a decision rule for the maximumlikelihood (ML) decoder is derived. The message error performance of a receiver at high signaltonoise ratio (SNR) is characterized by a parameter called PSKindex coding gain (PSKICG) . The PSKICG of a receiver is determined by a metric called minimum interset distance . For a given ICP with an order of priority among the receivers, and a chosen $2^N$ PSK constellation, an algorithm to find (index code, Mapping) pairs, each of which gives the best performance in terms of PSKICG of the receivers, is proposed. No other pair of index code (of length $N$ with $2^N$ broadcast vectors) and Mapping can give a better PSKICG for the highest priority receiver. Also, given that the highest priority receiver achieves its best performance, the next highest priority receiver achieves its maximum gain possible and so on in the specified order of priority. Next, the noisy ICP over a multipleinput multipleoutput (MIMO) Rayleigh fading channel is considered. The receivers are equipped with a single antenna and a server with two antennas. To obtain the diversity gain along with the coding gain, a MIMO scheme that employs spacetime coding along with index coded PSK modulation is proposed. For a chosen index code, an Arbitrary Mapping (of broadcast vectors to PSK signal points), and a $2 \times 1$ MIMO system employing Alamouti code, we derive a decision rule for the ML decoding. We show that for the best coding gain at high SNR, the Mapping must maximize the minimum interset distance.

GLOBECOM – AlamoutiIndexCoded PSK Modulation for Priority Ordered Receivers
GLOBECOM 2017 – 2017 IEEE Global Communications Conference, 2017CoAuthors: Divya Usha Sudhakaran, B. Sundar RajanAbstract:Noisy index coding problem over a Rayleigh fading channel is studied. The receivers are assumed to be priority ordered with each of them equipped with single antenna and the server with two antennas. To obtain diversity gain along with coding gain, a multipleinput multipleoutput (MIMO) scheme which employs space time coding along with index coded PSK modulation, is proposed. For a chosen index code, an Arbitrary Mapping (of broadcast vectors to PSK signal points) and a 2×1 MIMO system employing Alamouti code, a decision rule for the maximum likelihood (ML) decoding is derived. It is shown that, at very high SNR, the message error performance of the receiver employing ML decoder, depends on the metric called minimum interset distance, and for the best coding gain at high SNR, the Mapping must maximize the minimum interset distance.

Index Coded PSK Modulation for Prioritized Receivers
IEEE Transactions on Vehicular Technology, 2017CoAuthors: Divya Usha Sudhakaran, Sundar B. RajanAbstract:A noisy index coding problem (ICP) over additive white Gaussian noise (AWGN) and Rayleigh fading channels is studied. First, a singleinput singleoutput AWGN broadcast channel is considered. For a chosen index code and an Arbitrary Mapping (of broadcast vectors to phaseshift keying (PSK) signal points), a decision rule for the maximumlikelihood (ML) decoder is derived. The message error performance of a receiver at high signaltonoise ratio (SNR) is characterized by a parameter called PSKindex coding gain (PSKICG). The PSKICG of a receiver is determined by a metric called minimum interset distance. For a given ICP with an order of priority among the receivers, and a chosen 2NPSK constellation, an algorithm to find (index code, Mapping) pairs, each of which gives the best performance in terms of PSKICG of the receivers, is proposed. No other pair of index code (of length N with 2N broadcast vectors) and Mapping can give a better PSKICG for the highest priority receiver. Also, given that the highest priority receiver achieves its best performance, the next highest priority receiver achieves its maximum gain possible and so on in the specified order of priority. Next, the noisy ICP over a multipleinput multipleoutput (MIMO) Rayleigh fading channel is considered. The receivers are equipped with a single antenna and a server with two antennas. To obtain the diversity gain along with the coding gain, a MIMO scheme that employs spacetime coding along with index coded PSK modulation is proposed. For a chosen index code, an Arbitrary Mapping (of broadcast vectors to PSK signal points), and a 2 × 1 MIMO system employing Alamouti code, we derive a decision rule for the ML decoding. We show that for the best coding gain at high SNR, the Mapping must maximize the minimum interset distance.