1,721,261 research outputs found
Generalized low-density parity-check codes
No full textAn evolution of Gallager's Low-Density Parity-Check (LDPC) codes was first introduced by Tanner in 1981, namely Generalized Low-Density Parity-Check (GLDPC) codes, and then further developed by Boutros et at. as well as by Lentmaier and Zigangirov. It has been shown that Hamming-code based GLDPC codes are asymptotically good in the sense of minimum distance and exhibit an excellent performance over both AWGN and Rayleigh channels. Because of the regular parallel structure of the GLDPC decoder, it is amenable to systolic array based practical integrated circuit (IC) implementations. This thesis is devoted to the characterization of iterative symbol based hard decision aided decoding algorithm designed for GLDPC codes constructed over GF(q). We proposed a novel symbol-flipping based decoding algorithm, designed for GLDPC codes defined over non-binary Galois fields using RS constituent codes. Seven vote rules were proposed and the suggested optimal voting rule was deemed to be E = 3, V = 0, and e = F = 1.5 where larger values indicates unreliable symbols and smaller values indicates more reliable symbols. It was demonstrated by our simulations that our symbol-flipping decoding algorithm can be success fully used for decoding nonbinary GLDPC codes constructed from RS constituent codes. The simulation results also demonstrated that GLDPC codes defined over GF(q) have the potential of outperforming similar-rate binary constituent codes.</p
Probe-Aided MulTCP: An aggregate congestion control mechanism
No full textAn aggregate congestion control mechanism, namely Probe-Aided MulTCP (PA-MulTCP), is proposed in this paper. It is based on MulTCP, a proposal for enabling an aggregate to emulate the behavior of multiple concurrent TCP connections. The objective of PA-MulTCP is to ensure the fair sharing of the bottleneck bandwidth between the aggregate and other TCP or TCP-friendly flows while keeping lightweightness and responsiveness. Unlike MulTCP, there are two congestion window loops in PA-MulTCP, namely the probe window loop and the adjusting window loop. The probe window loop constantly probes the congestion situation and the adjusting window loop dynamically adjusts the congestion window size for the arriving and departing flows within the aggregate. Our simulations demonstrate that PA-MulTCP is more stable and fairer than MulTCP over a wide range of the weight N in steady conditions as well as in varying congestion conditions. PA-MulTCP is also responsive to flow arrival/departure and thus reduces the latency of short-lived transfers. Furthermore, PA-MulTCP is lightweight, since it enjoys above advantages at the cost of only an extra probe window loop, which has a marginal influence on the implementation complexity. Finally, the design of PA-MulTCP decouples the congestion management from the other functionalities in the aggregate flow management. As a result, PA-MulTCP could be potentially applied to a wider range of scenarios, e. g. wireless TCP proxies, edge-to-edge overlays, QoS provisioning and mass data transport
Probe-Aided MulTCP: An aggregate congestion control mechanism
No full textAn aggregate congestion control mechanism, namely Probe-Aided MulTCP (PA-MulTCP), is proposed in this paper. It is based on MulTCP, a proposal for enabling an aggregate to emulate the behavior of multiple concurrent TCP connections. The objective of PA-MulTCP is to ensure the fair sharing of the bottleneck bandwidth between the aggregate and other TCP or TCP-friendly flows while keeping lightweightness and responsiveness. Unlike MulTCP, there are two congestion window loops in PA-MulTCP, namely the probe window loop and the adjusting window loop. The probe window loop constantly probes the congestion situation and the adjusting window loop dynamically adjusts the congestion window size for the arriving and departing flows within the aggregate. Our simulations demonstrate that PA-MulTCP is more stable and fairer than MulTCP over a wide range of the weight N in steady conditions as well as in varying congestion conditions. PA-MulTCP is also responsive to flow arrival/departure and thus reduces the latency of short-lived transfers. Furthermore, PA-MulTCP is lightweight, since it enjoys above advantages at the cost of only an extra probe window loop, which has a marginal influence on the implementation complexity. Finally, the design of PA-MulTCP decouples the congestion management from the other functionalities in the aggregate flow management. As a result, PA-MulTCP could be potentially applied to a wider range of scenarios, e. g. wireless TCP proxies, edge-to-edge overlays, QoS provisioning and mass data transport
sj-docx-1-jaf-10.1177_0148558X231167461 – Supplemental material for Does Financial Statement Line-Item Comparability Affect Analysts’ Forecasts?
No full textSupplemental material, sj-docx-1-jaf-10.1177_0148558X231167461 for Does Financial Statement Line-Item Comparability Affect Analysts’ Forecasts? by Elaine Henry, Fang-Chun Liu, Steve Yang and Xiaodi Zhu in Journal of Accounting, Auditing & Finance</p
Analysis of stability robustness for generalized state-space systems with structured perturbations
No full text
A connection between state-space and doubly coprime matrix-fraction descriptions of multivariable systems
No full text
- …
