Seminar Themen

In a public-key cryptosystem each user has an associated public key with which other users can send them an encrypted message. The correspondence between the user's identity and their public key is verified using certificates which are issued by some trusted authority.

Identity-based encryption (IBE) offers an alternate approach where one only needs the identity of the recipient to send them an encrypted message. The recipient then uses a secret key associated only with their identity to decrypt the message.

Attribute-based encryption (ABE) is a modification of the IBE setting for a system where users have attributes associated to them and a data owner wishes to send encrypted messages to subsets of users based on their attributes.

The goal of this seminar is to build up from the idea of an IBE proposed by Shamir in [1] on to the first paper on ABE by Sahai and Waters [2]. From there, two classes of ABEs are studied, namely ciphertext policy [3] and key policy ABEs [4].

[1] Shamir, A. (1985). Identity-Based Cryptosystems and Signature Schemes. In: Blakley, G.R., Chaum, D. (eds) Advances in Cryptology. CRYPTO 1984. Lecture Notes in Computer Science, vol 196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39568-7_5

[2] Sahai, A., Waters, B. (2005). Fuzzy Identity-Based Encryption. In: Cramer, R. (eds) Advances in Cryptology – EUROCRYPT 2005. EUROCRYPT 2005. Lecture Notes in Computer Science, vol 3494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11426639_27

