A DFT-Based method (DBM) has been proposed to compensate for the performance degradation caused by clipping distortion at the expense of bandwidth expansion. On the other hand, in any communication systems, convention...
详细信息
A DFT-Based method (DBM) has been proposed to compensate for the performance degradation caused by clipping distortion at the expense of bandwidth expansion. On the other hand, in any communication systems, conventional channel coding methods can be employed to improve performance. In this letter, the performance of the DBM and the channel coding methods (CCM) are compared. Furthermore, we introduce a hybrid system which outperforms both the DBM and the CCM.
The development of sophisticated adaptive source coding algorithms together with inherent error sensitivity problems fostered the need for efficient space communication at very low bit error probilbilities (\leq 10^{-...
详细信息
The development of sophisticated adaptive source coding algorithms together with inherent error sensitivity problems fostered the need for efficient space communication at very low bit error probilbilities (\leq 10^{-6}) . This led to the specification and implementation of a concatenated coding system using an interleaved Reed-Solomon code as the outer code and a Viterbi-decoded convolutionai code as the inner code. This paper presents the experimental results of this channel coding system under an emulated S -band uplink and X -band downlink two-way space communication channel, where both uplink and downlink have strong carrier power. Test results verify that at a bit error probability of 10 -6 or less, this concatenated coding system does provide a coding gain of 2.5 dB or more over the viterbi-decoded convolutional-only coding system. These tests also show that a desirable interleaving depth for the Reed-Solomon outer code is 8 or more. The imptict of this "virtually" error-free space communication link on the transmission of images is discussed and examples of Simulation results are given.
In this study, the author investigates the practical limitation of the recently proposed embedded cryptographic signature authentication scheme at the physical layer. By employing the log-likelihood ratio of a tag bit...
详细信息
In this study, the author investigates the practical limitation of the recently proposed embedded cryptographic signature authentication scheme at the physical layer. By employing the log-likelihood ratio of a tag bit and its approximation, the author shows that the equivalent authentication channel observed by the secondary receiver can be viewed as a binary-input additive white Gaussian noise channel. Then, the sphere-packing lower bound can be employed to show the transmission capability for practical finite-length authentication tags. To achieve the same effective coverage area for both the primary and secondary receivers, it essentially requires efficient low-rate channel coding schemes with near sphere-packing-bound performance at the secondary receiver, which contrasts sharply with the pessimistic conclusion of Jiang et al.
Vehicle-to-everything (V2X) communications has gained a lot of interest in recent years and inevitably became part of the 5th-Generation New Radio (5G-NR) technologies, namely the sub-6GHz 5G and millimeter wave (mmWa...
详细信息
Imperfect spectrum sensing in overlay spectrum sharing may cause collision between primary and secondary transmission resulting in performance degradation for primary users. To satisfy the quality of service requireme...
详细信息
Imperfect spectrum sensing in overlay spectrum sharing may cause collision between primary and secondary transmission resulting in performance degradation for primary users. To satisfy the quality of service requirement imposed by the primary service, the maximum probability of collision has to be kept below a given threshold. The collision, if occurs, also results in increasing error rate in the secondary system. What can be done if the secondary service needs better error rate than the value imposed by the collision constraint in the primary network? From secondary user perspective, this can be taken care of by employing channel coding techniques at the expense of effective rate reduction. Alternatively, one can increase the sensing time to reduce the collision probability at the expense of reducing the data transmission time. This also reduces the effective data rate for secondary users. In this letter, we compare these two approaches and demonstrate a situation where using rate-compatible Low-Density Parity-Check codes, the effective data rate for the coded case can be significantly more than that of the case without channel coding while exhibiting a considerably better performance. We then discuss necessary condition for such an advantage and come up with cases where increasing sensing time is preferred over adopting channel coding.
A joint lossless-source and channel coding approach that incorporates error detection and correction capabilities in arithmetic coding is exploited. The encoded binary data representation allows the source decoder to ...
详细信息
A joint lossless-source and channel coding approach that incorporates error detection and correction capabilities in arithmetic coding is exploited. The encoded binary data representation allows the source decoder to recover the source symbols, even with channel errors. The self-synchronisation property of arithmetic coding, the knowledge of the source statistics, and some added redundancy are used for error detection and correction.
Segmentation is an important preprocessing step in many applications. Compared to colour segmentation, fusion of colour and depth greatly improves the segmentation result. Such a fusion is easy to do by stacking measu...
详细信息
Since the invention of turbo codes in 1993 there has been an enormous interest and progress in the field of capacity approaching code constructions. Many classical constructions have been replaced by newer, better per...
详细信息
Since the invention of turbo codes in 1993 there has been an enormous interest and progress in the field of capacity approaching code constructions. Many classical constructions have been replaced by newer, better performing codes with feasible decoding complexity. Most of these modern code constructions, such as turbo codes, Gallager's low-density parity-check (LDPC) codes and their generalizations, can be modeled by sparse graphical models. Spatial coupling of sparse graphical models has in the last years attracted a lot of interest due to the threshold saturation phenomenon, which leads to capacity achieving performance with iterative message passing decoding. Polar codes are a recently discovered class of capacity achieving codes that are formed by an explicit construction based on a phenomenon called channel polarization. These codes, too, have various low-complexity decoding algorithms based on message passing on a sparse graph that has a recursive structure similar to that of fast transforms in signal processing.
Advanced channel coding schemes have recently gained much interest due to their capacity-approaching behavior, rendering them a vital choice for many applications in commercial systems such as satellite standards and ...
详细信息
The susceptibility of arithmetic coding to errors is utilized for channel error recovery using an automatic repeat request (ARQ) scheme. The presented scheme optimizes the tradeoff between the redundancy added to over...
详细信息
The susceptibility of arithmetic coding to errors is utilized for channel error recovery using an automatic repeat request (ARQ) scheme. The presented scheme optimizes the tradeoff between the redundancy added to overcome channel errors and detection capability. With this approach, the type of error pattern introduced by the channel does not affect the receiver's detection capability. This scheme is suitable for transmitting long files over low bit error rate channels, and it provides the assurance of reconstructing the original data, free from catastrophic errors.
暂无评论