SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "L773:1550 3607 "

Sökning: L773:1550 3607

  • Resultat 1-10 av 71
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Abu-Shaban, Z., et al. (författare)
  • Near-field Localization with a Reconfigurable Intelligent Surface Acting as Lens
  • 2021
  • Ingår i: IEEE International Conference on Communications. - 1550-3607. ; June 2021
  • Konferensbidrag (refereegranskat)abstract
    • Exploiting wavefront curvature enables localization with limited infrastructure and hardware complexity. With the introduction of reconfigurable intelligent surfaces (RISs), new opportunities arise, in particular when the RIS is functioning as a lens receiver. We investigate the localization of a transmitter using a RIS-based lens in close proximity to a single receive antenna element attached to reception radio frequency chain. We perform a Fisher information analysis, evaluate the impact of different lens configurations, and propose a two-stage localization algorithm. Our results indicate that positional beamforming can lead to better performance when a priori location information is available, while random beamforming is preferred when a priori information is lacking. Our simulation results for a moderate size lens operating at 28 GHz showcased that decimeter-level accuracy can be attained within 3 meters to the lens.
  •  
2.
  • Ahmad, Suhail, 1992, et al. (författare)
  • Predictive Resource Allocation Evaluation with Real Channel Measurements
  • 2017
  • Ingår i: IEEE International Conference on Communications. - 1550-3607.
  • Konferensbidrag (refereegranskat)abstract
    • Mobile services, especially video streaming, has seen a rapid usage increase in recent years. Base stations (BSs) need to employ smarter and efficient resource allocation strategies to maintain high quality of service (QoS) to users at all the times. Predictive resource allocation (PRA), is one such novel scheme, in which BSs seek to anticipate the user demands and offer service to users in advance. As a result, the QoS can be improved, network load can be distributed over time, while at the same time offering efficient utilization of BS power. In location-aware PRA, the BS exploits location information of the users to predict the channel expected variations and adapt the BS resources accordingly. We evaluate PRA strategies based on an empirical study of the radio channel variation from measured location-aided channel radio maps using a smart phone. We observed that gains offered by the PRA scheme are highly dependent on user mobility patterns.
  •  
3.
  • Alegria, Juan Vidal, et al. (författare)
  • Enabling Decentralized Computation of the WAX Decomposition
  • 2022
  • Ingår i: ICC 2022 - IEEE International Conference on Communications. - 1550-3607. ; 2022
  • Konferensbidrag (refereegranskat)abstract
    • As the number of antennas scales up, research efforts have been directed towards finding decentralized receiver solutions for multi-antenna architectures. In a recent paper, a novel matrix decomposition - the WAX decomposition - was proposed, which has direct bearing on characterizing the level of decentralization that is possible if the complexity of the decentralized processing is limited. However, the available work on WAX decomposition has left some gaps in determining how one of its basis matrices has to be defined. In this paper we present a number of constructions for effectively defining said basis matrix, and we show how they facilitate decentralized calculation of the WAX decomposition itself for applying information-lossless processing in architectures with an arbitrary level of decentralization. Thereby, taking a major step towards realizing decentralized receiver solution for large scale antenna systems.
  •  
4.
  • Alvarado, Alex, 1982, et al. (författare)
  • Correcting Suboptimal Metrics in Iterative Decoders
  • 2009
  • Ingår i: IEEE International Conference on Communications. - 1550-3607. - 9781424434350
  • Konferensbidrag (refereegranskat)abstract
    • In this paper the issue of improving the performance of iterative decoders based on sub-optimal calculation of the messages exchanged during iterations (L-values) is addressed. It is well known in the literature that a simple---yet very effective---way to improve the performance of suboptimal iterative decoders is based on applying a scaling factor to the L-values. In this paper, starting with a theoretical model based on the so-called consistency condition of a random variable, we propose a methodology for correcting the L-values that relies only on the distribution of the soft information exchanged in the iterative process. This methodology gives a clear explanation of why the well-known linear scaling factor provides a very good performance. Additionally, the proposed methodology allows us to avoid the exhaustive search required otherwise. Numerical simulations show that for turbo codes the scaling factors found closely follow the optimum values, which translates to a close-to-optimal BER performance. Moreover, for LDPC codes, the proposed methodology produces a better BER performance compared with the known method in the literature.
  •  
