Global ETD Search

1	Abnormal Group Delay and Detection Latency in the Presence of Noise for Communication Systems Kayili, Levent 06 April 2010 (has links) Although it has been well established that abnormal group delay is a real physical phenomenon and is not in violation of Einstein causality, there has been little investigation into whether or not such abnormal behaviour can be used to reduce signal latency in practical communication systems in the presence of noise. In this thesis, we use time-varying probability of error to determine if abnormal group delay “channels” can offer reduced signal latency. Since the detection system plays a critical role in the analysis, three important detection systems are considered: the correlation, matched filter and envelope detection systems. Our analysis shows that for both spatially negligible microelectronic systems and spatially extended microwave systems, negative group delay “channels” offer reduced signal latency as compared to conventional “channels”. The results presented in the thesis can be used to design a new generation of electronic and microwave interconnects with reduced or eliminated signal latency. electrical engineering Einstein causality causality communication systems abnormal group delay abnormal group velocity superluminal group delay superluminal group velocity time-varying error probability signal latency detection system detection latency pulse advancement spatially extended systems negative group delay negative group velocity spatially negligible systems microwave circuits microelectronic interconnects channel relativistic causality electromagnetic dispersion physics signals 0544
2	Abnormal Group Delay and Detection Latency in the Presence of Noise for Communication Systems Kayili, Levent 06 April 2010 (has links) Although it has been well established that abnormal group delay is a real physical phenomenon and is not in violation of Einstein causality, there has been little investigation into whether or not such abnormal behaviour can be used to reduce signal latency in practical communication systems in the presence of noise. In this thesis, we use time-varying probability of error to determine if abnormal group delay “channels” can offer reduced signal latency. Since the detection system plays a critical role in the analysis, three important detection systems are considered: the correlation, matched filter and envelope detection systems. Our analysis shows that for both spatially negligible microelectronic systems and spatially extended microwave systems, negative group delay “channels” offer reduced signal latency as compared to conventional “channels”. The results presented in the thesis can be used to design a new generation of electronic and microwave interconnects with reduced or eliminated signal latency. electrical engineering Einstein causality causality communication systems abnormal group delay abnormal group velocity superluminal group delay superluminal group velocity time-varying error probability signal latency detection system detection latency pulse advancement spatially extended systems negative group delay negative group velocity spatially negligible systems microwave circuits microelectronic interconnects channel relativistic causality electromagnetic dispersion physics signals 0544
3	On Weak Limits and Unimodular Measures Artemenko, Igor 14 January 2014 (has links) In this thesis, the main objects of study are probability measures on the isomorphism classes of countable, connected rooted graphs. An important class of such measures is formed by unimodular measures, which satisfy a certain equation, sometimes referred to as the intrinsic mass transport principle. The so-called law of a finite graph is an example of a unimodular measure. We say that a measure is sustained by a countable graph if the set of rooted connected components of the graph has full measure. We demonstrate several new results involving sustained unimodular measures, and provide thorough arguments for known ones. In particular, we give a criterion for unimodularity on connected graphs, deduce that connected graphs sustain at most one unimodular measure, and prove that unimodular measures sustained by disconnected graphs are convex combinations. Furthermore, we discuss weak limits of laws of finite graphs, and construct counterexamples to seemingly reasonable conjectures. tree automorphism group ball path connected component rooted birooted graph Cayley converges weakly extreme point mass transport principle involution invariance law neighbourhood orbit rigid subgraph unimodular unimodularity vertex-transitive walk weak limit weak convergence probability measure barred binary tree bi-infinite path first ancestor judicial lawless negligible stabilizer sustained strictly sustained random graph
4	On Weak Limits and Unimodular Measures Artemenko, Igor January 2014 (has links) In this thesis, the main objects of study are probability measures on the isomorphism classes of countable, connected rooted graphs. An important class of such measures is formed by unimodular measures, which satisfy a certain equation, sometimes referred to as the intrinsic mass transport principle. The so-called law of a finite graph is an example of a unimodular measure. We say that a measure is sustained by a countable graph if the set of rooted connected components of the graph has full measure. We demonstrate several new results involving sustained unimodular measures, and provide thorough arguments for known ones. In particular, we give a criterion for unimodularity on connected graphs, deduce that connected graphs sustain at most one unimodular measure, and prove that unimodular measures sustained by disconnected graphs are convex combinations. Furthermore, we discuss weak limits of laws of finite graphs, and construct counterexamples to seemingly reasonable conjectures. tree automorphism group ball path connected component rooted birooted graph Cayley converges weakly extreme point mass transport principle involution invariance law neighbourhood orbit rigid subgraph unimodular unimodularity vertex-transitive walk weak limit weak convergence probability measure barred binary tree bi-infinite path first ancestor judicial lawless negligible stabilizer sustained strictly sustained random graph

1

Page generated in 0.027 seconds