An approximately optimal adaptive arithmetic coding (AC) system using a forbidden symbol (FS) over noisy channels was proposed which allows one to jointly and adaptively design the source decoding and channel correcti...An approximately optimal adaptive arithmetic coding (AC) system using a forbidden symbol (FS) over noisy channels was proposed which allows one to jointly and adaptively design the source decoding and channel correcting in a single process, with superior performance compared with traditional separated techniques. The concept of adaptiveness is applied not only to the source model but also to the amount of coding redundancy. In addition, an improved branch metric computing algorithm and a faster sequential searching algorithm compared with the system proposed by Grangetto were proposed. The proposed system is tested in the case of image transmission over the AWGN channel, and compared with traditional separated system in terms of packet error rate and complexity. Both hard and soft decoding were taken into account.展开更多
We study the performances of quantum channel adaptive [4,1] code transmitting in a joint amplitude damping and dephasing channel, the [6,2] code transmitting in an amplitude damping channel by combining the encoding, ...We study the performances of quantum channel adaptive [4,1] code transmitting in a joint amplitude damping and dephasing channel, the [6,2] code transmitting in an amplitude damping channel by combining the encoding, noise process, and decoding as one effective channel. We explicitly obtain the entanglement fidelities. The recovery operators of the [6,2] code are given. The performance is nearly optimal compared with that of the optimal method of semidefinite programming.展开更多
In this paper, a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is effectively performed in the destinatio...In this paper, a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is effectively performed in the destination which is in accordance with the corresponding joint Tanner graph characterizing two different component LDPC codes used by the source and relay in ideal and non-ideal relay cooperations. The theoretical analysis and simulations show that the coded cooperation scheme obviously outperforms the coded non-cooperation one under the same code rate and decoding complex. The significant performance improvement can be virtually credited to the additional mutual exchange of the extrinsic information resulted by the LDPC code employed by the source and its counterpart used by the relay in both ideal and non-ideal cooperations.展开更多
Along with the proliferating research interest in semantic communication(Sem Com),joint source channel coding(JSCC)has dominated the attention due to the widely assumed existence in efficiently delivering information ...Along with the proliferating research interest in semantic communication(Sem Com),joint source channel coding(JSCC)has dominated the attention due to the widely assumed existence in efficiently delivering information semantics.Nevertheless,this paper challenges the conventional JSCC paradigm and advocates for adopting separate source channel coding(SSCC)to enjoy a more underlying degree of freedom for optimization.We demonstrate that SSCC,after leveraging the strengths of the Large Language Model(LLM)for source coding and Error Correction Code Transformer(ECCT)complemented for channel coding,offers superior performance over JSCC.Our proposed framework also effectively highlights the compatibility challenges between Sem Com approaches and digital communication systems,particularly concerning the resource costs associated with the transmission of high-precision floating point numbers.Through comprehensive evaluations,we establish that assisted by LLM-based compression and ECCT-enhanced error correction,SSCC remains a viable and effective solution for modern communication systems.In other words,separate source channel coding is still what we need.展开更多
Atmospheric absorption, scattering, and scintillation are the major causes to deteriorate the transmission quality of terahertz（THz） wireless communications. An error control coding scheme based on low density parit...Atmospheric absorption, scattering, and scintillation are the major causes to deteriorate the transmission quality of terahertz（THz） wireless communications. An error control coding scheme based on low density parity check（LDPC） codes with soft decision decoding algorithm is proposed to improve the bit-error-rate（BER） performance of an on-off keying（OOK） modulated THz signal through atmospheric channel. The THz wave propagation characteristics and channel model in atmosphere is set up. Numerical simulations validate the great performance of LDPC codes against the atmospheric fading and demonstrate the huge potential in future ultra-high speed beyond Gbps THz communications.展开更多
Soft decode-and-forward(DF) can combine the advantages of both amplify-and-forward and hard DF in relay channels. In this paper, we propose a low-complexity soft DF scheme based on polar codes, which features two key ...Soft decode-and-forward(DF) can combine the advantages of both amplify-and-forward and hard DF in relay channels. In this paper, we propose a low-complexity soft DF scheme based on polar codes, which features two key techniques: a low-complexity cyclic redundancy check(CRC) aided list successive cancellation(CALSC) decoder and a soft information calculation method. At the relay node, a low-complexity CALSC decoder is designed to reduce the computational complexity by adjusting the list size according to the reliabilities of decoded bits. Based on the path probability metric of the CALSC decoder, we propose a method to compute the soft information of the decoded bits in CALSC. Simulation results show that our proposed scheme outperforms the soft DF based on low-density parity-check codes and the soft DF with belief propagation or soft cancellation decoder, especially in the case when the source-relay channel is at the high signal-to-ratio region.展开更多
Many problems of discrete optimization are connected with partition of the n-dimensional space into certain subsets, and the requirements needed for these subsets can be geometrical—for instance, their sphericity—or...Many problems of discrete optimization are connected with partition of the n-dimensional space into certain subsets, and the requirements needed for these subsets can be geometrical—for instance, their sphericity—or they can be connected with?certain metrics—for instance, the requirement that subsets are Dirichlet’s regions with Hamming’s metrics [1]. Often partitions into some subsets are considered, on which a functional is optimized [2]. In the present work, the partitions of the n-dimensional space into subsets with “zero” limitation are considered. Such partitions allow us to construct the set of the group codes, V, and the set of the channels, A, between the arbitrary elements, V and A, having correcting relation between them. Descriptions of some classes of both perfect and imperfect codes in the additive channel are presented, too. A way of constructing of group codes correcting the errors in the additive channels is presented, and this method is a further generalization of Hamming’s method of code construction.展开更多
In the present work, the class of metrics connected with subsets of the linear space on the field, GF(2), is considered and a number of facts are established, which allow us to express the correcting capacity of codes...In the present work, the class of metrics connected with subsets of the linear space on the field, GF(2), is considered and a number of facts are established, which allow us to express the correcting capacity of codes for the additive channel in terms of this metrics. It is also considered a partition of the metric space, Bn, by means of D-representable codes. The equivalence of D-representable and the perfect codes in the additive channel is proved.展开更多
This paper proposes a closed-form joint space-time channel and Direction Of Arrival （DOA） blind estimation algorithm for space-thne coded Multi-Carrier Code Division Multiple Access （MC-CDMA） systems equipped with...This paper proposes a closed-form joint space-time channel and Direction Of Arrival （DOA） blind estimation algorithm for space-thne coded Multi-Carrier Code Division Multiple Access （MC-CDMA） systems equipped with a Uniform Linear Array （ULA） at the base station in frequency-selective fading environments. The algorithm uses an ESPRIT-like method to separate multiple co-channel users with different impinging DOAs. As a result, the DOAs for multiple users are obtained. In particular, a set of signal subspaces, every one of which is spanned by the space-time vector channels of an individual user, are also obtained. From these signal subspaces, the space-time channels of multiple users are estimated using the subspace method. Computer simulations illustrate both the validity and the overall performance of the proposed scheme.展开更多
In the present work, a construction making possible creation of an additive channel of cardinality s and rank r for arbitrary integers s, r, n (r≤min (n,s-1)), as well as creation of a code correcting err...In the present work, a construction making possible creation of an additive channel of cardinality s and rank r for arbitrary integers s, r, n (r≤min (n,s-1)), as well as creation of a code correcting errors of the channel A is presented.展开更多
Most of multimedia schemes employ variable-length codes （VLCs） like Huffman code as core components in obtaining high compression rates. However VLC methods are very sensitive to channel noise. The goal of this pape...Most of multimedia schemes employ variable-length codes （VLCs） like Huffman code as core components in obtaining high compression rates. However VLC methods are very sensitive to channel noise. The goal of this paper is to salvage as many data from the damaged packets as possible for higher audiovisual quality. This paper proposes an integrated joint source-channel decoder （I-JSCD） at a symbol-level using three-dimensional （3-D） trellis representation for first-order Markov sources encoded with VLC source code and convolutional channel code. This method combines source code and channel code state-spaces and bit-lengths to construct a two-dimensional （2-D） state-space, and then develops a 3-D trellis and a maximum a-posterior （MAP） algorithm to estimate the source sequence symbol by symbol. Experiment results demonstrate that our method results in significant improvement in decoding performance, it can salvage at least half of （50%） data in any channel error rate, and can provide additional error resilience to VLC stream like image, audio, video stream over high error rate links.展开更多
A multiuser Ultra Wide Band (UWB) channel suffers seriously from realistic impairments. Among this, multipath fading and interferences, such as Multiple Access Interference (MAI) and Inter Symbol Interference (ISI), t...A multiuser Ultra Wide Band (UWB) channel suffers seriously from realistic impairments. Among this, multipath fading and interferences, such as Multiple Access Interference (MAI) and Inter Symbol Interference (ISI), that significantly degrade the system performance. In this paper, a polar coding technique, originally developed by Arikan, is suggested to enhance the BER performance of indoor UWB based Orthogonal Frequency Division Multiplexing (OFDM) communications. Moreover, Interleave Division Multiple Access (IDMA) scheme has been considered for multiuser detection depending on the turbo type Chip-By-Chip (CBC) iterative detection strategy. Three different models as Symmetric Alpha Stable (SαS), Laplace model and Gaussian Mixture Model (GMM), have been introduced for approximating the interferences which are more realistic for UWB system. The performance of the proposed Polar-coded IDMA OFDM-based UWB system is investigated under UWB channel models proposed by IEEE 802.15.3a working group and compared with Low Density Parity Check (LDPC)-coded IDMA OFDM-based UWB system in terms of BER performance and complexity under the studied noise models. Simulation results show that the complexity of the proposed polar-coded system is much lower than LDPC-coded system with minor performance degradation. Furthermore, the proposed polar-coded system is robust against noise and interferences in UWB indoor environment and gains a significant performance improvement by about 5 dB compared with un-coded IDMA-OFDM-UWB system under the studied noise models.展开更多
The simplified joint channel estimation and symbol detection based on the EM (expectation-maximization) algorithm for space-time block code (STBC) are proposed. By assuming channel to be invariant within only one STBC...The simplified joint channel estimation and symbol detection based on the EM (expectation-maximization) algorithm for space-time block code (STBC) are proposed. By assuming channel to be invariant within only one STBC word and utilizing the orthogonal structure of STBC, the computational complexity and cost of this algorithm are both very low, so it is very suitable to implementation in real systems.展开更多
文摘An approximately optimal adaptive arithmetic coding (AC) system using a forbidden symbol (FS) over noisy channels was proposed which allows one to jointly and adaptively design the source decoding and channel correcting in a single process, with superior performance compared with traditional separated techniques. The concept of adaptiveness is applied not only to the source model but also to the amount of coding redundancy. In addition, an improved branch metric computing algorithm and a faster sequential searching algorithm compared with the system proposed by Grangetto were proposed. The proposed system is tested in the case of image transmission over the AWGN channel, and compared with traditional separated system in terms of packet error rate and complexity. Both hard and soft decoding were taken into account.
基金Project supported by the National Natural Science Foundation of China (Grant No. 60972071)the Natural Science Foundation of Zhejiang Province, China(Grant Nos. Y6100421 and LQ12F02012)the Zhejiang Province Science and Technology Project, China (Grant No. 2009C31060)
文摘We study the performances of quantum channel adaptive [4,1] code transmitting in a joint amplitude damping and dephasing channel, the [6,2] code transmitting in an amplitude damping channel by combining the encoding, noise process, and decoding as one effective channel. We explicitly obtain the entanglement fidelities. The recovery operators of the [6,2] code are given. The performance is nearly optimal compared with that of the optimal method of semidefinite programming.
基金Supported by the Open Research Fund of National Moblie Communications Research Laboratory of Southeast Uni-versity (No. W200704)
文摘In this paper, a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is effectively performed in the destination which is in accordance with the corresponding joint Tanner graph characterizing two different component LDPC codes used by the source and relay in ideal and non-ideal relay cooperations. The theoretical analysis and simulations show that the coded cooperation scheme obviously outperforms the coded non-cooperation one under the same code rate and decoding complex. The significant performance improvement can be virtually credited to the additional mutual exchange of the extrinsic information resulted by the LDPC code employed by the source and its counterpart used by the relay in both ideal and non-ideal cooperations.
基金supported in part by the National Key Research and Development Program of China under Grant No.2024YFE0200600the Zhejiang Provincial Natural Science Foundation of China under Grant No.LR23F010005the Huawei Cooperation Project under Grant No.TC20240829036。
文摘Along with the proliferating research interest in semantic communication(Sem Com),joint source channel coding(JSCC)has dominated the attention due to the widely assumed existence in efficiently delivering information semantics.Nevertheless,this paper challenges the conventional JSCC paradigm and advocates for adopting separate source channel coding(SSCC)to enjoy a more underlying degree of freedom for optimization.We demonstrate that SSCC,after leveraging the strengths of the Large Language Model(LLM)for source coding and Error Correction Code Transformer(ECCT)complemented for channel coding,offers superior performance over JSCC.Our proposed framework also effectively highlights the compatibility challenges between Sem Com approaches and digital communication systems,particularly concerning the resource costs associated with the transmission of high-precision floating point numbers.Through comprehensive evaluations,we establish that assisted by LLM-based compression and ECCT-enhanced error correction,SSCC remains a viable and effective solution for modern communication systems.In other words,separate source channel coding is still what we need.
基金Project supported by the National Key Basic Research Program of China(Grant No.2014CB339803)the National High Technology Research and Development Program of China(Grant No.2011AA010205)+4 种基金the National Natural Science Foundation of China(Grant Nos.61131006,61321492,and 61204135)the Major National Development Project of Scientific Instrument and Equipment(Grant No.2011YQ150021)the National Science and Technology Major Project(Grant No.2011ZX02707)the International Collaboration and Innovation Program on High Mobility Materials Engineering of the Chinese Academy of Sciencesthe Shanghai Municipal Commission of Science and Technology(Grant No.14530711300)
文摘Atmospheric absorption, scattering, and scintillation are the major causes to deteriorate the transmission quality of terahertz（THz） wireless communications. An error control coding scheme based on low density parity check（LDPC） codes with soft decision decoding algorithm is proposed to improve the bit-error-rate（BER） performance of an on-off keying（OOK） modulated THz signal through atmospheric channel. The THz wave propagation characteristics and channel model in atmosphere is set up. Numerical simulations validate the great performance of LDPC codes against the atmospheric fading and demonstrate the huge potential in future ultra-high speed beyond Gbps THz communications.
基金supported by the National Natural Science Foundation of China(No.61171099,No.61671080),Nokia Beijing Bell lab
文摘Soft decode-and-forward(DF) can combine the advantages of both amplify-and-forward and hard DF in relay channels. In this paper, we propose a low-complexity soft DF scheme based on polar codes, which features two key techniques: a low-complexity cyclic redundancy check(CRC) aided list successive cancellation(CALSC) decoder and a soft information calculation method. At the relay node, a low-complexity CALSC decoder is designed to reduce the computational complexity by adjusting the list size according to the reliabilities of decoded bits. Based on the path probability metric of the CALSC decoder, we propose a method to compute the soft information of the decoded bits in CALSC. Simulation results show that our proposed scheme outperforms the soft DF based on low-density parity-check codes and the soft DF with belief propagation or soft cancellation decoder, especially in the case when the source-relay channel is at the high signal-to-ratio region.
文摘Many problems of discrete optimization are connected with partition of the n-dimensional space into certain subsets, and the requirements needed for these subsets can be geometrical—for instance, their sphericity—or they can be connected with?certain metrics—for instance, the requirement that subsets are Dirichlet’s regions with Hamming’s metrics [1]. Often partitions into some subsets are considered, on which a functional is optimized [2]. In the present work, the partitions of the n-dimensional space into subsets with “zero” limitation are considered. Such partitions allow us to construct the set of the group codes, V, and the set of the channels, A, between the arbitrary elements, V and A, having correcting relation between them. Descriptions of some classes of both perfect and imperfect codes in the additive channel are presented, too. A way of constructing of group codes correcting the errors in the additive channels is presented, and this method is a further generalization of Hamming’s method of code construction.
文摘In the present work, the class of metrics connected with subsets of the linear space on the field, GF(2), is considered and a number of facts are established, which allow us to express the correcting capacity of codes for the additive channel in terms of this metrics. It is also considered a partition of the metric space, Bn, by means of D-representable codes. The equivalence of D-representable and the perfect codes in the additive channel is proved.
基金Partially supported by the National Natural Science Foundation of China (No.60272071)the Research Fund for Doctoral Program of Higher Education of China (No.20020698024 & 20030698027).
文摘This paper proposes a closed-form joint space-time channel and Direction Of Arrival （DOA） blind estimation algorithm for space-thne coded Multi-Carrier Code Division Multiple Access （MC-CDMA） systems equipped with a Uniform Linear Array （ULA） at the base station in frequency-selective fading environments. The algorithm uses an ESPRIT-like method to separate multiple co-channel users with different impinging DOAs. As a result, the DOAs for multiple users are obtained. In particular, a set of signal subspaces, every one of which is spanned by the space-time vector channels of an individual user, are also obtained. From these signal subspaces, the space-time channels of multiple users are estimated using the subspace method. Computer simulations illustrate both the validity and the overall performance of the proposed scheme.
文摘In the present work, a construction making possible creation of an additive channel of cardinality s and rank r for arbitrary integers s, r, n (r≤min (n,s-1)), as well as creation of a code correcting errors of the channel A is presented.
基金Supported by the Foundation of Ministry of Education of China (211CERS10)
文摘Most of multimedia schemes employ variable-length codes （VLCs） like Huffman code as core components in obtaining high compression rates. However VLC methods are very sensitive to channel noise. The goal of this paper is to salvage as many data from the damaged packets as possible for higher audiovisual quality. This paper proposes an integrated joint source-channel decoder （I-JSCD） at a symbol-level using three-dimensional （3-D） trellis representation for first-order Markov sources encoded with VLC source code and convolutional channel code. This method combines source code and channel code state-spaces and bit-lengths to construct a two-dimensional （2-D） state-space, and then develops a 3-D trellis and a maximum a-posterior （MAP） algorithm to estimate the source sequence symbol by symbol. Experiment results demonstrate that our method results in significant improvement in decoding performance, it can salvage at least half of （50%） data in any channel error rate, and can provide additional error resilience to VLC stream like image, audio, video stream over high error rate links.
文摘A multiuser Ultra Wide Band (UWB) channel suffers seriously from realistic impairments. Among this, multipath fading and interferences, such as Multiple Access Interference (MAI) and Inter Symbol Interference (ISI), that significantly degrade the system performance. In this paper, a polar coding technique, originally developed by Arikan, is suggested to enhance the BER performance of indoor UWB based Orthogonal Frequency Division Multiplexing (OFDM) communications. Moreover, Interleave Division Multiple Access (IDMA) scheme has been considered for multiuser detection depending on the turbo type Chip-By-Chip (CBC) iterative detection strategy. Three different models as Symmetric Alpha Stable (SαS), Laplace model and Gaussian Mixture Model (GMM), have been introduced for approximating the interferences which are more realistic for UWB system. The performance of the proposed Polar-coded IDMA OFDM-based UWB system is investigated under UWB channel models proposed by IEEE 802.15.3a working group and compared with Low Density Parity Check (LDPC)-coded IDMA OFDM-based UWB system in terms of BER performance and complexity under the studied noise models. Simulation results show that the complexity of the proposed polar-coded system is much lower than LDPC-coded system with minor performance degradation. Furthermore, the proposed polar-coded system is robust against noise and interferences in UWB indoor environment and gains a significant performance improvement by about 5 dB compared with un-coded IDMA-OFDM-UWB system under the studied noise models.
基金This project was supported by the National Natural Science Foundation of China (60272079).
文摘The simplified joint channel estimation and symbol detection based on the EM (expectation-maximization) algorithm for space-time block code (STBC) are proposed. By assuming channel to be invariant within only one STBC word and utilizing the orthogonal structure of STBC, the computational complexity and cost of this algorithm are both very low, so it is very suitable to implementation in real systems.
