SwePub
Tyck till om SwePub Sök här!
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Xiao Xiao) ;lar1:(kth)"

Sökning: WFRF:(Xiao Xiao) > Kungliga Tekniska Högskolan

  • Resultat 1-10 av 957
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Dan, Lilin, et al. (författare)
  • Design of Offset Spatial Modulation OFDM
  • 2021
  • Ingår i: IEEE Transactions on Communications. - : Institute of Electrical and Electronics Engineers (IEEE). - 0090-6778 .- 1558-0857. ; 69:9, s. 6267-6280
  • Tidskriftsartikel (refereegranskat)abstract
    • In this paper, the idea of offset spatial modulation (OSM) is integrated with orthogonal frequency division multiplexing (OFDM), toward an efficient design to bridge their advantages. Compared to its conventional counterpart as spatial modulation (SM)-OFDM, the proposed OSM-OFDM scheme aims at providing a simplified implementation structure with less number of radio frequency (RF) chains, by introducing an offset between the RF chain and the index of the activated transmit antenna on each subcarrier. Specifically, three types of offset antenna selection (OAS) methods are developed to meet different scene requirements for different number of available RF chains. Furthermore, through theoretical analysis, we quantify the bit error rate upper bounds of OSM-OFDM with different types of OAS methods. Finally, extensive computer simulations demonstrate that OSM-OFDM provides a flexible tradeoff among implementation cost, computation complexity and error performance.
  •  
2.
  • Fang, Shu, et al. (författare)
  • Offset Spatial Modulation and Offset Space Shift Keying : Efficient Designs for Single-RF MIMO Systems
  • 2019
  • Ingår i: IEEE Transactions on Communications. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 0090-6778 .- 1558-0857. ; 67:8, s. 5434-5444
  • Tidskriftsartikel (refereegranskat)abstract
    • Spatial modulation (SM) and space shift keying (SSK) techniques have the unique advantages of their single-radio-frequency (RF) structures compared with conventional multiple-input-multiple-output (MIMO) techniques. However, the transmission rates of these techniques are decided by the maximal switching frequency or by the minimal switching time between the RF chain and transmit antennas, which has been a bottleneck for their applications in future broadband wireless communications. To alleviate this problem, we propose a class of novel offset SM (OSM) and offset SSK (OSSK) schemes, with the aid of channel state information (CSI) at the transmitter. Compared with conventional SM and SSK, the proposed OSM and OSSK schemes can reduce the switching frequency of the RF chain, by introducing an offset between the connected RF chain and the index of the spatial modulated antenna. In extreme conditions, the proposed OSM and OSSK can work without RF switching while maintaining the single-RF advantage of conventional SM and SSK schemes. Through theoretical analysis, we also develop the bit-error rate (BER) performance bounds for the proposed two schemes. Finally, our simulation results demonstrate that the proposed OSM and OSSK outperform their counterparts, including conventional SM, SSK, CSI-aided SM, and CSI-aided SSK, while having a simplified RF-switching structure.
  •  
3.
  • Gao, Xiang, et al. (författare)
  • Planting Age Identification and Yield Prediction of Apple Orchard Using Time-Series Spectral Endmember and Logistic Growth Model
  • 2023
  • Ingår i: Remote Sensing. - : MDPI AG. - 2072-4292. ; 15:3, s. 642-642
  • Tidskriftsartikel (refereegranskat)abstract
    • In response to significant shifts in dietary and lifestyle preferences, the global demand for fruits has increased dramatically, especially for apples, which are consumed worldwide. Growing apple orchards of more productive and higher quality with limited land resources is the way forward. Precise planting age identification and yield prediction are indispensable for the apple market in terms of sustainable supply, price regulation, and planting management. The planting age of apple trees significantly determines productivity, quality, and yield. Therefore, we integrated the time-series spectral endmember and logistic growth model (LGM) to accurately identify the planting age of apple orchard, and we conducted planting age-driven yield prediction using a neural network model. Firstly, we fitted the time-series spectral endmember of green photosynthetic vegetation (GV) with the LGM. By using the four-points method, the environmental carrying capacity (ECC) in the LGM was available, which serves as a crucial parameter to determine the planting age. Secondly, we combined annual planting age with historical apple yield to train the back propagation (BP) neural network model and obtained the predicted apple yields for 12 counties. The results show that the LGM method can accurately estimate the orchard planting age, with Mean Absolute Error (MAE) being 1.76 and the Root Mean Square Error (RMSE) being 2.24. The strong correlation between orchard planting age and apple yield was proved. The results of planting age-driven yield prediction have high accuracy, with the MAE up to 2.95% and the RMSE up to 3.71%. This study provides a novel method to accurately estimate apple orchard planting age and yields, which can support policy formulation and orchard planning in the future.
  •  
