Frederic Launay
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Frederic Launay has a total of 100 co-authors. Here are the top co-authors by number of shared publications:
- Patrick Coirault
Université de Poitiers, LIAS (EA 6315), 2 rue Pierre Brousse, 86073 Poitiers, France
13 shared publications - Florin Hutu
INSA Lyon, Inria, CITI, UR3720, Villeurbanne, France
4 shared publications - Sebastien Cauet
LIAS Laboratory, University of Poitiers, 86073 Poitiers, France
4 shared publications S. Toutain
3 shared publicationsY. Wang
Ecole Polytechnique, Nantes Univ., France
3 shared publicationsBilal Ghani
LIAS (EA 6315), Université de Poitiers, Poitiers, France
2 shared publications
Latest Publications
- 21 March 2026
- Published by Elsevier in Digital Signal Processing
- Vol. 177
Power allocation in an uplink sparse code multiple access with target bit error rates
- 21 March 2026
- Published by Elsevier in Digital Signal Processing
- Vol. 177
Power allocation in an uplink sparse code multiple access with target bit error rates
- Open Access
- 23 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 118983-119016
Non-Orthogonal Multiple Access for Offloading in Multi-Access Edge Computing: A Survey
Multi-Access Edge Computing (MEC) architectures now seem to represent the future of data processing architectures. Indeed, they have the potential to optimize the use of the backhaul network, guarantee the implementation of real-time applications and offer services adapted to the user’s context. To further improve the performance of MEC architectures, it may be worth combining them with a new technology at the physical layer: Non Orthogonal Multiple Access (NOMA). During the task offloading process, this could enhance energy efficiency, maximize the number of users benefiting from MEC services and further reduce latency. That is why the article focuses on the use of NOMA for task offloading in MEC architectures and offers a comprehensive study on the subject. First, we define a taxonomy to ensure a systematic review of existing work. We then analyze and compare existing works, classifying them according to their purpose. Based on this, we then discuss the benefits and limitations of existing work, highlighting some good practices. Finally, we identify future research directions in the field of NOMA-assisted MEC architectures.
- 23 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 118983-119016
Open AccessNon-Orthogonal Multiple Access for Offloading in Multi-Access Edge Computing: A Survey
Multi-Access Edge Computing (MEC) architectures now seem to represent the future of data processing architectures. Indeed, they have the potential to optimize the use of the backhaul network, guarantee the implementation of real-time applications and offer services adapted to the user’s context. To further improve the performance of MEC architectures, it may be worth combining them with a new technology at the physical layer: Non Orthogonal Multiple Access (NOMA). During the task offloading process, this could enhance energy efficiency, maximize the number of users benefiting from MEC services and further reduce latency. That is why the article focuses on the use of NOMA for task offloading in MEC architectures and offers a comprehensive study on the subject. First, we define a taxonomy to ensure a systematic review of existing work. We then analyze and compare existing works, classifying them according to their purpose. Based on this, we then discuss the benefits and limitations of existing work, highlighting some good practices. Finally, we identify future research directions in the field of NOMA-assisted MEC architectures.
- Open Access
Massive detection of cryptic recessive genetic defects in cattle mining millions of life histories
We present a data-mining framework designed to detect recessive defects in livestock that have been previously missed due to a lack of specific signs, incomplete penetrance, or incomplete linkage disequilibrium. This approach leverages the massive data generated by genomic selection. Its basic principle is to compare the observed and expected numbers of homozygotes for sliding haplotypes in animals with different life histories. Within three cattle breeds, we report 33 new loci responsible for increased risk of juvenile mortality and present a series of validations based on large-scale genotyping, clinical examination, and functional studies for candidate variants affecting the NOA1 , RFC5, and ITGB7 genes. In particular, we describe disorders associated with NOA1 and RFC5 mutations for the first time in vertebrates. The discovery of these many new defects will help to characterize the genetic basis of inbreeding depression, while their management will improve animal welfare and reduce losses to the industry.
Open AccessMassive detection of cryptic recessive genetic defects in cattle mining millions of life histories
We present a data-mining framework designed to detect recessive defects in livestock that have been previously missed due to a lack of specific signs, incomplete penetrance, or incomplete linkage disequilibrium. This approach leverages the massive data generated by genomic selection. Its basic principle is to compare the observed and expected numbers of homozygotes for sliding haplotypes in animals with different life histories. Within three cattle breeds, we report 33 new loci responsible for increased risk of juvenile mortality and present a series of validations based on large-scale genotyping, clinical examination, and functional studies for candidate variants affecting the NOA1 , RFC5, and ITGB7 genes. In particular, we describe disorders associated with NOA1 and RFC5 mutations for the first time in vertebrates. The discovery of these many new defects will help to characterize the genetic basis of inbreeding depression, while their management will improve animal welfare and reduce losses to the industry.
- 13 July 2023
- Published by EDP Sciences in Pédagogie Médicale
- Vol. 24 (4) , 229-240
La physiothérapie française est-elle prête à intégrer des tests de concordance de script dans sa formation initiale ? Étude de faisabilité et d’acceptabilité
Contexte : La réforme de la formation en physiothérapie en France a été marquée par la montée en charge des concepts de compétence, de raisonnement clinique, d’incertitude et d’Evidence-Based Practice. Les tests de concordance de script (TCS) sont des outils pédagogiques permettant de répondre à ces nouveaux besoins mais leur utilisation en physiothérapie française n’est pas décrite à ce jour. Objectifs : Cette étude avait pour objectifs : (1) d’étudier la faisabilité de création et administration d’une séquence de TCS dans le contexte de formation initiale de physiothérapie française ; (2) d’étudier la qualité de la séquence créée et (3) d’étudier l’acceptabilité de ce dispositif pour la population d’étudiants. Méthodes : Une séquence TCS spécifique au champ musculo-squelettique, comportant 25 vignettes cliniques, soit 75 items, a été créée puis étalonnée par 16 panélistes. Elle a été soumise à des étudiants de cinquième année de physiothérapie issus de quatre instituts de formation en physiothérapie et des professionnels en activité. La faisabilité, la qualité et l’acceptabilité ont été évaluées grâce à une analyse psychométrique et un questionnaire d’opinion soumis aux étudiants et aux panélistes. Résultats : Le test a été administré à 206 étudiants et 51 professionnels. L’analyse psychométrique de la séquence optimisée (66 items) montre une validité et une fidélité satisfaisante. Les questionnaires d’opinion montrent un accueil très favorable. Conclusion : La faisabilité et l’acceptabilité des TCS semblent favorables à une implantation et un développement en formation initiale de physiothérapie française.
- 13 July 2023
- Published by EDP Sciences in Pédagogie Médicale
- Vol. 24 (4) , 229-240
La physiothérapie française est-elle prête à intégrer des tests de concordance de script dans sa formation initiale ? Étude de faisabilité et d’acceptabilité
Contexte : La réforme de la formation en physiothérapie en France a été marquée par la montée en charge des concepts de compétence, de raisonnement clinique, d’incertitude et d’Evidence-Based Practice. Les tests de concordance de script (TCS) sont des outils pédagogiques permettant de répondre à ces nouveaux besoins mais leur utilisation en physiothérapie française n’est pas décrite à ce jour. Objectifs : Cette étude avait pour objectifs : (1) d’étudier la faisabilité de création et administration d’une séquence de TCS dans le contexte de formation initiale de physiothérapie française ; (2) d’étudier la qualité de la séquence créée et (3) d’étudier l’acceptabilité de ce dispositif pour la population d’étudiants. Méthodes : Une séquence TCS spécifique au champ musculo-squelettique, comportant 25 vignettes cliniques, soit 75 items, a été créée puis étalonnée par 16 panélistes. Elle a été soumise à des étudiants de cinquième année de physiothérapie issus de quatre instituts de formation en physiothérapie et des professionnels en activité. La faisabilité, la qualité et l’acceptabilité ont été évaluées grâce à une analyse psychométrique et un questionnaire d’opinion soumis aux étudiants et aux panélistes. Résultats : Le test a été administré à 206 étudiants et 51 professionnels. L’analyse psychométrique de la séquence optimisée (66 items) montre une validité et une fidélité satisfaisante. Les questionnaires d’opinion montrent un accueil très favorable. Conclusion : La faisabilité et l’acceptabilité des TCS semblent favorables à une implantation et un développement en formation initiale de physiothérapie française.
- Open Access
- 24 September 2022
- Published by Springer Nature in EURASIP Journal on Wireless Communications and Networking
- Vol. 2022 (1) , 1-26
Low-complexity hybrid interference cancellation for sparse code multiple access
Sparse Code Multiple Access (SCMA) is one of Non Orthogonal Multiple Access (NOMA) candidates for 5G, the fifth generation mobile network. Multiple overlapped blocks of SCMA code are transmitted per frequency layer which compels the receiver to cancel unwanted SCMA code blocks. Thanks to the sparsity of SCMA, Message Passing Algorithm (MPA) achieves near-optimal performance. Nevertheless, this process is time-consuming and has a high degree of complexity even if Max-Log Algorithm is used. The major contribution of this paper is to propose a new decoding scheme called Hybrid Interference Cancellation (HIC) to reduce time processing without degrading a target Bit Error Rate (BER). The HIC decodes and removes the strongest user, reducing the complexity of Log Domain MPA decoding of remaining users, followed by a Low Density Parity Code (LDPC) decoder. The interference cancellation decoder is either a hard interference cancellation or a soft interference cancellation. The originality of the paper is to calculate a threshold value based on power measurements to decide whether hard decoder or soft decoder should be used to reach the BER target with a lower complexity. Results show a significant reduction in terms of complexity as compared to the traditional MPA process for the same values of BER.
- 24 September 2022
- Published by Springer Nature in EURASIP Journal on Wireless Communications and Networking
- Vol. 2022 (1) , 1-26
Open AccessLow-complexity hybrid interference cancellation for sparse code multiple access
Sparse Code Multiple Access (SCMA) is one of Non Orthogonal Multiple Access (NOMA) candidates for 5G, the fifth generation mobile network. Multiple overlapped blocks of SCMA code are transmitted per frequency layer which compels the receiver to cancel unwanted SCMA code blocks. Thanks to the sparsity of SCMA, Message Passing Algorithm (MPA) achieves near-optimal performance. Nevertheless, this process is time-consuming and has a high degree of complexity even if Max-Log Algorithm is used. The major contribution of this paper is to propose a new decoding scheme called Hybrid Interference Cancellation (HIC) to reduce time processing without degrading a target Bit Error Rate (BER). The HIC decodes and removes the strongest user, reducing the complexity of Log Domain MPA decoding of remaining users, followed by a Low Density Parity Code (LDPC) decoder. The interference cancellation decoder is either a hard interference cancellation or a soft interference cancellation. The originality of the paper is to calculate a threshold value based on power measurements to decide whether hard decoder or soft decoder should be used to reach the BER target with a lower complexity. Results show a significant reduction in terms of complexity as compared to the traditional MPA process for the same values of BER.
- Open Access
- 9 May 2022
- Published by Springer Nature in Research Square
Low-complexity Hybrid Interference Cancellation for Sparse Code Multiple Access
Sparse code multiple access (SCMA) is one of Non Orthogonal Multiple Access (NOMA) candidate for 5G mobile communications. Multiple overlapped blocks of SCMA code are transmitted per frequency layer which compels the receiver to cancel unwanted SCMA code blocks. Thanks to the sparsity of SCMA, Message Passing Algorithm (MPA) achieves near-optimal performance. Nevertheless process is time-consuming and has a high degree of complexity even if Max-Log algorithm is used. In this paper we propose a Hybrid Interference Cancellation with Log Domain MPA algorithm (HIC-MPA) which uses either hard interference cancellation or soft interference cancellation following by a LDPC decoder. The choice of interference cancellation decoder depends on a threshold value based on power measurements. Results show a significant reduction in terms of complexity as compared to the traditional MPA process for the same values of Bit Error Rate (BER).
- 9 May 2022
- Published by Springer Nature in Research Square
Open AccessLow-complexity Hybrid Interference Cancellation for Sparse Code Multiple Access
Sparse code multiple access (SCMA) is one of Non Orthogonal Multiple Access (NOMA) candidate for 5G mobile communications. Multiple overlapped blocks of SCMA code are transmitted per frequency layer which compels the receiver to cancel unwanted SCMA code blocks. Thanks to the sparsity of SCMA, Message Passing Algorithm (MPA) achieves near-optimal performance. Nevertheless process is time-consuming and has a high degree of complexity even if Max-Log algorithm is used. In this paper we propose a Hybrid Interference Cancellation with Log Domain MPA algorithm (HIC-MPA) which uses either hard interference cancellation or soft interference cancellation following by a LDPC decoder. The choice of interference cancellation decoder depends on a threshold value based on power measurements. Results show a significant reduction in terms of complexity as compared to the traditional MPA process for the same values of Bit Error Rate (BER).
- Open Access
- 1 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Potential feedback control for data scheduling in LTE cellular networks
This article deals with a new Quality of Service (QoS) aware Two-Level Scheduler (TLS) for real-time (RT) data flows in downlink transmission of Long Term Evolution (LTE) cellular networks. It consists of two distinct scheduler levels. At the upper-level scheduler, the Potential Feedback Controller (PFC) determines the quota of data to transmit in order to meet the delay constraints of RT data flows while, at the lower-lever scheduler, the Proportional Fair (PF) scheduler is used to reach a high fairness among Users (UEs). The PFC is well suited for the upper-level scheduler since it maintains the queue length as close as possible to zero which leads to a low Packet Loss Ratio (PLR). A comparison, by using LTE-Sim simulator, with well-known QoS aware scheduling methods Frame Level Scheduler (FLS), Exponential (EXP)-rule and Logarithmic (LOG)-rule has been provided which shows that our proposed TLS outperforms the EXP-rule and LOG-rule scheduling methods and it slightly decreases the PLR of RT data flows compared to the FLS scheduling method while it significantly reduces the computation time.
- 1 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Open AccessPotential feedback control for data scheduling in LTE cellular networks
This article deals with a new Quality of Service (QoS) aware Two-Level Scheduler (TLS) for real-time (RT) data flows in downlink transmission of Long Term Evolution (LTE) cellular networks. It consists of two distinct scheduler levels. At the upper-level scheduler, the Potential Feedback Controller (PFC) determines the quota of data to transmit in order to meet the delay constraints of RT data flows while, at the lower-lever scheduler, the Proportional Fair (PF) scheduler is used to reach a high fairness among Users (UEs). The PFC is well suited for the upper-level scheduler since it maintains the queue length as close as possible to zero which leads to a low Packet Loss Ratio (PLR). A comparison, by using LTE-Sim simulator, with well-known QoS aware scheduling methods Frame Level Scheduler (FLS), Exponential (EXP)-rule and Logarithmic (LOG)-rule has been provided which shows that our proposed TLS outperforms the EXP-rule and LOG-rule scheduling methods and it slightly decreases the PLR of RT data flows compared to the FLS scheduling method while it significantly reduces the computation time.