IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v63y2016i2d10.1007_s11235-015-0121-7.html
   My bibliography  Save this article

Optimal pilot design for OFDM systems with non-contiguous subcarriers based on semi-definite programming

Author

Listed:
  • Weiqiang Pan

    (South China University of Technology)

  • Zhilong Shan

    (South China Normal University)

  • Ting Chen

    (Cancer Hospital of Shantou University Medical College)

  • Fangjiong Chen

    (South China University of Technology)

  • Jing Feng

    (South China University of Technology)

Abstract

In this paper we consider OFDM systems with non-contiguous subcarriers where distributed spectrum fragments are applicable for transmission. A new model is proposed for pilot optimization with respect to location and power. The least-square approach is applied for channel estimation at the receiver and the optimization objective is to minimize the mean square error of the channel estimation. This optimization problem is then formulated as minimizing the spread of the eigenvalues of a positive semidefinite matrix, which is a typical semidefinite programming problem, and hence it can be solved with conventional interior-point method. Simulation results show the efficiency of the proposed algorithm.

Suggested Citation

  • Weiqiang Pan & Zhilong Shan & Ting Chen & Fangjiong Chen & Jing Feng, 2016. "Optimal pilot design for OFDM systems with non-contiguous subcarriers based on semi-definite programming," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 63(2), pages 297-305, October.
    • Handle: RePEc:spr:telsys:v:63:y:2016:i:2:d:10.1007_s11235-015-0121-7
    DOI: 10.1007/s11235-015-0121-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-015-0121-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-015-0121-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. E. L. Lawler & D. E. Wood, 1966. "Branch-and-Bound Methods: A Survey," Operations Research, INFORMS, vol. 14(4), pages 699-719, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rodrigo Calderón-Rico & Roberto Carrasco-Alvarez & Javier Vázquez Castillo, 2018. "Dynamic wavelet-based pilot allocation algorithm for OFDM-based cognitive radio systems," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 68(2), pages 193-200, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kezong Tang & Xiong-Fei Wei & Yuan-Hao Jiang & Zi-Wei Chen & Lihua Yang, 2023. "An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem," Mathematics, MDPI, vol. 11(21), pages 1-26, October.
    2. Fox, B. L. & Lenstra, J. K. & Rinnooy Kan, A. H. G. & Schrage, L. E., 1977. "Branching From The Largest Upper Bound: Folklore And Facts," Econometric Institute Archives 272158, Erasmus University Rotterdam.
    3. Notte, Gastón & Pedemonte, Martín & Cancela, Héctor & Chilibroste, Pablo, 2016. "Resource allocation in pastoral dairy production systems: Evaluating exact and genetic algorithms approaches," Agricultural Systems, Elsevier, vol. 148(C), pages 114-123.
    4. Juan F. R. Herrera & José M. G. Salmerón & Eligius M. T. Hendrix & Rafael Asenjo & Leocadio G. Casado, 2017. "On parallel Branch and Bound frameworks for Global Optimization," Journal of Global Optimization, Springer, vol. 69(3), pages 547-560, November.
    5. Gautam Mitra & Frank Ellison & Alan Scowcroft, 2007. "Quadratic programming for portfolio planning: Insights into algorithmic and computational issues Part II — Processing of portfolio planning models with discrete constraints," Journal of Asset Management, Palgrave Macmillan, vol. 8(4), pages 249-258, November.
    6. Efrat Taig & Ohad Ben-Shahar, 2019. "Gradient Surfing: A New Deterministic Approach for Low-Dimensional Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 180(3), pages 855-878, March.
    7. Ekart, Aniko & Nemeth, S. Z., 2005. "Stability analysis of tree structured decision functions," European Journal of Operational Research, Elsevier, vol. 160(3), pages 676-695, February.
    8. Rosato, Paolo & Stellin, Giuseppe, 1995. "MULTI CRITERIA ANALYSIS IN FARM MANAGEMENT FOLLOWING THE COMMON AGRICULTURAL POLICY REFORM: AN APPLICATION OF MULTI-OBJECTIVE INTEGER LINEAR PROGRAMMING; Proceedings of the 4th Minnesota Padova Confer," Working Papers 14414, University of Minnesota, Center for International Food and Agricultural Policy.
    9. Jiancheng Long & Wai Yuen Szeto, 2019. "Link-Based System Optimum Dynamic Traffic Assignment Problems in General Networks," Operations Research, INFORMS, vol. 67(1), pages 167-182, January.
    10. Wang, Lizhi & Nikouei Mehr, Maryam, 2019. "An optimization approach to epistasis detection," European Journal of Operational Research, Elsevier, vol. 274(3), pages 1069-1076.
    11. Kyoungmi Hwang & Dohyun Kim & Kyungsik Lee & Chungmok Lee & Sungsoo Park, 2017. "Embedded variable selection method using signomial classification," Annals of Operations Research, Springer, vol. 254(1), pages 89-109, July.
    12. de Mast, Jeroen, 2011. "The tactical use of constraints and structure in diagnostic problem solving," Omega, Elsevier, vol. 39(6), pages 702-709, December.
    13. Robin Mueller-Bady & Martin Kappes & Inmaculada Medina-Bulo & Francisco Palomo-Lozano, 2019. "An evolutionary hybrid search heuristic for monitor placement in communication networks," Journal of Heuristics, Springer, vol. 25(6), pages 861-899, December.
    14. Jourdan, L. & Basseur, M. & Talbi, E.-G., 2009. "Hybridizing exact methods and metaheuristics: A taxonomy," European Journal of Operational Research, Elsevier, vol. 199(3), pages 620-629, December.
    15. Shi, Wenlong & Liang, Hao & Bittner, Myrna, 2024. "Dynamic microgrid formation for resilient distribution systems considering large-scale deployment of mobile energy resources," Applied Energy, Elsevier, vol. 362(C).
    16. Qiuping Ni & Yuanxiang Tang, 2023. "A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research," Sustainability, MDPI, vol. 15(9), pages 1-37, April.
    17. Patrick Manser & Tom Haering & Tim Hillel & Janody Pougala & Rico Krueger & Michel Bierlaire, 2024. "Estimating flexibility preferences to resolve temporal scheduling conflicts in activity-based modelling," Transportation, Springer, vol. 51(2), pages 501-528, April.
    18. Peter Brooker, 2004. "Future air traffic management systems and financial decision-making constraints," Transportation, Springer, vol. 31(1), pages 1-20, February.
    19. J. Glover & V. Quan & S. Zolfaghari, 2021. "Some new perspectives for solving 0–1 integer programming problems using Balas method," Computational Management Science, Springer, vol. 18(2), pages 177-193, June.
    20. Chen, Thomas Ying-Jeh & Riley, Connor Thomas & Van Hentenryck, Pascal & Guikema, Seth David, 2020. "Optimizing inspection routes in pipeline networks," Reliability Engineering and System Safety, Elsevier, vol. 195(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:63:y:2016:i:2:d:10.1007_s11235-015-0121-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.