4.
  • Gao, Yulan, et al. (författare)
  • Dynamic Social-Aware Peer Selection for Cooperative Relay Management With D2D Communications
  • 2019
  • Ingår i: IEEE Transactions on Communications. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 0090-6778 .- 1558-0857. ; 67:5, s. 3124-3139
  • Tidskriftsartikel (refereegranskat)abstract
    • In this paper, we investigate the optimal dynamic social-aware peer selection with spectrum-power trading to maximize the average sum energy efficiency (EE) of cellular users (CUs) for uplink transmission for an orthogonal frequency division multiple access cellular network with device-to-device (D2D) communications. Different from the previous studies, which mostly focus on how to exploit social ties in human social networks to construct the permutation of all the feasible peers, we consider dynamic peer selection with social awareness-aided spectrum-power trading in D2D overlaying communications. Specifically, the amount of transmit power from the D2D transmitters to relay the CUs for uplink transmission is determined by their social trust levels. Likewise, the D2D transmitters can gain the corresponding amount of spectrum from the CUs for D2D pair link communications, which can be regarded as the compensation of the power consumption for relaying CUs. We formulate the dynamic peer selection problems with social awareness-aided spectrum-power trading in cooperative D2D communications into the infinite-horizon time-average renewal-reward problems subject to time average constraints on a collection of penalty processes. And the Lyapunov optimization concepts-based drift-plus-penalty algorithms are proposed to solve them. The simulation results demonstrate the effectiveness of the proposed dynamic peer selection algorithms. And further performance comparison indicates that the proposed dynamic peer selection algorithms not only maximize the average EE of CUs but also guarantee higher privacy protection.
  •  
5.
  • Gao, Yulan, et al. (författare)
  • Energy Efficient Power Allocation With Demand Side Coordination for OFDMA Downlink Transmissions
  • 2019
  • Ingår i: IEEE Transactions on Wireless Communications. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 1536-1276 .- 1558-2248. ; 18:4, s. 2141-2155
  • Tidskriftsartikel (refereegranskat)abstract
    • We investigate the energy-efficient power allocation for downlink transmission in orthogonal frequency division multiple access-based long term evolution systems. Aiming at realizing on-demand power allocation in cellular networks, we explore the available coordination between the base station and multiple users, and propose a new performance merit, namely, the demand side coordination energy efficiency (DSC-EE), which captures the system normalized EE and the demand side information. The proposed DSC-EE is designed to exploit individual disparities from both the entire system and the individual own expected utility perspectives. Our goal is to maximize the DSC-EE of the system via power allocation with a constraint on the maximum transmit power. Specifically, the objective function of DSC-EE maximization problem in a fractional form can be transformed into a subtractive form that is more tractable based on the fractional programming theory. The convergence property of the proposed algorithms and the meaningfulness of the proposed performance merit related to the EE are demonstrated by simulations. The comparison of four EE metrics, the EE and the rate fairness, global-EE, Sum-EE, and DSC-EE, shows that the DSC-EE maximization tends to achieve high implementation level of on-demand power allocation while ensuring the EE of the system. In addition, when the minimum rate replaces the expected rate in the DSC-EE, further performance comparison indicates the necessity and impact of the expected rate in the tolerable quality of service bias function.
  •  
