The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Bayesian network is a probability, which is based on a probabilistic inference network of graphical and Bayesian formula is the basis of the probability of network. The paper analyzes general Semantic pixel naming and the implementation process and concept of Bayesian per pixel segmentation (BPPS). On this basis, author presents a novel deep learning framework for clustering and information mining...
Trajectories obtained from low level tracking algorithm provide an opportunity for us to analyze meaningful behaviors and monitor adverse or malicious events. How to abstract meaningful features from the raw data of trajectories is a challenge due to the high dimensionality and noise. In this paper, a novel approach, stacked denoising autoencoder(SDA) is applied to address this problem. This method...
Analog error correction allows discrete-time continuous-alphabet signals to be protected against channel impairment without the need for a digital representation or digital circuit. This is a powerful way to distribute the representation of an analog value across multiple wires or multiple devices in a manner similar to how digital representations distribute bits across multiple wires and devices...
In this paper fractal encoding of images using the wavelet transform is proposed. Fractal encoding is used to produce an image with good visual quality in less encoding time. Quadtree partitioning is applied iteratively during encoding, and fractal coding is executed for JPEG, PNG and BMP HD images in two conditions: by supplying the noise to the input image and without any noise added to the input...
The Cognitive Multiple Access Z-Interference Channel consists of a MAC channel that receives interference from an external transmitter. In a previous work we studied this model where both MAC users are cognitive and showed that an encoding scheme based on Dirty Paper coding attains the capacity region for the Gaussian case. In this work we assume that only one MAC user is cognitive and show that the...
We consider a sensor scheduling and remote estimation problem with one sensor and one estimator. At each time step, the sensor makes an observation on the state of a source, and then decides whether to transmit its observation to the estimator or not. The sensor is charged a cost for each transmission. The remote estimator generates a real-time estimate on the state of the source based on the messages...
This paper considers an interference-aware user selection and resource allocation for uplink multiuser multiple-input multiple-output (MU-MIMO) systems. At the base station (BS), zero-forcing (ZF) with singular value decomposition (SVD) decoupling of spatial streams is deployed. First, two algorithms are developed for mobile stations (MS)s and their corresponding antennas assignment as well as power...
G.fast is the most recent ITU-T standard for copper-based transmission, which targets at short distances and adopts a bandwidth of 106 MHz extensible to 212 MHz. In several scenarios G.fast systems will be composed by or coexist with uncoordinated lines, which are sources of strong crosstalk. This work focuses on evaluating an alien (out-of-domain) crosstalk mitigation method based on noise prediction...
This paper proposes a novel nonbinary concatenated coding system with nonbinary Reed-Solomon (RS) inner codes and a nonbinary convolutional outer code for Narrowband Power Line Channel (NB-PLC). This channel is modeled with a “Middleton A” impulsive noise and an AWGN noise. With this structure, the inner decoder will correct random and short burst errors while the outer decoder will correct much longer...
The article discusses the use of error-correcting codes and methods of their decoding and also analysis of the use of different depths of interleaving for modeling concatenated codes.
In wireless video broadcast system, analog joint source-channel coding (JSCC) has shown advantage compared to conventional separate digital source/channel coding in the aspect that it can avoid cliff effect gracefully. What's more, analog JSCC only needs a little calculations at the encoder and has strong adaptability to different channel condition, which is very suitable to the wireless cooperative...
We study the optimization of analog joint source-channel coding schemes based on non-linear mappings for the transmission of independent Gaussian messages over the two user Gaussian Broadcast Channel (GBC). We focus on a low complexity, low delay, analog joint source channel coding communication system based on extensions of existing Nested Quantization techniques. A procedure to optimize the decoding...
The article is devoted to the instrumental means of the design of video data link, which are mounted on board the aircraft. The information concerning the possibilities of the program model use for the choice of the basic hosts and image translation options via physical "channel with gaps" is given in the article.
In this paper, we tackle the compressive phase retrieval problem in the presence of noise. The noisy compressive phase retrieval problem is to recover a K-sparse complex signal s ∈ ℂn, from a set of m noisy quadratic measurements: yi = |aiHs|2 + wi; where aiH ∈ ℂn is the ith row of the measurement matrix A ∈ ℂm×n, and wi is the additive noise to the ith measurement. We consider the regime where K...
A single-input multiple-output (SIMO) multiple access channel with a large number of uncoded non-cooperating single antenna transmitters and joint processing at a finite precision multi-antenna receiver is considered. We fix the number of receiver antennas per transmitter and investigate the effects of receiver quantization on the recovery of the transmitted signals in the asymptotic limit of a large...
This paper investigates two classes of relay channels, the Gaussian relay channel and the Gaussian two-way relay channel, when additive noises at the relay and destination(s) are correlated. Lattice codes are used to achieve the rate region for Compress-and-Forward (relay channel) and Compress/Decode-and-Forward (two-way relay channel). Numerical calculations show that there exist particular values...
Optimal signaling is studied over a power-limited Gaussian channel with intermittent feedback, where a random mechanism—whose outcome is unknown to the receiver—determines whether or not the output symbol is fed back to the encoder. If the output symbols are fed back with probability smaller than one half, then even the two-messages error probability cannot decay faster than exponentially in the blocklength...
Sparse superposition codes were recently introduced by Barron and Joseph for reliable communication over the AWGN channel at rates approaching the channel capacity. In this code, the codewords are sparse linear combinations of columns of a design matrix. In this paper, we propose an approximate message passing decoder for sparse superposition codes. The complexity of the decoder scales linearly with...
In this paper, we provide an efficient way to predict iterative belief propagation (BP) decoding thresholds of randomly punctured low-density parity-check (LDPC) code ensembles on the binary-input additive white Gaussian noise channel (AWGNC), given only the BP threshold of the mother code ensemble on the binary erasure channel (BEC) and the code design rate. We show that the predictions are accurate...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.