Author
Massimiliano Laddomada
Other affiliations: Polytechnic University of Turin
Bio: Massimiliano Laddomada is an academic researcher from Texas A&M University–Texarkana. The author has contributed to research in topics: Decimation & IEEE 802.11. The author has an hindex of 22, co-authored 88 publications receiving 1356 citations. Previous affiliations of Massimiliano Laddomada include Polytechnic University of Turin.
Papers
More filters
TL;DR: A throughput analysis of the IEEE 802.11 protocol at the data link layer in non-saturated traffic conditions taking into account the impact of both transmission channel and capture effects in Rayleigh fading environment is provided.
Abstract: In this paper, we provide a saturation throughput analysis of the IEEE 802.11 protocol at the data link layer by including the impact of both transmission channel and capture effects in Rayleigh fading environment. Impacts of both non-ideal channel and capture effects, specially in an environment of high interference, become important in terms of the actual observed throughput. As far as the 4-way handshaking mechanism is concerned, we extend the multi-dimensional Markovian state transition model characterizing the behavior at the MAC layer by including transmission states that account for packet transmission failures due to errors caused by propagation through the channel. This way, any channel model characterizing the physical transmission medium can be accommodated, including AWGN and fading channels. We also extend the Markov model in order to consider the behavior of the contention window when employing the basic 2-way handshaking mechanism. Under the usual assumptions regarding the traffic generated per node and independence of packet collisions, we solve for the stationary probabilities of the Markov chain and develop expressions for the saturation throughput as a function of the number of terminals, packet sizes, raw channel error rates, capture probability, and other key system parameters. The theoretical derivations are then compared to simulation results confirming the effectiveness of the proposed models.
305 citations
TL;DR: A mathematical framework is presented to optimize the proposed decimation filters in such a way as to increase the SigmaDelta quantization noise (QN) rejection around the so called folding bands, frequency intervals whose QN gets folded down to baseband because of the decimation process.
Abstract: This paper addresses the design of generalized comb decimation filters, proposing some novel decimation schemes tailored to SigmaDelta modulators. We present a mathematical framework to optimize the proposed decimation filters in such a way as to increase the SigmaDelta quantization noise (QN) rejection around the so called folding bands, frequency intervals whose QN gets folded down to baseband because of the decimation process. Comparisons are given in terms of passband drop and selectivity with respect to classic comb filters with orders ranging from 3 to 6. As far as the practical implementation of the proposed filters is concerned, we present two different architectures, namely a recursive and a nonrecursive implementation, the latter of which constitutes the basis for realizing multiplier-less generalized comb filter (GCF) realizations. We propose a mathematical framework for evaluating the sensitivity of GCFs to the approximation of the multipliers embedded in the filter architectures. The considerations deduced from the sensitivity analysis, pave the way to an optimization algorithm useful for approximating the multipliers with power-of-2 coefficients
105 citations
TL;DR: Simulation results indicate that very few global iterations are sufficient to reap significant benefits from implicit knowledge of source correlation and analytical performance bounds are provided for the iterative joint decoder and comparisons with sample simulation results.
Abstract: This letter considers low-density parity-check (LDPC) coding of correlated binary sources and a novel iterative joint channel decoding without communication of any side information. We demonstrate that depending on the extent of the source correlation, additional coding gains can be obtained. Two stages of iterative decoding are employed. During global iterations, updated estimates of the source correlation are obtained and passed on to the sum-product decoder that performs local iterations with a predefined stopping criterion and/or a maximum number of local decoding iterations. Simulation results indicate that very few global iterations (2-5) are sufficient to reap significant benefits from implicit knowledge of source correlation. Finally, we provide analytical performance bounds for our iterative joint decoder and comparisons with sample simulation results.
42 citations
TL;DR: The provision of integrated services from high-altitude platforms (HAPs) is discussed, and a flexible communication system for HAP-based communications is identified and analyzed, with particular attention to the delivery of broadband services from HAPs to highspeed trains.
Abstract: In this article the provision of integrated services from high-altitude platforms (HAPs) is discussed, and a flexible communication system for HAP-based communications is identified and analyzed, with particular attention to the delivery of broadband services from HAPs to highspeed trains. The high coding gain required by the proposed scenario is achieved through adaptive concatenated coding schemes, while smart antennas operating with adaptive beamforming algorithms are employed at the ground stations. The simulated system performance based on a multi-antenna model of the stratospheric channel is reported, and the use of HAPs in synergy with terrestrial and satellite systems is discussed.
41 citations
TL;DR: The throughput allocation resulting from the proposed algorithm is able to greatly increase the aggregate throughput of the DCF, while ensuring fairness levels among the stations of the same order as the ones guaranteed by the classical PF criterion.
Abstract: This paper focuses on multirate IEEE 802.11 Wireless LAN employing the mandatory Distributed Coordination Function (DCF) option. Its aim is threefold. Upon starting from the multi-dimensional Markovian state transition model proposed by Malone et.al. for characterizing the behavior of the IEEE 802.11 protocol at the Medium Access Control layer, it presents an extension accounting for packet transmission failures due to channel errors. Second, it establishes the conditions under which a network constituted by N stations, each station transmitting with its own bit rate, Rd(s), and packet rate, λs, can be assumed loaded. Finally, it proposes a modified Proportional Fairness (PF) criterion, suitable for mitigating the rate anomaly problem of multirate loaded IEEE 802.11 Wireless LANs, employing the mandatory DCF option. Compared to the widely adopted assumption of saturated network, the proposed fairness criterion can be applied to general loaded networks. The throughput allocation resulting from the proposed algorithm is able to greatly increase the aggregate throughput of the DCF, while ensuring fairness levels among the stations of the same order as the ones guaranteed by the classical PF criterion. Simulation results are presented for some sample scenarios, confirming the effectiveness of the proposed criterion for optimized throughput allocation.
41 citations
Cited by
More filters
TL;DR: This paper aims to give a comprehensive review of different TOA-based localization algorithms and their technical challenges, and to point out possible future research directions.
Abstract: Localization of a wireless device using the time-of-arrivals (TOAs) from different base stations has been studied extensively in the literature. Numerous localization algorithms with different accuracies, computational complexities, a-priori knowledge requirements, and different levels of robustness against non-line-of-sight (NLOS) bias effects also have been reported. However, to our best knowledge, a detailed unified survey of different localization and NLOS mitigation algorithms is not available in the literature. This paper aims to give a comprehensive review of these different TOA-based localization algorithms and their technical challenges, and to point out possible future research directions. Firstly, fundamental lower bounds and some practical estimators that achieve close to these bounds are summarized for line-of-sight (LOS) scenarios. Then, after giving the fundamental lower bounds for NLOS systems, different NLOS mitigation techniques are classified and summarized. Simulation results are also provided in order to compare the performance of various techniques. Finally, a table that summarizes the key characteristics of the investigated techniques is provided to conclude the paper.
989 citations
Book•
[...]
01 Sep 2014
TL;DR: It is quite impossible to include in a single volume of reasonable size, an adequate and exhaustive discussion of the calculus in its more advanced stages, so it becomes necessary, in planning a thoroughly sound course in the subject, to consider several important aspects of the vast field confronting a modern writer.
Abstract: WITH the ever-widening scope of modern mathematical analysis and its many ramifications, it is quite impossible to include, in a single volume of reasonable size, an adequate and exhaustive discussion of the calculus in its more advanced stages. It therefore becomes necessary, in planning a thoroughly sound course in the subject, to consider several important aspects of the vast field confronting a modern writer. The limitation of space renders the selection of subject-matter fundamentally dependent upon the aim of the course, which may or may not be related to the content of specific examination syllabuses. Logical development, too, may lead to the inclusion of many topics which, at present, may only be of academic interest, while others, of greater practical value, may have to be omitted. The experience and training of the writer may also have, more or less, a bearing on both these considerations.Advanced CalculusBy Dr. C. A. Stewart. Pp. xviii + 523. (London: Methuen and Co., Ltd., 1940.) 25s.
881 citations
01 Mar 1985
TL;DR: This book by Elliott and Rao is a valuable contribution to the general areas of signal processing and communications and can be used for a graduate level course in perhaps two ways.
Abstract: There has been a great deal of material in the area of discrete-time transforms that has been published in recent years. This book does an excellent job of presenting important aspects of such material in a clear manner. The book has 11 chapters and a very useful appendix. Seven of these chapters are essentially devoted to the Fourier series/transform, discrete Fourier transform, fast Fourier transform (FFT), and applications of the FFT in the area of spectral estimation. Chapters 8 through 10 deal with many other discrete-time transforms and algorithms to compute them. Of these transforms, the KarhunenLoeve, the discrete cosine, and the Walsh-Hadamard transform are perhaps the most well-known. A lucid discussion of number theoretic transforms i5 presented in Chapter 11. This reviewer feels that the authors have done a fine job of compiling the pertinent material and presenting it in a concise and clear manner. There are a number of problems at the end of each chapter, an appreciable number of which are challenging. The authors have included a comprehensive set of references at the end of the book. In brief, this book is a valuable contribution to the general areas of signal processing and communications. It can be used for a graduate level course in perhaps two ways. One would be to cover the first seven chapters in great detail. The other would be to cover the whole book by focussing on different topics in a selective manner. This book by Elliott and Rao is extremely useful to researchers/engineers who are working in the areas of signal processing and communications. It i s also an excellent reference book, and hence a valuable addition to one’s library
843 citations
Patent•
26 Jun 2008TL;DR: In this paper, a digital broadcasting system and a method of processing data are disclosed, which are robust to error when mobile service data are transmitted, whereby it is possible to strongly cope with fast channel change while giving robustness to the mobile services data.
Abstract: A digital broadcasting system and a method of processing data are disclosed, which are robust to error when mobile service data are transmitted. To this end, additional encoding is performed for the mobile service data, whereby it is possible to strongly cope with fast channel change while giving robustness to the mobile service data.
411 citations
Dissertation•
01 Mar 2009
TL;DR: In this paper, the relationship between these transforms and their properties was discussed and some important applications in physics and engineering were given, as well as their properties and applications in various domains.
Abstract: Integral transforms (Laplace, Fourier and Mellin) are introduced with their properties, the relationship between these transforms was discussed and some important applications in physics and engineering were given. ااااااا دقل مت ضارعتسإ ةساردو ل ةيلماكتلا تليوحتلا لك ، سلبل تلوحت نم روف ي ر نيليمو عم ةشقانم كلذكو ،اهنم لك صاوخ و صئاصخ ةقلعلا ةشقانم مت هذه نيب طبرلاو و ،تليوحتلا مت ميدقت تاقيبطتلا ضعب تليوحتلا هذهل ةمهملا يف تلاجم ءايزيفلا ةسدنهلاو.
383 citations