6.
  • Gao, Yulan, et al. (författare)
  • Game Theory-Based Anti-Jamming Strategies for Frequency Hopping Wireless Communications
  • 2018
  • Ingår i: IEEE Transactions on Wireless Communications. - : Institute of Electrical and Electronics Engineers (IEEE). - 1536-1276 .- 1558-2248. ; 17:8, s. 5314-5326
  • Tidskriftsartikel (refereegranskat)abstract
    • In frequency hopping (FH) wireless communications, finding an effective transmission strategy to properly mitigate jamming has been recently considered as a critical issue, due to the inherent broadcast nature of wireless communications. Recently, game theory has been proposed as a powerful tool for dealing with the jamming problem, which can be considered as a player (jammer) playing against a user (transmitter). Different from existing results, in this paper, a bimatrix game framework is developed for modeling the interaction process between the transmitter and the jammer, and the sufficient and necessary conditions for Nash equilibrium (NE) strategy of the game are obtained under the linear constraints. Furthermore, the relationship between the NE solution and the global optimal solution of the corresponding quadratic programming is presented. In addition, a special analysis case is developed based on the continuous game framework in which each player has a continuum of strategies. Finally, we show that the performance can be improved based on our game theoretic framework, which is verified by numerical investigations.
  •  
7.
  • Ge, Qi, et al. (författare)
  • Structure-Based Low-Rank Model With Graph Nuclear Norm Regularization for Noise Removal
  • 2017
  • Ingår i: IEEE Transactions on Image Processing. - : Institute of Electrical and Electronics Engineers (IEEE). - 1057-7149 .- 1941-0042. ; 26:7, s. 3098-3112
  • Tidskriftsartikel (refereegranskat)abstract
    • Nonlocal image representation methods, including group-based sparse coding and block-matching 3-D filtering, have shown their great performance in application to low-level tasks. The nonlocal prior is extracted from each group consisting of patches with similar intensities. Grouping patches based on intensity similarity, however, gives rise to disturbance and inaccuracy in estimation of the true images. To address this problem, we propose a structure-based low-rank model with graph nuclear norm regularization. We exploit the local manifold structure inside a patch and group the patches by the distance metric of manifold structure. With the manifold structure information, a graph nuclear norm regularization is established and incorporated into a low-rank approximation model. We then prove that the graph-based regularization is equivalent to a weighted nuclear norm and the proposed model can be solved by a weighted singular-value thresholding algorithm. Extensive experiments on additive white Gaussian noise removal and mixed noise removal demonstrate that the proposed method achieves a better performance than several state-of-the-art algorithms.
  •  
8.
  • Guan, Tianfu, et al. (författare)
  • Decoding the Self-Assembly Plasmonic Interface Structure in a PbS Colloidal Quantum Dot Solid for a Photodetector
  • 2023
  • Ingår i: ACS Nano. - : American Chemical Society (ACS). - 1936-0851 .- 1936-086X. ; 17:22, s. 23010-23019
  • Tidskriftsartikel (refereegranskat)abstract
    • Hybrid plasmonic nanostructures have gained enormous attention in a variety of optoelectronic devices due to their surface plasmon resonance properties. Self-assembled hybrid metal/quantum dot (QD) architectures offer a means of coupling the properties of plasmonics and QDs to photodetectors, thereby modifying their functionality. The arrangement and localization of hybrid nanostructures have an impact on exciton trapping and light harvesting. Here, we present a hybrid structure consisting of self-assembled gold nanospheres (Au NSs) embedded in a solid matrix of PbS QDs for mapping the interface structures and the motion of charge carriers. Grazing-incidence small-angle X-ray scattering is utilized to analyze the localization and spacing of the Au NSs within the hybrid structure. Furthermore, by correlating the morphology of the Au NSs in the hybrid structure with the corresponding differences observed in the performance of photodetectors, we are able to determine the impact of interface charge carrier dynamics in the coupling structure. From the perspective of architecture, our study provides insights into the performance improvement of optoelectronic devices.
  •  