[3] J. Bethencourt, A. Sahai and B. Waters, "Ciphertext-Policy Attribute-Based Encryption," 2007 IEEE Symposium on Security and Privacy (SP '07), Berkeley, CA, USA, 2007, pp. 321-334, doi: 10.1109/SP.2007.11.

[4] Vipul Goyal, Omkant Pandey, Amit Sahai, and Brent Waters. 2006. Attribute-based encryption for fine-grained access control of encrypted data. In Proceedings of the 13th ACM conference on Computer and communications security (CCS '06). Association for Computing Machinery, New York, NY, USA, 89–98. https://doi.org/10.1145/1180405.1180418

The GPT cryptosystem, introduced by Gabidulin, Paramonov, and Tretjakov in 1991 [1], is one of the earliest public-key encryption schemes based on rank-metric codes. It adapts the McEliece framework to use Gabidulin codes, whose rank-metric structure allows for much more compact public keys than traditional Hamming-metric constructions. The strong algebraic structure of these codes, however, also exposes weaknesses that led to several successful structural attacks, most notably those developed by Overbeck [2].
The focus is on understanding the design of the GPT scheme, its underlying rank-metric hardness assumptions, and the mechanisms by which its structure was exploited. Insights from these attacks are essential for appreciating later developments in rank-metric encryption, such as Loidreau’s 2017 construction [3].

[1] Gabidulin, E.M., Paramonov, A.V. and Tretjakov, O.V., 1991, April. Ideals over a non-commutative ring and their application in cryptology. In Workshop on the Theory and Application of Cryptographic Techniques (pp. 482-489). Berlin, Heidelberg: Springer Berlin Heidelberg.

[2] Overbeck, R., 2008. Structural attacks for public key cryptosystems based on Gabidulin codes. Journal of cryptology, 21(2), pp.280-301.

[3] Loidreau, P., 2017, June. A new rank metric codes based encryption scheme. In International Workshop on Post-Quantum Cryptography (pp. 3-17). Cham: Springer International Publishing.

Smoothing is a technique that helps to study computational problems in cryptography. While it has been primarily applied to lattice-based problems, recent work has begun to explore its relevance in the context of coding problems.

In this seminar, you will learn about the different coding problems that appear in known reductions, as well as the techniques used to establish these reductions. Particular attention will be given to the challenges that arise when attempting to extend these techniques to more general classes of codes. These obstacles will be examined, discussed, and presented in detail.

Reference papers:

- Brakerski, Zvika, et al. "Worst-case hardness for LPN and cryptographic hashing via code smoothing." (https://eprint.iacr.org/2018/279)
- Yu, Yu, and Jiang Zhang. "Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN." (https://eprint.iacr.org/2020/870)
- Debris–Alazard, Thomas, and Nicolas Resch. "Worst and average case hardness of decoding via smoothing bounds." (https://eprint.iacr.org/2022/1744)

The document exchange problem considers the scenario where two parties have slightly different versions of the same file, and one of them wants to update their version to match the other. Instead of sending the whole file, the idea is to share only a small description of the changes. Substring edits, where changes happen locally within the file, are a natural way to model these differences. This seminar will examine how coding theory can be applied to enhance the efficiency of document exchange under substring edits.

Post-quantum cryptography (PQC) has been an active area of research since the seminal work of Shor. 
Indeed, most public-key cryptography currently deployed (such as RSA and elliptic-curve-based schemes) is vulnerable to quantum adversaries. 
This applies in particular to public-key encryption (PKE) schemes.  
An attacker could record encrypted traffic and later decrypt it once a sufficiently capable quantum computer becomes available - a strategy known as "harvest now, decrypt later."

Post-quantum secure alternatives can be constructed from hard problems on codes and lattices. The recently standardized Kyber and HQC follow an encryption-based approach, while, e.g., NewHope is based on a key reconciliation mechanism:
Alice and Bob obtain noise variants of a common secret, and error correction removes this noise, allowing them to agree on the same shared key.

This project will survey constructions for exchanging a key in code-based and lattice-based cryptography. These constructions are to be categorized based on key properties, such as underlying metric, bandwidth requirements, and underlying assumptions.
An overview of the key techniques is to be developed, with particular focus on the question of whether they can be transferred from codes to lattices and vice versa. The project requires reading and understanding several references; a good starting point can be the following works:

Aguilar-Melchor, Carlos, et al. "Efficient encryption from random quasi-cyclic codes." IEEE Transactions on Information Theory 64.5 (2018): 3927-3943.

Bos, Joppe, et al. "CRYSTALS-Kyber: a CCA-secure module-lattice-based KEM." 2018 IEEE European symposium on security and privacy (EuroS&P). IEEE, 2018.

Alkim, Erdem, et al. "Post-quantum Key Exchange — A new hope." 25th USENIX security symposium (USENIX Security 16). 2016.

Fully Homomorphic Encryption (FHE) enables computations on encrypted data without decryption, providing a powerful tool for privacy-preserving applications.

In this seminar, the student will study the BFV scheme, a widely used homomorphic encryption construction. The main goal is to understand the underlying mathematics, the design rationale of BFV, and how it fits into the broader landscape of lattice-based cryptography.

The student is expected to:

• Review the foundational works by Brakerski and by Fan–Vercauteren.
• Summarize the scheme’s construction, security assumptions, and noise management.
• Present connections to applications and implementations.

References:

[1] Z. Brakerski, "Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP," Advances in Cryptology – CRYPTO 2012, Lecture Notes in Computer Science, vol. 7417, Springer, 2012, pp. 868–886. doi: 10.1007/978-3-642-32009-5_50

[2] J. Fan and F. Vercauteren, "Somewhat Practical Fully Homomorphic Encryption," IACR Cryptology ePrint Archive, vol. 2012/144, 2012. Available:

It has been widely acknowledged that machine learning models can leak a significant amount of (potentially private) information about their training data. Analyzing the amount of information leaked about the training data is important to judge the model's privacy. In practice, so-called membership inference attacks [1,2] are employed for such a privacy audit. A membership inference attack tries to predict whether a particular data sample was used in the training of a machine learning model. Besides empirical research, membership inference attacks have been put on a theoretical foundation through a Bayesian decision framework [3].

The goal of this seminar topic is to understand state-of-the-art membership inference attacks [1,2] and the Bayesian decision framework [3]. Students are encouraged to produce their own results using openly available implementations.

[1] N. Carlini, S. Chien, M. Nasr, S. Song, A. Terzis and F. Tramèr, "Membership Inference Attacks From First Principles," 2022 IEEE Symposium on Security and Privacy (SP), 2022.

[2] S. Zarifzadeh, P. Liu, R. Shokri, "Low-Cost High-Power Membership Inference Attacks," ICML 2024.

[3] A. Sablayrolles, M. Douze, C. Schmid, Y. Ollivier, H. Jegou, "White-box vs Black-box: Bayes Optimal Strategies for Membership Inferenc," Proceedings of the 36th International Conference on Machine Learning, 2019.

Voraussetzungen

The McEliece cryptosystem is a well-known public-key encryption scheme using Goppa codes in the Hamming metric. The GPT cryptosystem is the rank-metric counterpart of this scheme using Gabidulin codes. While this promises much better message security than McEliece, it has been subject to several successful key attacks, most prominent of which is known as Overbeck's attack [1, 2].

The task of the student is to understand the different proposed versions of the GPT cryptosytem and how they were attacked. Further, the student will look at a more recent version of this scheme [3] which has so far resisted Overbeck's attack.

[1] R. Overbeck, “Public Key Cryptography based on Coding Theory,” phd, Technische Universität Darmstadt, Darmstadt, 2007. Accessed: Oct. 01, 2024. [Online]. Available: https://tuprints.ulb.tu-darmstadt.de/823/
[2] R. Overbeck, “Structural Attacks for Public Key Cryptosystems based on Gabidulin Codes,” J Cryptol, vol. 21, no. 2, pp. 280–301, Apr. 2008, doi: 10.1007/s00145-007-9003-9.
[3] P. Loidreau, “A New Rank Metric Codes Based Encryption Scheme,” in Post-Quantum Cryptography, T. Lange and T. Takagi, Eds., Cham: Springer International Publishing, 2017, pp. 3–17. doi: 10.1007/978-3-319-59879-6_1.

Voraussetzungen

The absorption channel is a novel communication model inspired by neuronal information transmission. This model is particularly relevant to in-vivo nano-machines, emerging medical applications, and brain-machine interfaces that communicate via the nervous system.

Specifically, an absorption error occurs when a transmitted symbol is completely lost or "absorbed" during communication, rather than being substituted or distorted. This means the receiver gets fewer symbols than were originally sent, creating a form of synchronization error.

?[1] focusses on developing error-correcting codes tailored to address absorption errors within this channel. It also proposes specific constructions to correct a single absorption error for alphabets of size three or more. Additionally, the paper applies syndrome compression techniques with pre-coding to develop subcodes capable of correcting multiple absorption errors while maintaining low redundancy. Efficient encoding and decoding algorithms are provided for each proposed code, enhancing their practical applicability in communication systems affected by absorption errors. ?

[2] extends this work by introducing novel methods for constructing non-binary error-correcting codes tailored to address absorption errors. The authors propose novel code constructions that effectively correct single and multiple absorption errors while minimizing redundancy. Their approach involves partitioning codewords into segments and applying specialized coding techniques to each segment, enabling efficient detection and correction of absorption errors.

[1] Z. Ye, W. Yu, and O. Elishco, “Codes Over Absorption Channels,” IEEE Trans. Inform. Theory, pp. 1–1, 2024, doi: 10.1109/TIT.2023.3346882.

[2] T. T. Nguyen, K. Cai, T. Q. S. Quek, and K. A. S. Immink, “Efficient Constructions of Non-Binary Codes Over Absorption Channels,” in 2024 IEEE International Symposium on Information Theory (ISIT), Athens, Greece: IEEE, Jul. 2024, pp. 1718–1723. doi: 10.1109/ISIT57864.2024.10619179.

Information theory and combinatorics are deeply intertwined. Beyond the use of combinatorics in coding theory and compression, there are many -sometimes surprising- connections.
One such connection is the use of graph entropy in combinatorial existence proofs.

This seminar topic is about explaining the proof technique introduced in [1] and [2] and applied in [3]. The goal is a tutorial-style paper with the focus on clear exposition through well chosen worked examples and visualizations.

[1] M. Fredman, and J. Komlós, On the Size of Separating Systems and Perfect Hash Functions, SIAM J. Alg. Disc. Meth., 5 (1984), pp. 61-68.

[2] J. Körner, Fredman-Komlós bounds and information theory, SIAM J. on Algebraic and Discrete Meth., 4(7), (1986), pp. 560–570.

[3] N. Alon, E. Fachini, and J. Körner, Locally Thin Set Families, Combinatorics, Probability and Computing, vol. 9 (Nov. 2000), pp. 481–488.

5G and beyond wireless communication systems gave/are expected to give rise to many new applications with stringent requirements that were not achievable with 4G or earlier systems. These requirements are: low latency, high reliability, battery life maximization among others.

To this extent, short blocklength coding has gained particular interest, and new research on efficient coding schemes is emerging. An idea previously discussed in the literature is the Ordered Statistics Decoder (OSD) [1]. Recent works in literature are addressing its strengths, its shortcomings and are suggesting ways to make this decoder more practical and efficient in the short blocklength regime.

The objective of the student is to study the seminal paper [1], that introduces the idea of ordered statistics decoding and be able to describe how the decoder works, what are its strengths, what are its limitations. Then, the student is expected to understand and explain the way of working of newer algorithms [2] [3] and explain if and how they improve performance.

[1] Soft-decision decoding of linear block codes based on ordered statistics | IEEE Journals & Magazine | IEEE Xplore

[2] Partial Ordered Statistics Decoding with Enhanced Error Patterns | IEEE Conference Publication | IEEE Xplore

[3] Box and match techniques applied to soft-decision decoding | IEEE Journals & Magazine | IEEE Xplore

Voraussetzungen

In reference [1], the capacity of multi-input multi-output (MIMO) channels with output quantization is investigated. The student is expected to understand the relevant definitions and concepts, and is encouraged to explore the related results presented in reference [2].

[1] Khalili, Abbas, et al. "On MIMO channel capacity with output quantization constraints." 2018 IEEE International Symposium on Information Theory (ISIT). IEEE, 2018.

[2] Rini, Stefano, et al. "A general framework for MIMO receivers with low-resolution quantization." 2017 IEEE Information Theory Workshop (ITW). IEEE, 2017.

Deep learning models have become highly popular and are applied across many domains, which makes the efficiency of the training process increasingly important. Since neural network architectures are often inspired by the human brain, it is natural to ask whether the training order of examples should also mirror human learning. 

The concept of curriculum learning was first introduced by Bengio et al. [1], where training samples are presented in a structured order, from “easy” to “hard”, rather than being presented randomly. This approach aims to achieve faster convergence and potentially better generalization. Building on this seminal idea, various strategies have been proposed. 

This project focuses on two influential yet conceptually distinct approaches [2], [3]. One takes an adaptive, online approach, where the curriculum is guided by the model’s learning progress [2], while the other uses an offline, transfer-learning approach, where a pre-trained model is used to estimate the difficulty of examples [3]. The student is expected to study these works carefully, develop an understanding of both their theoretical foundations and practical methodologies, and prepare a comparative summary of the two.

[1] Bengio, Y., Louradour, J., Collobert, R., & Weston, J. (2009). Curriculum learning. In Proceedings of the 26th Annual International Conference on Machine Learning (pp. 41–48).

[2] Graves, A., Bellemare, M. G., Menick, J., Munos, R., & Kavukcuoglu, K. (2017). Automated curriculum learning for neural networks. In Proceedings of the 34th International Conference on Machine Learning (pp. 1311–1320).

[3] Weinshall, D., Cohen, G., & Amir, D. (2018). Curriculum learning by transfer learning: Theory and experiments with deep networks. In Proceedings of the 35th International Conference on Machine Learning (pp. 5238–5246).

Due to the inherent data heterogeneity, partial client participation, and the direct impact of the client updates on the global model, fairness and robustness are two important concerns in federated learning. 

Fairness can be evaluated by the performance (accuracy) of the global model on clients' local data, while robustness measures the system's resilience to misbehavior from malicious clients.

Statistical heterogeneity often underlines the tension between accuracy, fairness, and robustness. Robust aggregations mitigate the impact of outliers, which also filter out informative updates and violate fairness, and up-weighting the importance of rare clients, the model can easily overfit to corrupted devices.

In this seminar, you will learn the strategies to tackle fairness and robustness simultaneously in the federated learning setting. The following papers can be a good starting point.

1. Li, Tian, et al. "Fair resource allocation in federated learning." arXiv preprint arXiv:1905.10497 (2019).
2. Blanchard, Peva, et al. "Machine learning with adversaries: Byzantine tolerant gradient descent." Advances in neural information processing systems 30 (2017).
3. Li, Tian, et al. "Ditto: Fair and robust federated learning through personalization." International conference on machine learning. PMLR, 2021.

How can wireless communication systems remain undetectable when monitored by mobile aerial wardens (e.g., drones)? The cryptography secures the content of messages but does not hide their existence. In this seminar, we will explore low probability of detection (LPD) communication, focusing on covert communication under multi-UAV surveillance.

The provided papers introduce a novel method that combines Graph Neural Networks (GNNs) with Koopman operator theory to predict UAV trajectories and enable real-time covert communication in wireless ad-hoc networks. In this method, GNNs are used to model the spatial interactions between multiple UAVs using a mechanism known as message passing, where each UAV node updates its internal state based on information received from its neighbors in the network graph. This helps capture complex group dynamics more accurately.

Students will learn how such predictions allow ground nodes to adapt their transmission behavior to remain below detection thresholds. They will also see how data-driven techniques complement traditional communication-theoretic approaches to security.

Voraussetzungen

Field of Research & Contents of the Paper

Time-varying phase noise is of interest in many communication scenarios, including high-frequency wireless channels and coherent optical communications. 

In [1], the authors introduce an iterative receiver for channels distorted by phase noise. They use strong correlations in the phase noise process for mitigation. A downside is the requirement for pilot insertion, effectively decreasing spectral efficiency. 

Expectation propagation (EP) [2][3, Ch. 10, Sec. 10.7] has been recently used to enhance the receiver design, thereby mitigating the need for pilot insertion [4]. 

The task of this seminar paper is to

1. summarize the system model used in [1],[4],
2. analyze the approach, benefits, and drawbacks in [1],
3. explain the principles of EP, and
4. compare how EP modifies the receiver in [4] relative to [1]. 

A successful submission provides intuition for tasks 1-3 and a thorough analysis of the differences between [1] and [4] for task 4. 

[1] G. Colavolpe, A. Barbieri and G. Caire, "Algorithms for iterative decoding in the presence of strong phase noise," in IEEE Journal on Selected Areas in Communications, 2005.

[2] T. P. Minka, "Expectation Propagation for approximate Bayesian inference," in Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence, 2001. 

[3] C.M. Bishop, "Pattern Recognition and Machine Learning," Springer, 2006.

[4] E. Conti, A. Vannucci, A. Piemontese, G. Colavolpe, "Phase Noise Detection via Expectation Propagation and Related Algorithms", arXiv, 2024.

Organization of the Supervision

• After you have successfully applied for the topic, we will hold a kick-off meeting to discuss all necessary details for the upcoming work. After that, the responsibility for the seminar paper is all on you. You can always contact me, ask questions, and request meetings, and I am happy to assist you along the way. However, I need you to be proactive.
• I can provide comments on your work (e.g., the paper's outline and some paragraphs you have already written) at any time you need them and guide you as you prepare your paper and presentation. Regarding final drafts, I comment on one complete version of your paper. Ideally, this would mean that you do some work (literature research, the paper's outline, the body, the introduction, and the conclusion), and we discuss your results after every step. Ultimately, you provide me with one final draft, and I will comment on it. The draft must be handed in at least 10 days prior to the paper submission deadline. This method is more successful and instructive than writing a paper a few days before the deadline.
• Beware that when I comment on your work, this is not the same as a correction. My comments are suggestions for improving the quality of the work, but I cannot spend the time searching for and correcting every mistake that exists or could be made (this would also not align with the seminar's purpose).
• I expect solid research. There should be two significant references. Those are papers you know in detail and that majorly impact your work. Of course, they are always accompanied by supporting references.

Voraussetzungen

Modern communication systems increasingly employ probabilistic amplitude shaping (PAS) to close the gap to the Shannon capacity by generating non-uniform input distributions (typically approximating Maxwell–Boltzmann distributions). At the core of PAS lies the distribution matcher (DM), which maps uniformly distributed information bits into shaped sequences of amplitudes.

A central challenge is designing DMs that achieve low rate loss and low complexity.

Enumerative Sphere Shaping (ESS) addresses these challenges by restricting sequences to lie within a hypersphere in the energy domain. Instead of fixing symbol composition (as in CCDM), ESS selects sequences such that their total energy does not exceed a predefined radius. This approach results in competitive performance in the short blocklength regime.

The student will explore ESS [1][2], including its theoretical foundation in information and coding theory, algorithmic implementation, storage and computational complexity, and comparisons with other shaping methods such as CCDM and shell mapping [3]. 

[1] https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8850066

[2] https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=8895789&casa_token=sZch6uYNxusAAAAA:Oq9owJ8tNEA5puQv1Bai7enCei8nYMoPEwt9jO3q-9upB20dTKJPltXrbI7mPSKnsVs_nK_G

[3] https://www.mdpi.com/1099-4300/22/5/581

Voraussetzungen

The wiretap channel [1] describes a communication problem where the communication between Alice to Bob needs not only be reliable but also kept secret from an eavesdropper Eve. The additional secrecy constraint imposes new challenges on code design and may require new tools such as stochastic encoding to achieve the secrecy capacity [1], [2]. The student will read and understand the concept of secrecy capacity, and review practical coding schemes for the wiretap channel proposed in literature. The student will compare the different approaches and discuss the tradeoffs that appear.

[1] A. D. Wyner, “The wire-tap channel,” Bell Syst. Tech. J., vol. 54, no. 8,  pp. 1355–1387, Oct. 1975.
[2] I. Csiszár and J. Körner, “Broadcast channels with confidential messages,” IEEE Trans. Inf. Theory, vol. IT-24, no. 3, pp. 339–348, May 1978.

Voraussetzungen

Which is the right equation to solve within the domain of fiber optics?

It all boils down to the application scenario, to the interplay between the duration of the transmission pulse, the channel dynamic, and the desired level of accuracy.

The most accurate and computationally demanding model is provided by Maxwell's equations, while other equations (like Manakov equations and Schrödinger equations) can be obtained within certain assumptions.

Tasks of the student is to review the subject, pointing out typical scenarios, their relevant equation, the assumptions within which it has been derived, and a numerical method to solve it.

The student can refer to [Menyuk99] and references therein.

REFERENCES: 

[Menyuk99] Menyuk, C. R. "Application of multiple-length-scale methods to the study of optical fiber transmission." Journal of Engineering Mathematics 36.1 (1999): 113-136.

Voraussetzungen

As there are continuously increasing throughput demands on fiber optical networks, many types of multiplexing systems have become a hot topic for research as there is a need to better utilize the bandwidth resources of the optical fiber and increase spectral efficiency, some of these allow of unique joint Digital Signal Processing. Carrier phase estimation is an important aspect of DSP-based receivers, through carrier phase estimation the effects of laser phase noise are mitigated, the effects of laser phase noise are in general more important as systems become more spectrally efficient. Traditionally carrier and phase recovery is done per channel basis using either blind or data aided methods, however some methods are able to exploit correlation between the channels and other such properties to perform joint carrier and phase recovery.

This topic focuses mainly on joint carrier and phase recovery algorithms and their performance. This topic looks at Frequency Comb-Based Transmission Systems and how in those systems the phase coherence between the lines can be exploited to simplify or increase the performance of digital carrier phase recovery algorithms and comparisons are made between different algorithms and different pilot distributions over the channels.

Papers:

1. Frequency Comb-Based WDM Transmission Systems Enabling Joint Signal Processing, Lars Lundberg et al

2. Joint Carrier Recovery for DSP Complexity Reduction in Frequency Comb-Based Superchannel Transceivers, Lars Lundberg et al

3. Pilot-Aided Joint-Channel Carrier-Phase Estimation in Space-Division Multiplexed Multicore Fiber Transmission, Arni F. Alfredsson et al                

4. Optimization of Pilot-Aided Joint Phase Recovery for Frequency Comb-Based Wideband Transmission, Gabriele Di Rosa et al

Interested student please contact Muhammad Ahmed Leghari for further discussion

Contact: ahmed.leghari@adtran.com

Optical communication systems are the backbone of current communication network as they allow fast and reliable information exchange. However, the advent of new generation applications and services require an ever increasing demand for higher capacity, lower cost, and lower energy consumption. According to discussions in [1], because of the difference in the growth rates between the fiber capacity and the traffic demand, there is expected to be a capacity shortage within the next decade. 

Among several options for increasing the capacity of installed optical fibers, exploiting new wavelength bands appears to be a promising and economical solution. Extending the transmission bandwidth from conventional band (C-band) to multi-band (MB), researchers are aiming to transmit information over the entire single mode fiber spectrum. This will increase the optical capacity and thus postpone the need to deploy new fibers. 

The challenges for the realization of such multiband networks lie both in the development of key components – as well as in the modelling of the physical and network layers. 

The modelling of UWB systems enables to optimize the design of a given optical communication link to achieve maximum throughput, including finding optimal signal launch power, data rates, modulation formats, number of channels, and, in the case of hybrid-amplified links, also the Raman amplifier’s pump powers and frequencies. The Gaussian noise closed-form model (GN-CFM) expressions [2] have increasingly been used for rapid evaluation of nonlinear interference (NLI) noise, which, together with amplified spontaneous emission (ASE) noise and transceiver noise, define the received SNR. GN-CFM, in turn, can be used to optimize optical link parameters.

The main paper of the seminar work [3] uses the GN model discussed in [4] [5] to calculate optimum launch power per channel with the presence of Raman amplification. The student’s task is to deliver the steps they used in paper [3] as well as to understand the mechanics of a hybrid amplification schemes and GN model defined in [4] [5].  

[1] Essiambre, René-Jean and Robert W. Tkach. “Capacity Trends and Limits of Optical Communication Networks.” Proceedings of the IEEE 100 (2012): 1035-1055.

[2] D. Semrau, R. I. Killey, and P. Bayvel, “A Closed-Form Approximation of the Gaussian Noise Model in the Presence of Inter-Channel Stimulated Raman Scattering,” Journal of Lightwave Technology, vol. 37, pp. 1924–1936, May 2019.

[3] H. Buglia, E. Sillekens, L. Galdino, R. I. Killey, and P. Bayvel, "Impact of launch power optimisation in hybrid-amplified links," 2024. 

[4]H. Buglia, E. Sillekens, L. Galdino, R. I. Killey, and P. Bayvel, “Throughput maximisation in ultra-wideband hybrid-amplified links”, in Optical Fiber Communications Conference, 2024, Tu3H.5.

[5]H. Buglia, M. Jarmolovicius, L. Galdino, R. I. Killey, ? and P. Bayvel, “A closed-form expression for the Gaussian noise model in the presence of Raman amplification”, Journal of Lightwave Technology, vol. 42, no. 2, pp. 636–648, 2024. DOI: 10.1109/JLT.2023.3315127.