1,720,960 research outputs found
Entanglement-assisted classical communication over quantum channels for binary Markov sources
No full textSymbol-based iterative decoding is proposed for the transmission of classical Markov source signals over a quantum channel using a three-stage serial concatenation of a convolutional code (CC), a unity-rate code and a two-qubit superdense (SD) protocol. A modified symbol-based maximum a posteriori algorithm is employed for CC decoding to exploit the Markov source statistics during the iterative decoding process. Extrinsic information transfer chart analysis is performed to evaluate the benefit of the extrinsic mutual information gleaned from the CC decoder for sources with different correlations. We evaluate the bit error rate performance of the proposed coding scheme and compare it to the relevant benchmark schemes, including the turbo coding-based SD scheme. We demonstrate that a near capacity performance can be achieved using the proposed scheme and when utilizing sources having a high correlation coefficient of \rho = 0.9, the proposed coding scheme performs within 0.53 dB from the entanglement-assisted classical capacity
Research Data: Distributed Joint Source Coding and Trellis Coded Modulation for Symbol-Based Markov Sources
No full textA distributed joint source-channel coding scheme
based on a unity-rate code (URC)-assisted trellis coded modulation
(TCM) is proposed, which exploits the spatio-temporal correlation
of symbol-based sources. More specifically, asymmetric distributed
source coding of two spatially correlated Markov sources
is considered, where one of the sources is assumed to be perfectly
decoded and to be available at the receiver of the other source
as side information. In order to exploit the temporal correlation
statistics, an iterative decoding process exchanging extrinsic
information between the amalgamated URC-assisted TCM and a
soft-symbol source decoder employing a modified symbol-based
maximum a posteriori algorithm is invoked. Furthermore, the
Slepian-Wolf (SW) bound of symbol-based sources having spatiotemporal
correlation is derived and the benefits of exploiting the
spatio-temporal correlation using the proposed coding scheme
are demonstrated by our extrinsic information transfer chart
analysis. It is shown from our simulation results that upon
exploiting the spatio-temporal correlation of the sources, the
proposed coding scheme is capable of operating within 0.02 bit
of the SW bound.</span
Distributed joint source coding and trellis coded modulation for symbol-based Markov sources
No full textA distributed joint source-channel coding scheme based on a unity-rate code (URC)-assisted trellis coded modulation (TCM) is proposed, which exploits the spatio-temporal correlation of symbol-based sources. More specifically, asymmetric distributed source coding of two spatially correlated Markov sources is considered, where one of the sources is assumed to be perfectly decoded and to be available at the receiver of the other source as side information. In order to exploit the temporal correlation statistics, an iterative decoding process exchanging extrinsic information between the amalgamated URC-assisted TCM and a soft-symbol source decoder employing a modified symbol-based maximum aposteriori algorithm is invoked. Furthermore, the Slepian-Wolf (SW) bound of symbol-based sources having spatio-temporal correlation is derived and the benefits of exploiting the spatio-temporal correlation using the proposed coding scheme are demonstrated by our extrinsic information transfer chart analysis. It is shown from our simulation results that upon exploiting the spatio-temporal correlation of the sources, the proposed coding scheme is capable of operating within 0.02 bit of the SW bound
Research Data: Entanglement-Assisted Classical Communication Over Quantum Channels for Binary Markov Sources
No full textDataset supports:
Izhar, A., Babar, Z., Ng, S., & Hanzo, L. (2017). Entanglement-Assisted Classical Communication Over Quantum Channels for Binary Markov Sources. IEEE Transactions on Vehicular Technology.
Symbol-based iterative decoding is proposed for the transmission of classical Markov source signals over a quantum channel using a three-stage serial concatenation of a convolutional code (CC), a unity-rate code and a two-qubit superdense (SD) protocol. A modified symbol-based maximum a posteriori algorithm is employed for CC decoding to exploit the Markov source statistics during the iterative decoding process. Extrinsic information transfer chart analysis is performed to evaluate the benefit of the extrinsic mutual information gleaned from the CC decoder for sources with different correlations. We evaluate the bit error rate performance of the proposed coding scheme and compare it to the relevant benchmark schemes, including the turbo coding-based SD scheme. We demonstrate that a near capacity performance can be achieved using the proposed scheme and when utilizing sources having a high correlation coefficient of \rho = 0.9, the proposed coding scheme performs within 0.53 dB from the entanglement-assisted classical capacity.</span
Research Data: Towards the Quantum Internet: Generalised Quantum Network Coding for Large-scale Quantum Communication Networks
No full textResearch Data for paper: Towards the Quantum Internet: Generalised Quantum Network Coding for Large-scale Quantum Communication Networks </span
Research Data: Unary-Coded Dimming Control Improves ON-OFF Keying Visible Light Communication
No full textAn ideal Visible Light Communication (VLC) system should facilitate reliable data transmission at high throughputs, while also providing flicker-free illumination at the user-defined dimming level. In this spirit, we conceive a unary code aided dimming scheme for On-Off Keying (OOK) modulated VLC systems. The proposed unary-coded scheme facilitates joint dimming and throughput control, while relying on iterative decoding. It is demonstrated that the proposed unary-coded dimming scheme provides attractive throughput gains over its contemporaries and it is also capable of approaching the theoretical throughput limit. Furthermore, we design novel joint dimming-Forward Error Correction (FEC) coding schemes, which significantly outperform their compensation time dimming based counterparts in terms of the attainable Bit Error Rate (BER) performance as well as the throughput. Finally, in the quest for approaching the capacity, we also optimize our system using EXtrinsic Information Transfer (EXIT) charts and demonstrate an SNR-gain of upto 6 dB over the compensation time dimming based classic benchmarker.</span
Towards the quantum internet: Generalised quantum network coding for large-scale quantum communication networks
No full textLarge-scale Quantum Network Coding (LQNC) is conceived for distributing entangled qubits over large-scale quantum communication networks supporting both teleportation and Quantum Key Distribution (QKD). More specifically, the LQNC is characterised by detailing the encoding and decoding process for distributing entangled pairs of qubits to M pairs of source-and-target users connected via a backbone route of N hops. The LQNC-based system advocated is then compared to Entanglement Swapping (ES) based systems for highlighting the benefits of the proposed LQNC
Unary-coded dimming control improves ON-OFF keying visible light communication
No full textAn ideal Visible Light Communication (VLC) system should facilitate reliable data transmission at high throughputs, while also providing flicker-free illumination at the user-defined dimming level. In this spirit, we conceive a unary code aided dimming scheme for On-Off Keying (OOK) modulated VLC systems. The proposed unary-coded scheme facilitates joint dimming and throughput control, while relying on iterative decoding. It is demonstrated that the proposed unary-coded dimming scheme provides attractive throughput gains over its contemporaries and it is also capable of approaching the theoretical throughput limit. Furthermore, we design novel joint dimming-Forward Error Correction (FEC) coding schemes, which significantly outperform their compensation time dimming based counterparts in terms of the attainable Bit Error Rate (BER) performance as well as the throughput. Finally, in the quest for approaching the capacity, we also optimize our system using EXtrinsic Information Transfer (EXIT) charts and demonstrate an SNR-gain of up to 6 dB over the compensation time dimming based classic benchmarker
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
- …