5.
  • Alvarado, Alex, 1982, et al. (författare)
  • On the performance of BICM with trivial interleavers in nonfading channels
  • 2011
  • Ingår i: IEEE International Conference on Communications ICC 2011. - : IEEE. - 1550-3607. - 9781612842332
  • Konferensbidrag (refereegranskat)abstract
    • Recent results have shown that the performance of bit-interleaved coded modulation (BICM) using convolutional codes in nonfading channels can be greatly improved if the bit-level interleaver takes a trivial form (BICM-T), i.e., if it does not interleave the bits at all. The reported gains reach a few decibels and are obtained using a less complex BICM system. In this paper, we give a formal explanation for these results and show that BICM-T is in fact the combination of a TCM transmitter and a BICM receiver. Analytical bounds that predict the performance of BICM-T are developed and a new type of distance spectrum for the convolutional code is introduced.
  •  
6.
  • Alvarado, Alex, 1982, et al. (författare)
  • Unequal Error Protection in BICM with QAM Constellations: Interleaver and Code Design
  • 2009
  • Ingår i: IEEE International Conference on Communications. - 1550-3607. - 9781424434350
  • Konferensbidrag (refereegranskat)abstract
    • In this paper we present a general methodology for the interleaver and code design for QAM-based BICM transmissions. We develop analytical bounds on the bit error rate and we use them to predict the performance of BICM when unequal error protection (UEP) is introduced by the constellation labeling. Based on these bounds, the optimum design of interleaver and code is presented. The improvements obtained reached 2~dB for the analyzed cases, and are obtained without complexity increase. Although previous works noted the influence of the interleaver design and the UEP, to the best of our knowledge, this paper is the first to analyze formally this problem for BICM transmissions.
  •  
7.
  • Aulin, Jocelyn, 1964, et al. (författare)
  • Compressive Sensing Aided Determination of WCDMA Constrained Capacity
  • 2012
  • Ingår i: IEEE International Conference on Communications. - 1550-3607. - 9781457720536 ; , s. 4072-4077
  • Konferensbidrag (refereegranskat)abstract
    • The continual challenge for Wideband Code Division Multiple Access (WCDMA) communication networks is to provide increasingly higher data rates for more and more users for mobile broadband. Hence, WCDMA single-user and multiple-user capacity results are important references for practical WCDMA networks since they provide limits of performance to which practical systems strive to approach. Analysis and determination of the single and multiple-user WCDMA capacity for dispersive fading channels which include the effects of inter-symbol interference (ISI), inter-channel interference (ICI) and multi-user interference (MUI) (without over-simplifying assumptions to not restrict the applicability of the results) has been a difficult and computationally costly problem. In this paper, we study the WCDMA constrained capacity of a doubly-dispersive wide sense stationary uncorrelated scattering (WSSUS) fading channel, using an equivalent vector channel model of the system with inter-symbol, inter-channel and the multi-user interference due to multipath. To reduce the computational cost of determining the capacity numerically, due to interference, we propose a novel method based on compressive sensing (CS).
  •  
8.
  • Aulin, Jocelyn, 1964, et al. (författare)
  • Compressive Sensing for the Capacity of a Rayleigh Fading Channel
  • 2011
  • Ingår i: 2011 IEEE International Conference on Communications, ICC 2011; Kyoto; Japan; 5 June 2011 through 9 June 2011. - : IEEE. - 1550-3607. - 9781612842325 ; , s. Art. no. 5962506-
  • Konferensbidrag (refereegranskat)abstract
    • A given objective function, $I(p_X(x))$, is to be maximized over the argument $p_X(x)$, where $p_X(x)$ is a continuous function of $x in R^1$. Rather than optimizing $I(p_X(x))$ over the domain of functions, where the optimal solution $p_X^*(x)$ is non-zero only at a few but unknown discrete points $x in {x_1 , x_2 , ldots , x_S } $, is it possible to solve the optimization problem by optimizing the objective function over S discrete components only? This is the main problem addressed and is solved using compressive sensing (CS) with application to the determination of the capacity of a discrete memoryless Rayleigh-fading channel with peak and average input power constraints. A novel optimization algorithm is developed and applied to a known example. Simulation results, using this novel optimization algorithm, are generated which provides an accurate estimate of the optimizing distribution and the resultant capacity. The significance of this approach is that it can be applied to optimization problems in general and specifically, to communication systems where the domain can be compressed.
  •  