9.
  • Huang, Yiqian, et al. (författare)
  • A Novel Maximum Distance Separable Code Based RIS-OFDM : Design and Optimization
  • 2022
  • Ingår i: 2022 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM 2022). - : Institute of Electrical and Electronics Engineers (IEEE). ; , s. 1521-1526
  • Konferensbidrag (refereegranskat)abstract
    • In this paper, we propose a novel maximum distance separable (MDS) code based and reconfigurable intelligent surface (RIS) assisted wireless communication system with orthogonal frequency division multiplexing (OFDM). Specifically, input bits are firstly divided into groups and their MDS codes are utilized to decide the amplitudes and phases of subcarriers. The introduction of the MDS code helps to increase the minimum Hamming distance between symbols and improve on the capability of error detection. Besides, the RIS is adopted to create additional paths between the radio frequency (RF) and the receiver as well as alter the signal phases with derived optimal solution. Benefiting from the strength of the RIS, the proposed system can better overcome multipath fading compared with conventional systems. Simulation results are presented to demonstrate the efficacy of the proposed system in terms of reducing bit error rate (BER) through multipath channels.
  •  
10.
  • Li, You, et al. (författare)
  • Cross-Media Communications With Decode-and-Forward Relay and Optimal Power Allocation
  • 2020
  • Ingår i: IEEE Transactions on Vehicular Technology. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 0018-9545 .- 1939-9359. ; 69:8, s. 9201-9205
  • Tidskriftsartikel (refereegranskat)abstract
    • With the rapid development of wireless communications, the signals may be transmitted in different media, such as visible light and millimeter-wave along the communication path. In this case, there will be different devices working in different media, which cannot directly communicate to each other. For alleviating this problem, we first conceive a cross-media communication scenario where two devices for different media could communicate with the aid of a relay working in both media. Furthermore, we derive the average outage probability of the uplink and downlink communications. Finally, aiming at minimizing the derived average outage probability, the optimal power allocation (PA) scheme at the relay side is also derived and verified by simulation results.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 957
Typ av publikation
tidskriftsartikel (713)
konferensbidrag (193)
annan publikation (21)
doktorsavhandling (19)
licentiatavhandling (5)
forskningsöversikt (4)
visa fler...
bokkapitel (2)
visa färre...
Typ av innehåll
refereegranskat (895)
övrigt vetenskapligt/konstnärligt (62)
Författare/redaktör
Aad, G (229)
Abbott, B. (229)
Abdinov, O (229)
Abi, B. (229)
Abramowicz, H. (229)
Adams, D. L. (229)
visa fler...
Adelman, J. (229)
Adomeit, S. (229)
Adye, T. (229)
Albrand, S. (229)
Aleksa, M. (229)
Aleksandrov, I. N. (229)
Alexander, G. (229)
Alexandre, G. (229)
Alexopoulos, T. (229)
Amako, K. (229)
Amelung, C. (229)
Amram, N. (229)
Anastopoulos, C. (229)
Ancu, L. S. (229)
Andari, N. (229)
Anderson, K. J. (229)
Anghinolfi, F. (229)
Annovi, A. (229)
Antonelli, M. (229)
Antonov, A. (229)
Arabidze, G. (229)
Arai, Y. (229)
Arnaez, O. (229)
Arnal, V. (229)
Asai, S. (229)
Asquith, L. (229)
Assamagan, K. (229)
Avolio, G. (229)
Azuma, Y. (229)
Bachacou, H. (229)
Bachas, K. (229)
Backes, M. (229)
Backhaus, M. (229)
Baines, J. T. (229)
Baker, O. K. (229)
Banas, E. (229)
Barak, L. (229)
Barisonzi, M. (229)
Barklow, T. (229)
Barlow, N. (229)
Barnett, R. M. (229)
Barone, G. (229)
Barton, A. E. (229)
Bates, R. L. (229)
visa färre...
Lärosäte
Uppsala universitet (258)
Stockholms universitet (240)
Lunds universitet (240)
Chalmers tekniska högskola (25)
RISE (21)
visa fler...
Karolinska Institutet (16)
Göteborgs universitet (5)
Umeå universitet (3)
Linköpings universitet (3)
Högskolan i Halmstad (2)
Luleå tekniska universitet (1)
Handelshögskolan i Stockholm (1)
Mittuniversitetet (1)
Sveriges Lantbruksuniversitet (1)
visa färre...
Språk
Engelska (955)
Kinesiska (2)
Forskningsämne (UKÄ/SCB)
Teknik (466)
Naturvetenskap (452)
Medicin och hälsovetenskap (18)
Lantbruksvetenskap (6)
Samhällsvetenskap (3)

Å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