The Experts below are selected from a list of 7854 Experts worldwide ranked by ideXlab platform
K.a. Hamdi - One of the best experts on this subject based on the ideXlab platform.
-
Hit statistics in FH-CDMA unslotted Packet Networks
IEEE Transactions on Information Theory, 2003Co-Authors: K.a. HamdiAbstract:This correspondence is concerned with the statistical dependence of hits due to multiple-access interference in the time-unslotted frequency-hopping (FH) Packet Networks. Relying on the technique of joint probability generating functions (PGFs), we give a formal proof that if the ratio of the number of interfering Packets to the number of frequency slots K/q is held constant, hits due to multiple-access interference are asymptotically independent as q/spl rarr//spl infin/. We also derive expressions for the correlation coefficients of hits in the Packet.
-
Packet-error probability analysis for FH-CDMA unslotted Packet Networks
IEEE Transactions on Communications, 2003Co-Authors: K.a. HamdiAbstract:This letter is concerned with the interference analysis in time-unslotted frequency-hopping code-division multiple-access Packet Networks with error control coding. We derive, under the conditional independence assumption, a new exact closed-form expression for the Packet error probability of a reference Packet in the presence of other K interfering Packets. In contrast to the previously known results, the computational complexity of the new result is independent of K. We also develop a new tight upper bound on Packet error probability relying on mapping the unslotted system into an equivalent slotted one experiencing the same level of short-term average interference. The accuracy of the proposed approximation is demonstrated by some numerical examples and is shown to be tighter than the previously used results.
Kenneth Rose - One of the best experts on this subject based on the ideXlab platform.
-
Multistage vector quantizer optimization for Packet Networks
IEEE Transactions on Signal Processing, 2003Co-Authors: H. Khalil, Kenneth RoseAbstract:A multistage vector quantizer (MSVQ) based coding system is source-channel optimized for Packet Networks. Resilience to Packet loss is enhanced by a proposed interleaving approach that ensures that a single lost Packet only eliminates a subset of the vector stages. The design is optimized while taking into account compression efficiency, Packet loss rate, and the interleaving technique in use. The new source-channel-optimized MSVQ is tested on memoryless speech line spectral frequency (LSF) parameter quantization as well as block-based image compression. With LSF coding, a source-channel-optimized MSVQ is shown to yield gains of up to 2.0 dB in signal-to-ratio (SNR) over traditional MSVQ and to substantially enhance the robustness of Packetized speech transmission. Substantial gains were also obtained in the case of block-based image compression. Although the formulation is given in the context of Packet Networks, the work is directly extendible to the broader category of erasure channels.
-
ICIP - Multi-stage vector quantizer design for image transmission over Packet Networks
Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101), 2000Co-Authors: H. Khalil, Kenneth RoseAbstract:The design of a source-channel system based on the multi-stage vector quantizer (MSVQ) is optimized for Packet Networks. Resilience to Packet loss is further enhanced by a proposed interleaving scheme that ensures that a single lost Packet only eliminates a subset of the vector stages. The design is optimized while taking into account compression efficiency, Packet loss rate, and the interleaving technique in use. Simulation results demonstrate that the Packet network-optimized MSVQ outperforms traditional MSVQ for a variety of images and channel conditions, with gains of up to 2.0 dB in PSNR. Although the formulation is given in the context of Packet Networks, the work is directly extendible to the broader category of erasure channels.
-
MSVQ design for Packet Networks with application to LSF quantization
2000 IEEE International Conference on Acoustics Speech and Signal Processing. Proceedings (Cat. No.00CH37100), 2000Co-Authors: H. Khalil, Kenneth RoseAbstract:The design of a multi-stage vector quantizer (MSVQ) based source-channel coding system is optimized for Packet Networks. Resilience to Packet loss is further enhanced by a proposed interleaving approach that ensures that a single lost Packet only eliminates a subset of the vector stages. The design is optimized while taking into account compression efficiency, Packet loss rate, and the interleaving technique in use. The new source-channel-optimized MSVQ is tested on memoryless line spectral frequency (LSF) parameter quantization in speech coders. A source-channel-optimization MSVQ is shown to yield a gain of up to 2.0 dB in SNR, for coding the LSFs, over traditional MSVQ and to substantially enhance the robustness of Packetized speech transmission. Although the formulation is given in the context of Packet Networks, the work is directly extendible to the broader category of erasure channels.
-
ICASSP - MSVQ design for Packet Networks with application to LSF quantization
2000 IEEE International Conference on Acoustics Speech and Signal Processing. Proceedings (Cat. No.00CH37100), 2000Co-Authors: H. Khalil, Kenneth RoseAbstract:The design of a multi-stage vector quantizer (MSVQ) based source-channel coding system is optimized for Packet Networks. Resilience to Packet loss is further enhanced by a proposed interleaving approach that ensures that a single lost Packet only eliminates a subset of the vector stages. The design is optimized while taking into account compression efficiency, Packet loss rate, and the interleaving technique in use. The new source-channel-optimized MSVQ is tested on memoryless line spectral frequency (LSF) parameter quantization in speech coders. A source-channel-optimization MSVQ is shown to yield a gain of up to 2.0 dB in SNR, for coding the LSFs, over traditional MSVQ and to substantially enhance the robustness of Packetized speech transmission. Although the formulation is given in the context of Packet Networks, the work is directly extendible to the broader category of erasure channels.
-
Multi-stage vector quantizer design for image transmission over Packet Networks
Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101), 2000Co-Authors: H. Khalil, Kenneth RoseAbstract:The design of a source-channel system based on the multi-stage vector quantizer (MSVQ) is optimized for Packet Networks. Resilience to Packet loss is further enhanced by a proposed interleaving scheme that ensures that a single lost Packet only eliminates a subset of the vector stages. The design is optimized while taking into account compression efficiency, Packet loss rate, and the interleaving technique in use. Simulation results demonstrate that the Packet network-optimized MSVQ outperforms traditional MSVQ for a variety of images and channel conditions, with gains of up to 2.0 dB in PSNR. Although the formulation is given in the context of Packet Networks, the work is directly extendible to the broader category of erasure channels.
Lei Zhang - One of the best experts on this subject based on the ideXlab platform.
-
ICYCS - Throughput Bounds of Unslotted CDMA Packet Networks
2008 The 9th International Conference for Young Computer Scientists, 2008Co-Authors: Xiaoding Liao, Lei ZhangAbstract:In this paper, the lower and upper bound of throughput of unslotted CDMA Packet Networks are considered. A theoretical model for describing multiple access interference (MAI) in unslotted CDMA Packet Networks is presented, and a novel recursive method for throughput analysis is proposed. Then the lower and upper bound of the throughput are analyzed, respectively. Moreover, the impact of spreading gain on throughput performance is discussed.
-
Throughput Bounds of Unslotted CDMA Packet Networks
2008 The 9th International Conference for Young Computer Scientists, 2008Co-Authors: Xiaoding Liao, Lei ZhangAbstract:In this paper, the lower and upper bound of throughput of unslotted CDMA Packet Networks are considered. A theoretical model for describing multiple access interference (MAI) in unslotted CDMA Packet Networks is presented, and a novel recursive method for throughput analysis is proposed. Then the lower and upper bound of the throughput are analyzed, respectively. Moreover, the impact of spreading gain on throughput performance is discussed.
Z. Q. He - One of the best experts on this subject based on the ideXlab platform.
-
Random Linear Coding for File Sharing in Upload-Limited Wireless Packet Networks
2007 IEEE 66th Vehicular Technology Conference, 2007Co-Authors: J. Y. Wang, G. Yang, Z. Q. HeAbstract:Random Linear Coding (RLC) [2] is a form of network coding where each network node, rather than forwarding Packets unchanged along the path from source-to-destination, forwards random linear combinations of the data it has received. In this paper, the benefits of using Random Linear Coding(RLC) for data sharing in upload-limited wireless Packet Networks is investigated. Through simulations, we demonstrate the number of nodes that can share a data file increases with RLC compared to that with routing only. Especially, when the wireless connections experience high loss rates and (or) the limit of upload is small, RLC together with placing more resource nodes can be a very efficient method to improve the ratio of successful download.
S J Golestani - One of the best experts on this subject based on the ideXlab platform.
-
duration limited statistical multiplexing of delay sensitive traffic in Packet Networks
International Conference on Computer Communications, 1991Co-Authors: S J GolestaniAbstract:A novel strategy for the transmission and multiplexing of delay-sensitive traffic, e.g., voice and video, in Packet Networks is described. The strategy provides bounded end-to-end delay to all delay-sensitive traffic guarantees loss-free transmission to any traffic with such a requirement. To achieve statistical multiplexing gain, loss performance is provided to the rest of delay-sensitive traffic on an as-needed basis, with possible distinction among different classes. Bounded end-to-end delay is obtained by performing statistical multiplexing at the switching nodes on a duration-limited basis. Loss-free transmission is achieved by means of an underlying service discipline called stop-and-go queuing. The performance of the strategy for some special cases is analyzed, and analytical expressions for the loss probability are derived. >
-
Congestion-free communication in high-speed Packet Networks
IEEE Transactions on Communications, 1991Co-Authors: S J GolestaniAbstract:The process of Packet clustering in a network with well-regulated input traffic is studied and a strategy for congestion-free communication in Packet Networks is proposed. The strategy provides guaranteed services per connection with no Packet loss and an end-to-end delay which is a constant plus a small bounded jitter term. It is composed of an admission policy imposed per connection at the source node, and a particular queuing scheme practiced at the switching nodes, which is called stop-and-go queuing. The admission policy requires the Packet stream of each connection to possess a certain smoothness property upon arrival at the network. This is equivalent to a peak bandwidth allocation per connection. The queuing scheme eliminates the process of Packet clustering and thereby preserves the smoothness property as Packets travel inside the network. Implementation is simple.
-
congestion free transmission of real time traffic in Packet Networks
International Conference on Computer Communications, 1990Co-Authors: S J GolestaniAbstract:The process of Packet clustering in a network with well-regulated input traffic is studied. Based on this study, a strategy for congestion-free communication in Packet Networks is proposed. The strategy provides guaranteed services per connection with no Packet loss and an end-to-end delay which is a constant plus a small bounded jitter term. Therefore, it provides an attractive solution for the transmission of real-time traffic in Packet Networks. The strategy is composed of an admission policy imposed per connection at the source node and a particular queuing scheme, called stop-and-go queuing, practiced at the switching nodes. The admission policy requires the Packet stream of each connection to possess a certain smoothness property upon arrival to the network, while the queuing scheme eliminates the process of Packet clustering and thereby preserves the smoothness property as Packets travel inside the network. Implementation of the stop-and-go queuing is simple, with little processing overhead and minor hardware modifications to the conventional FIFO (first in, first out) queuing structure. >