9.
  • Chatzidiamantis, N. D., et al. (författare)
  • Diversity combining in hybrid RF/FSO systems with PSK modulation
  • 2011
  • Ingår i: IEEE International Conference on Communications. - : IEEE. - 1550-3607. - 9781612842332 ; , s. Art. no. 5962684-
  • Konferensbidrag (refereegranskat)abstract
    • We present a novel architecture for hybrid radio frequency (RF)/ free space optical (FSO) wireless systems without feedback or channel state information (CSI) at the transmitter. Under the assumption that 60 GHz RF and FSO systems support the same data rates, the proposed implementation transmits the same data over both links, using phase shift keying (PSK) as a common modulation scheme, and combines the signals from each individual link at the receiver on a symbol-by-symbol basis. Two popular diversity combining schemes are considered, namely, selection combining (SC) and maximal ratio combining (MRC), while tractable analytical approximations for the bit error rate (BER) are obtained. Investigations over various weather conditions and link distances revealed that the proposed implementation fully exploits the complementary nature of RF and FSO channels, even when one of the two available links fails. Furthermore, the comparison of the combining schemes demonstrates MRC as the optimum combining scheme, offering link distance gains compared to SC.
  •  
10.
  • Chowdappa, V.P., et al. (författare)
  • Distributed channel prediction for multi-agent systems
  • 2017
  • Ingår i: IEEE International Conference on Communications. - 1550-3607.
  • Konferensbidrag (refereegranskat)abstract
    • Multi-agent systems (MAS) communicate over a wireless network to coordinate their actions and to report their mission status. Connectivity and system-level performance can be improved by channel gain prediction. We present a distributed Gaussian process regression (GPR) framework for channel prediction in terms of the received power in MAS. The framework combines a Bayesian committee machine with an average consensus scheme, thus distributing not only the memory, but also computational and communication loads. Through Monte Carlo simulations, we demonstrate the performance of the proposed GPR.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 71
Typ av publikation
konferensbidrag (68)
tidskriftsartikel (3)
Typ av innehåll
refereegranskat (71)
Författare/redaktör
Wymeersch, Henk, 197 ... (20)
Svensson, Tommy, 197 ... (8)
Eriksson, Thomas, 19 ... (5)
Durisi, Giuseppe, 19 ... (4)
Seco-Granados, G. (4)
Keskin, Furkan, 1988 (4)
visa fler...
Agrell, Erik, 1965 (4)
Alvarado, Alex, 1982 (4)
Rusek, Fredrik (4)
Szczecinski, Leszek, ... (4)
Coldrey, Mikael, 197 ... (3)
Keykhosravi, Kamran, ... (3)
Alexandropoulos, G. ... (3)
Ström, Erik, 1965 (3)
Jin, S. (2)
Wang, H. (2)
Zhang, J. (2)
Tufvesson, Fredrik (2)
Wang, J. (1)
Zhang, Z. (1)
Björnson, Emil, Prof ... (1)
Wang, L (1)
Zirath, Herbert, 195 ... (1)
Valkama, Mikko (1)
Sanguinetti, Luca (1)
Han, Z. (1)
Gao, X (1)
Fischione, Carlo (1)
Larsson, Erik G (1)
Seco-Granados, Gonza ... (1)
Abu-Shaban, Z. (1)
Bernhardsson, Bo (1)
Saad, Walid (1)
Gholami, Mohammad Re ... (1)
Karlsson, Magnus, 19 ... (1)
Johannisson, Pontus, ... (1)
Svensson, Arne, 1955 (1)
Ahmad, Suhail, 1992 (1)
Reinhagen, Rikard (1)
Muppirisetty, Srikar ... (1)
Yajnanarayana, Vijay ... (1)
Öwall, Viktor (1)
Alegria, Juan Vidal (1)
Huang, Jinliang (1)
Edfors, Ove (1)
Papadogiannis, Agisi ... (1)
Denis, B. (1)
Andrekson, Peter, 19 ... (1)
Brännström, Fredrik, ... (1)
Núñez, Víctor, 1984 (1)
visa färre...
Lärosäte
Chalmers tekniska högskola (63)
Lunds universitet (6)
Kungliga Tekniska Högskolan (4)
Linköpings universitet (4)
Högskolan i Halmstad (2)
RISE (1)
visa fler...
Blekinge Tekniska Högskola (1)
visa färre...
Språk
Engelska (71)
Forskningsämne (UKÄ/SCB)
Teknik (68)
Naturvetenskap (12)
Medicin och hälsovetenskap (1)

År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy