Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
We consider the joint source-channel coding (JSCC) problem where the real valued outputs of two correlated memoryless Gaussian sources are scalar quantized, bit assigned, and transmitted, without applying any error correcting code, over a multiple access channel (MAC) which consists of two orthogonal point-to- point time-correlated Rayleigh fading sub-channels with soft- decision demodulation. At...
Considering the fact that when the signal-to-noise ratio (SNR) is less than a certain threshold, the bit error rate (BER) performance of joint source-channel decoding (JSCD) will become more vulnerable to channel noise. To further improve the performance of JSCD, a practical and efficient algorithm, named joint iterative source-channel decoding (JISCD), is proposed in this paper, in which the performance...
In this paper, we present an extension of the semi-definite programming formulation of the optimal rate code design in single link Binary Erasure Channel (BEC) proposed by the authors to the Binary Erasure Multiple Access Channel (BE-MAC) with two sources correlation. This new way can be easily extended to the multiple access senders. Simulation results show the efficiency and effectiveness of the...
In order to support high data rate communications, the third generation partnership project (3GPP) long term evolution (LTE) implements multiple-input multiple-output (MIMO) systems. In addition, to achieve excellent performance, LTE also employs turbo codes as the forward error correcting (FEC) standard. Although conventional turbo codes give satisfactory performance in the ideal MIMO, significant...
This paper considers the model that two mobile users communicate with a central processer (CP) via two base stations (BSs). The BSs are connected to the CP via orthogonal finite-capacity links. The theoretical capacity of this model is still an open problem. For given capacity of backhaul links, we use private message, common message and joint decoding message to explore a new achievable rate. We...
Surface Electromyography (EMG) is popularly used to decode human motion intention for robot movement control. Traditional motion decoding method uses pattern recognition to provide binary control command which can only move the robot as predefined limited patterns. In this work, we proposed a motion decoding method which can accurately estimate 3-dimensional (3-D) continuous upper limb motion only...
We consider a two-user discrete memoryless multiple access channel with a common stop-feedback signal from the receiver to both transmitters. The achievable regions are characterized using joint decoding and successive cancellation decoding and, it is shown that the achievable regions are significantly larger for variable-length stop-feedback codes compared to fixed-blocklength codes. This is analogous...
Electrocorticogram (ECoG) is a promising long-term signal acquisition platform for brain-computer interface (BCI) systems such as upper extremity prostheses. Several studies have demonstrated decoding of arm and finger trajectories from ECoG high-gamma band (80–160 Hz) signals. In this study, we systematically vary the velocity of three elementary movement types (pincer grasp, elbow and shoulder flexion/extension)...
Capacity-achieving polar codes have received significant attention in past few years. These codes can be decoded using either the successive-cancellation (SC) approach or the belief propagation (BP) approach. Several VLSI architectures of SC polar decoders have been reported in the literature. However, SC decoders suffer from long latency and low throughput due to their sequential decoding nature...
In this paper, an improved soft in soft out (SISO) iterative decoding scheme for joint source-channel coding is presented. It is realized as the iterative soft decoding of arithmetic code based on sequential decoding to successively prune the decoding tree. Making use of the forecasted forbidden symbols, an error-resistant arithmetic code with an improved a posteriori probability (APP) metric is adopted...
In this paper, we study the problem of secret communication over a Compound Multiple Access Channel (MAC). In this channel, we assume that one of the transmitted messages is confidential that is only decoded by its corresponding receiver and kept secret from the other receiver. For this proposed setting (compound MAC with confidential messages), we derive general inner and outer bounds on the secrecy...
We present a novel decoding scheme for slotted ALOHA which is based on concepts from physical-layer network coding (PNC) and multi-user detection (MUD). In addition to recovering individual user packets from a packet collision as it is usually done with MUD, the receiver applies PNC to decode packet combinations that can be used to retrieve the original packets using information available from other...
We propose an efficient soft iterative decoding scheme with early termination algorithm for raptor codes. In the proposed scheme, the performance is enhanced by adopting iterative decoding, both in each inner and outer code and in the concatenated code itself between the inner and outer codes. At the same time, the complexity is reduced by applying an efficient early termination algorithm. Simulation...
In this paper, we consider the secrecy of the one-receiver, two-eavesdropper Broadcast Channel (BC) with three degraded message sets. There is a three-receiver BC where the common message is decoded by all receivers. The first confidential message is decoded by the first and the second receivers and is kept secret from the third receiver (eavesdropper). The second confidential message is decoded by...
In zero-delay joint source-channel coding each source sample is mapped to a channel input, and the samples are directly estimated at the receiver based on the corresponding channel output. Despite its simplicity, uncoded transmission achieves the optimal end-to-end distortion performance in some communication scenarios, significantly simplifying the encoding and decoding operations, and reducing the...
In the presence of co-channel interference in cellular networks, interference mitigation by detecting the desired signal jointly with the interference promises considerable gain over the conventional way of handling the interference as colored Gaussian. Even though such interference-aware detection can improve the performance, it requires some information on the interference. In particular, the modulation...
The physical layer network coding (PNC) technique exploits the broadcast nature of wireless channels to obtain additional transmission efficiency gains. In this paper, the authors first find and prove that: if we rotate the modulation constellations of multiple sources by proper angles, the points of the equivalent superpositioned constellation at the receiver would cluster into clouds, with each...
We propose a three-message superposition coding scheme in a cognitive radio relay network exploiting active cooperation between primary and secondary networks. The time resource is split into three transmission phases. The first two phases are dedicated to primary communication, while the third phase is for the secondary's transmission. We formulate a throughput maximization problem for the secondary...
In most communication systems, being able to adapt the error protection strength of the physical layer is essential to ensure the functionality of the system in potentially strongly varying conditions. Traditional forward error correction code design focuses on the optimization of codes with a fixed code rate for a worst-case channel condition. So-called rate-compatible codes, on the other hand, are...
In this paper, a scheme based on 1-D nested lattice quantization followed by multi-level distributed arithmetic coding (MLDAC) as the Slepian-Wolf (SW) code is proposed for the lossy source coding of continuous sources. This system can be employed in distributed video and image coding applications. The output of the quantizer is first converted to binary, and then the SW coding is applied on each...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.