You searched for subject:(Linear Network Coding).
Showing records 1 – 27 of
27 total matches.
No search limiters apply to these results.
Oregon State University
1.
Adeli, Majid.
Security protocols for linear network coding.
Degree: PhD, Electrical and Computer Engineering, 2013, Oregon State University
URL: http://hdl.handle.net/1957/40079 
► Network coding, as the next generation of data routing protocols, enables each intermediate node in a network to process and encode its received data before…
(more)
▼ Network coding, as the next generation of data routing protocols, enables each intermediate node in a
network to process and encode its received data before forwarding it to the next nodes. Hence, the core idea in
network coding is to allow a
network to encode the data that is being transmitted through it. This revolutionary idea of data routing results in dynamic change in the content of each data packet. That is, in a
network coding setting, the original data symbols that are generated at the source nodes evolve hop-by-hop as they travel through the intermediate nodes. This property is clearly in stark contrast with the methods that are used in traditional data routing protocols, where every intermediate node acts as a plain relay. In other words, in the conventional data routing algorithms, every intermediate node solely replicates its incoming data on one or more of its outgoing channels. The criteria and the policies based on which an intermediate node makes decisions about the proper outgoing channels corresponding to each incoming packet depend on the employed routing protocol. Usually, each intermediate node utilizes a set of routing information (such as a routing table) in order to find the most cost effective path or paths to the final destinations. The cost criterion may be defined based on various parameters, but what is fixed is that the general goal is always to find the most optimum route that starts from the node and reaches the final destination at the lowest cost. Upon finding the best output channels, the intermediate node simply copies the pertinent data packet on the optimum channels without inflicting any change in the data payload. This common method of data routing in conventional routing protocols is indeed considered as a very special case in
network coding theory. The fact that in
network coding every node processes (encodes) its input data to create its outgoing symbols implies that the encoding operation at a given
network node can be expressed as a multi-input multi-output function which intakes the node's incoming data symbols as its input arguments and generates the outgoing data symbols departing the node as its outputs. Since each node in the
network has its own function, they are called "local encoding function". This way of looking at the
network coding operation enables us to simply define
linear and nonlinear
network coding as the
network codes with
linear and nonlinear local encoding functions, respectively. Hence, in
linear network coding, every node (including the source and the sink nodes) executes a
linear function on its incoming data symbols in order to generate its output symbols, while in nonlinear
network coding this function is nonlinear. The linearity indicates that every output symbol of a local encoding function can be stated as a unique
linear combination of its input symbols. Therefore, in
linear network coding, the encoding operations at the intermediate nodes can be stated as matrix multiplications. If
linear network coding is applied then each individual…
Advisors/Committee Members: Liu, Huaping (advisor), Bose, Bella (committee member).
Subjects/Keywords: Linear network coding; Computer security
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Adeli, M. (2013). Security protocols for linear network coding. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/40079
Chicago Manual of Style (16th Edition):
Adeli, Majid. “Security protocols for linear network coding.” 2013. Doctoral Dissertation, Oregon State University. Accessed April 10, 2021.
http://hdl.handle.net/1957/40079.
MLA Handbook (7th Edition):
Adeli, Majid. “Security protocols for linear network coding.” 2013. Web. 10 Apr 2021.
Vancouver:
Adeli M. Security protocols for linear network coding. [Internet] [Doctoral dissertation]. Oregon State University; 2013. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/1957/40079.
Council of Science Editors:
Adeli M. Security protocols for linear network coding. [Doctoral Dissertation]. Oregon State University; 2013. Available from: http://hdl.handle.net/1957/40079
Cornell University
2.
Lee, Seung.
Studies On Reliable And Energy-Efficient Wireless Sensor Networks For Mobile Healthcare Systems.
Degree: PhD, Electrical Engineering, 2011, Cornell University
URL: http://hdl.handle.net/1813/30729
► The outstanding improvement of communication and sensor technologies has not brought us only convenience to our lives but also envisioning our promising future with no…
(more)
▼ The outstanding improvement of communication and sensor technologies has not brought us only convenience to our lives but also envisioning our promising future with no barrier. Real-time information gathering, processing and communication in sensor networks have enriched people's lifestyles as they never imagined before. Wireless sensor networks (WSN) have provided people so much convenience with its variable applications such as environmental monitoring, human-centric applications, military applications, support for logistics, and etc. Most of all, researches on wireless body area networks (WBAN) have been revisited frequently for ubiquitous and affordable healthcare as healthcare related products and applications have obtained great attention for the people who are really concerned about their health, fitness as well as well-being lives. First, this dissertation examines true optimal routing with use of a novel load balancing aware routing algorithms for multipath wireless sensor networks. We propose an innovative multipath routing
network design scheme utilizing dynamic load-balancing aware feedback control system that can predict future traffic flow with preloaded traffic control. Then, we narrow down to wireless body area networks applying
linear network coding design approach in both
network and MAC layers. Through a discussion of the analysis, modeling, implementation, and simulation, we derive the solutions for the proposed designs that can significantly improve the reliability and energy-efficiency of the desired healthcare related systems.
Advisors/Committee Members: Wicker, Stephen B. (chair), Bojanczyk, Adam Wojciech (committee member), Doerschuk, Peter (committee member).
Subjects/Keywords: Wireless Body Area Network; Wireless Sensor Network; Linear Network Coding
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lee, S. (2011). Studies On Reliable And Energy-Efficient Wireless Sensor Networks For Mobile Healthcare Systems. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/30729
Chicago Manual of Style (16th Edition):
Lee, Seung. “Studies On Reliable And Energy-Efficient Wireless Sensor Networks For Mobile Healthcare Systems.” 2011. Doctoral Dissertation, Cornell University. Accessed April 10, 2021.
http://hdl.handle.net/1813/30729.
MLA Handbook (7th Edition):
Lee, Seung. “Studies On Reliable And Energy-Efficient Wireless Sensor Networks For Mobile Healthcare Systems.” 2011. Web. 10 Apr 2021.
Vancouver:
Lee S. Studies On Reliable And Energy-Efficient Wireless Sensor Networks For Mobile Healthcare Systems. [Internet] [Doctoral dissertation]. Cornell University; 2011. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/1813/30729.
Council of Science Editors:
Lee S. Studies On Reliable And Energy-Efficient Wireless Sensor Networks For Mobile Healthcare Systems. [Doctoral Dissertation]. Cornell University; 2011. Available from: http://hdl.handle.net/1813/30729
Brunel University
3.
Sabri, Dalia.
Performance analysis for network coding using ant colony routing.
Degree: PhD, 2011, Brunel University
URL: http://bura.brunel.ac.uk/handle/2438/6435
;
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553757
► The aim of this thesis is to conduct performance investigation of a combined system of Network Coding (NC) technique with Ant-Colony (ACO) routing protocol. This…
(more)
▼ The aim of this thesis is to conduct performance investigation of a combined system of Network Coding (NC) technique with Ant-Colony (ACO) routing protocol. This research analyses the impact of several workload characteristics, on system performance. Network coding is a significant key development of information transmission and processing. Network coding enhances the performance of multicast by employing encoding operations at intermediate nodes. Two steps should realize while using network coding in multicast communication: determining appropriate transmission paths from source to multi-receivers and using the suitable coding scheme. Intermediate nodes would combine several packets and relay them as a single packet. Although network coding can make a network achieve the maximum multicast rate, it always brings additional overheads. It is necessary to minimize unneeded overhead by using an optimization technique. On other hand, Ant Colony Optimization can be transformed into useful technique that seeks imitate the ant’s behaviour in finding the shortest path to its destination using quantities of pheromone that is left by former ants as guidance, so by using the same concept of the communication network environment, shorter paths can be formulated. The simulation results show that the resultant system considerably improves the performance of the network, by combining Ant Colony Optimization with network coding. 25% improvement in the bandwidth consumption can be achieved in comparison with conventional routing protocols. Additionally simulation results indicate that the proposed algorithm can decrease the computation time of system by a factor of 20%.
Subjects/Keywords: 621.38212; Ant colony optimization; Network coding application; Traditional routing algorithm; Butterfly network system; Linear network coding
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sabri, D. (2011). Performance analysis for network coding using ant colony routing. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/6435 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553757
Chicago Manual of Style (16th Edition):
Sabri, Dalia. “Performance analysis for network coding using ant colony routing.” 2011. Doctoral Dissertation, Brunel University. Accessed April 10, 2021.
http://bura.brunel.ac.uk/handle/2438/6435 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553757.
MLA Handbook (7th Edition):
Sabri, Dalia. “Performance analysis for network coding using ant colony routing.” 2011. Web. 10 Apr 2021.
Vancouver:
Sabri D. Performance analysis for network coding using ant colony routing. [Internet] [Doctoral dissertation]. Brunel University; 2011. [cited 2021 Apr 10].
Available from: http://bura.brunel.ac.uk/handle/2438/6435 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553757.
Council of Science Editors:
Sabri D. Performance analysis for network coding using ant colony routing. [Doctoral Dissertation]. Brunel University; 2011. Available from: http://bura.brunel.ac.uk/handle/2438/6435 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553757
Texas A&M University
4.
Zhang, Kai.
Fundamental Limits of Caching: Symmetry Structure and Coded Placement Schemes.
Degree: PhD, Electrical Engineering, 2020, Texas A&M University
URL: http://hdl.handle.net/1969.1/191938
► Caching is a technique to reduce the communication load in peak hours by prefetching contents during off-peak hours. In 2014, Maddah-Ali and Niesen introduced a…
(more)
▼ Caching is a technique to reduce the communication load in peak hours by prefetching contents
during off-peak hours. In 2014, Maddah-Ali and Niesen introduced a framework for coded
caching, and showed that significant improvement can be obtained compared to uncoded caching. Considerable efforts have been devoted to identify the precise information theoretic fundamental limit of such systems, however the difficulty of this task has also become clear. One of the reasons for this difficulty is that the original coded caching setting allows multiple demand types during delivery, which in fact introduces tension in the
coding strategy to accommodate all of them. We seek to develop a better understanding of the fundamental limit of coded caching.
In order to characterize the fundamental limit of the tradeoff between the amount of cache
memory and the delivery transmission rate of multiuser caching systems, various
coding schemes have been proposed in the literature. These schemes can largely be categorized into two classes, namely uncoded prefetching schemes and coded prefetching schemes. While uncoded prefetching schemes in general over order-wise optimal performance, coded prefetching schemes often have better performance at the low cache memory regime. At first sight it seems impossible to connect these two different types of
coding schemes, yet finding a unified
coding scheme that achieves the optimal memory-rate tradeoff is an important and interesting problem. We take the first step on this direction and provide a connection between the uncoded prefetching scheme proposed by Maddah Ali and Niesen (and its improved version by Yu et al.) and the coded prefetching scheme proposed by Tian and Chen. The intermediate operating points of this general scheme can in fact provide new memory-rate tradeoff points previously not known to be achievable in the literature. This new general
coding scheme is then presented and analyzed rigorously, which yields a new inner bound to the memory-rate tradeoff for the caching problem.
While studying the general case can be difficult, we found that studying the single demand type
systems will provide important insights. Motivated by these findings, we focus on systems where the number of users and the number of files are the same, and the demand type is when all files are being requested. A novel
coding scheme is proposed, which provides several optimal memory transmission operating points. Outer bounds for this class of systems are also considered, and their relation with existing bounds is discussed.
Outer-bounding the fundamental limits of coded caching problem is difficult, not only because
there are tons of information inequalities and problem specific equalities to choose from, but also because of identifying a useful subset (and often a quite small subset) from them and how to combine them to produce an improved outerbound is a hard problem. Information inequalities can be used to derive the fundamental limits of information systems. Many information inequalities and…
Advisors/Committee Members: Tian, Chao (advisor), Liu, Tie (committee member), Sprintson, Alex (committee member), Jiang, Anxiao (Andrew) (committee member).
Subjects/Keywords: Caching Network; Linear Programming; Symmetry; Coding Scheme; Fundamental limit
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Zhang, K. (2020). Fundamental Limits of Caching: Symmetry Structure and Coded Placement Schemes. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/191938
Chicago Manual of Style (16th Edition):
Zhang, Kai. “Fundamental Limits of Caching: Symmetry Structure and Coded Placement Schemes.” 2020. Doctoral Dissertation, Texas A&M University. Accessed April 10, 2021.
http://hdl.handle.net/1969.1/191938.
MLA Handbook (7th Edition):
Zhang, Kai. “Fundamental Limits of Caching: Symmetry Structure and Coded Placement Schemes.” 2020. Web. 10 Apr 2021.
Vancouver:
Zhang K. Fundamental Limits of Caching: Symmetry Structure and Coded Placement Schemes. [Internet] [Doctoral dissertation]. Texas A&M University; 2020. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/1969.1/191938.
Council of Science Editors:
Zhang K. Fundamental Limits of Caching: Symmetry Structure and Coded Placement Schemes. [Doctoral Dissertation]. Texas A&M University; 2020. Available from: http://hdl.handle.net/1969.1/191938
North-West University
5.
Von Solms, Suné.
Design of effective decoding techniques in network coding networks / Suné von Solms
.
Degree: 2013, North-West University
URL: http://hdl.handle.net/10394/9544
► Random linear network coding is widely proposed as the solution for practical network coding applications due to the robustness to random packet loss, packet delays…
(more)
▼ Random linear network coding is widely proposed as the solution for practical network coding
applications due to the robustness to random packet loss, packet delays as well as network topology
and capacity changes. In order to implement random linear network coding in practical scenarios
where the encoding and decoding methods perform efficiently, the computational complex coding
algorithms associated with random linear network coding must be overcome.
This research contributes to the field of practical random linear network coding by presenting
new, low complexity coding algorithms with low decoding delay. In this thesis we contribute to this
research field by building on the current solutions available in the literature through the utilisation
of familiar coding schemes combined with methods from other research areas, as well as developing
innovative coding methods.
We show that by transmitting source symbols in predetermined and constrained patterns from
the source node, the causality of the random linear network coding network can be used to create
structure at the receiver nodes. This structure enables us to introduce an innovative decoding
scheme of low decoding delay. This decoding method also proves to be resilient to the effects of
packet loss on the structure of the received packets. This decoding method shows a low decoding
delay and resilience to packet erasures, that makes it an attractive option for use in multimedia
multicasting.
We show that fountain codes can be implemented in RLNC networks without changing the
complete coding structure of RLNC networks. By implementing an adapted encoding algorithm at
strategic intermediate nodes in the network, the receiver nodes can obtain encoded packets that
approximate the degree distribution of encoded packets required for successful belief propagation
decoding.
Previous work done showed that the redundant packets generated by RLNC networks can be
used for error detection at the receiver nodes. This error detection method can be implemented
without implementing an outer code; thus, it does not require any additional network resources. We
analyse this method and show that this method is only effective for single error detection, not
correction.
In this thesis the current body of knowledge and technology in practical random linear network
coding is extended through the contribution of effective decoding techniques in practical network
coding networks. We present both analytical and simulation results to show that the developed
techniques can render low complexity coding algorithms with low decoding delay in RLNC networks.
Subjects/Keywords: Error detection;
Earliest decoding;
Fountain codes;
Luby Transform codes;
Practical network coding;
Random linear network coding
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Von Solms, S. (2013). Design of effective decoding techniques in network coding networks / Suné von Solms
. (Thesis). North-West University. Retrieved from http://hdl.handle.net/10394/9544
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Von Solms, Suné. “Design of effective decoding techniques in network coding networks / Suné von Solms
.” 2013. Thesis, North-West University. Accessed April 10, 2021.
http://hdl.handle.net/10394/9544.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Von Solms, Suné. “Design of effective decoding techniques in network coding networks / Suné von Solms
.” 2013. Web. 10 Apr 2021.
Vancouver:
Von Solms S. Design of effective decoding techniques in network coding networks / Suné von Solms
. [Internet] [Thesis]. North-West University; 2013. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/10394/9544.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Von Solms S. Design of effective decoding techniques in network coding networks / Suné von Solms
. [Thesis]. North-West University; 2013. Available from: http://hdl.handle.net/10394/9544
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Indian Institute of Science
6.
Prasad, Krishnan.
On Network Coding and Network-Error Correction.
Degree: PhD, Faculty of Engineering, 2018, Indian Institute of Science
URL: http://etd.iisc.ac.in/handle/2005/3452
► The paradigm of network coding was introduced as a means to conserve bandwidth (or equivalently increase throughput) in information flow networks. Network coding makes use…
(more)
▼ The paradigm of
network coding was introduced as a means to conserve bandwidth (or equivalently increase throughput) in information flow networks.
Network coding makes use of the fact that unlike physical commodities, information can be replicated and coded together at the nodes of the
network. As a result, routing can be strictly suboptimal in many classes of information flow networks compared to
network coding.
Network-error correction is the art of designing
network codes such that the sinks of the
network will be able to decode the required information in the presence of errors in the edges of the
network, known as
network-errors. The
network coding problem on a
network with given sink demands can be considered to have the following three major subproblems, which naturally also extend to the study of
network-error correcting codes, as they can be viewed as a special class of
network codes (a) Existence of a
network code that satisfies the demands (b) Efficient construction of such a
network code (c) Minimum alphabet size for the existence of such a
network code.
This thesis primarily considers
linear network coding and error correction and in- vestigates solutions to these issues for certain classes of
network coding and error correction problems in acyclic networks. Our contributions are broadly summarised as follows.
(1) We propose the use of convolutional codes for multicast
network-error correc- tion. Depending upon the number of
network-errors required to be corrected in the
network, convolutional codes are designed at the source of the multicast
network so that these errors can be corrected at the sinks of the networks as long as they are separated by certain number of time instants (for which we give a bound). In con- trast to block codes for
network-error correction which require large field sizes, using convolutional codes enables the field size of the
network code to be small. We discuss the performance of such networks under the BSC edge error model.
(2)Existing construction algorithms of block
network-error correcting codes require a rather large field size, which grows with the size of the
network and the number of sinks, and thereby can be prohibitive in large networks. In our work, we give an algorithm which, starting from a given
network-error correcting code, can obtain an- other
network code using a small field, with the same error correcting capability as the original code. The major step in our algorithm is to find a least degree irreducible poly- nomial which is coprime to another large degree polynomial. We utilize the algebraic properties of finite fields to implement this step so that it becomes much faster than the brute-force method. A recently proposed algorithm for
network coding using small fields can be seen as a special case of our algorithm for the case of no
network-errors.
(3)Matroids are discrete mathematical objects which generalize the notion of
linear independence of sets of vectors. It has been observed recently that matroids and
network coding share a deep connection, and several…
Advisors/Committee Members: Sundar Rajan, B (advisor).
Subjects/Keywords: Network Coding; Telecommmunication Networks; Coding Theory; Network Error Correcting Codes; Acyclic Network Coding; Network Error Correction; Informaton Theory; Instantaneous Networks; Network-Error Correction; Matroidal Error Correcting Networks; Unit-Delay Networks; Linear Network Coding; Network-Error Correcting Codes; Communication Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Prasad, K. (2018). On Network Coding and Network-Error Correction. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3452
Chicago Manual of Style (16th Edition):
Prasad, Krishnan. “On Network Coding and Network-Error Correction.” 2018. Doctoral Dissertation, Indian Institute of Science. Accessed April 10, 2021.
http://etd.iisc.ac.in/handle/2005/3452.
MLA Handbook (7th Edition):
Prasad, Krishnan. “On Network Coding and Network-Error Correction.” 2018. Web. 10 Apr 2021.
Vancouver:
Prasad K. On Network Coding and Network-Error Correction. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2018. [cited 2021 Apr 10].
Available from: http://etd.iisc.ac.in/handle/2005/3452.
Council of Science Editors:
Prasad K. On Network Coding and Network-Error Correction. [Doctoral Dissertation]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3452
Indian Institute of Science
7.
Vijayvaradharaj, T M.
Network Coding for Wirless Relaying and Wireline Networks.
Degree: PhD, Faculty of Engineering, 2017, Indian Institute of Science
URL: http://etd.iisc.ac.in/handle/2005/2892
► Network coding has emerged as an attractive alternative to routing because of the through put improvement it provides by reducing the number of channel uses.…
(more)
▼ Network coding has emerged as an attractive alternative to routing because of the through put improvement it provides by reducing the number of channel uses. In a wireless scenario, in addition, further improvement can be obtained through Physical layer
Network Coding (PNC), a technique in which nodes are allowed to transmit simultaneously, instead of transmitting in orthogonal slots. In this thesis, the design and analysis of
network coding schemes are considered, for wireless two-way relaying, multi-user Multiple Access Relay Channel (MARC) and wireline networks.
In a wireless two-way relay channel with PNC, the simultaneous transmissions of user nodes result in Multiple Access Interference (MAI) at there lay node. The harmful effect of MAI is the presence of signal set dependent deep channel fade conditions, called singular fade states, under which the minimum distance of the effective constellation at the relay become zero. Adaptively changing the
network coding map used at the relay according to channel conditions greatly reduces the impact of this MAI. In this work, we obtain these adaptive PNC maps, which are finite in number ,by completing partially filled Latin Squares and using graph vertex coloring. Having obtained the
network coding maps, the set of all possible channel realizations is quantized into a finite number of regions, with a specific
network coding map chosen in a particular region and such a quantization is obtained analytically for 2λ-PSK signal set. The performance of the adaptive PNC scheme for two-way relaying is analyzed and tight high SNR upper bounds are obtained for the average end-to-end symbol error probability, in terms of the average error probability of a point-to-point fading channel. The adaptive PNC scheme is generalized for two-way relaying with multiple antennas at the nodes.
As an alternative to the adaptive PNC scheme for two-way relaying, a Distributed Space Time
Coding (DSTC) scheme is proposed, which effectively re-moves the effect of singular fade states at the transmitting nodes itself without any Channel State Information at the Transmitter (CSIT), and without any need to change the PNC map as a function of channel fade conditions. It is shown that the singular fade states can be viewed equivalently as vector subspaces of C2, which are referred to as the singular fade subspaces. DSTC design criterion to minimize the number of singular fade subspaces and maximize the
coding gain is formulated and explicit low decoding complexity DSTC designs are provided.
For the K-user MARC, in which K source nodes want to transmit messages to a destination node D with the help of are lay node R, a new PNC scheme is proposed. Use of a many-to-one PNC map with conventional minimum squared Euclidean distance decoding at D, results in a loss of diversity order due to error propagation from the relay node. To counter this, we propose a novel low complexity decoder which offers the maximum diversity order of two.
Next, we consider wire line networks and explore the connections between
linear…
Advisors/Committee Members: Sundar Rajan, B (advisor).
Subjects/Keywords: Network Coding; Telecommunication Engineering; Coding Theory; Wireless Relaying; Wireline Networks; Multi-User Multiple Access Relay Channel (MARC); Physical Layer Network Coding (PNC); Distributed Space Time Coding (DSTC); Index Coding; Discrete Polymatroids; Latin Squares; Wireless Two-way Relaying; Graph Vertex Coloring; Adaptive Physical Layer Network Coding; Linear Network Coding; Wireless Network Coding; MIMO Two-way Relaying; Communication Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Vijayvaradharaj, T. M. (2017). Network Coding for Wirless Relaying and Wireline Networks. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2892
Chicago Manual of Style (16th Edition):
Vijayvaradharaj, T M. “Network Coding for Wirless Relaying and Wireline Networks.” 2017. Doctoral Dissertation, Indian Institute of Science. Accessed April 10, 2021.
http://etd.iisc.ac.in/handle/2005/2892.
MLA Handbook (7th Edition):
Vijayvaradharaj, T M. “Network Coding for Wirless Relaying and Wireline Networks.” 2017. Web. 10 Apr 2021.
Vancouver:
Vijayvaradharaj TM. Network Coding for Wirless Relaying and Wireline Networks. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2017. [cited 2021 Apr 10].
Available from: http://etd.iisc.ac.in/handle/2005/2892.
Council of Science Editors:
Vijayvaradharaj TM. Network Coding for Wirless Relaying and Wireline Networks. [Doctoral Dissertation]. Indian Institute of Science; 2017. Available from: http://etd.iisc.ac.in/handle/2005/2892
Royal Holloway, University of London
8.
Claridge, Jessica.
On matrix channels for network coding.
Degree: PhD, 2017, Royal Holloway, University of London
URL: https://pure.royalholloway.ac.uk/portal/en/publications/on-matrix-channels-for-network-coding(012973d4-18c9-4983-ab18-9988a8e8963a).html
;
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.792623
► In 2000, Ahlswede, Cai and Li introduced network coding, a technique used to improve the efficiency of information flow through networks by allowing inter- mediate…
(more)
▼ In 2000, Ahlswede, Cai and Li introduced network coding, a technique used to improve the efficiency of information flow through networks by allowing inter- mediate nodes to compute with and modify data. In practice random linear network coding is used, where the nodes transmit random linear combinations of their incoming packets. This thesis is concerned with several mathematical problems motivated by network coding. We first consider partial decoding in random linear network coding. By noting the equivalence to an enumeration problem in linear algebra, we com- pute the exact probability of a receiver decoding a fraction of the source message. We investigate the consequences when using both systematic and non-systematic network coding. We then consider mathematical models for network coding. Silva, Kschis- chang and K ̈otter studied certain classes of finite field matrix channels in order to model random linear network coding where exactly t random errors are introduced. We introduce a generalisation of these channels that allow the modelling of channels where a variable number of random errors are in- troduced. For special cases of our channel we improve on previous analysis of the channel capacity. For the general case we show that a capacity-achieving input distribution can always be taken to have a very restricted form (the distribution should be uniform given the rank of the input matrix). Nobrega, Silva and Uchoa- Filho proved a similar result for a class of matrix channels that model network coding with link erasures. Our result leads to an expression for the capacity of these channels as a maximisation over probability distributions on the set of possible ranks of input matrices (rather than the set of all input matrices): a set of linear rather than exponential size. Thus we give an efficient method to find optimal input distributions and compute the exact capacity for any channel parameters.
Subjects/Keywords: random linear network coding; finite fields; matrix channels; channel capacity; vector spaces; partial decoding
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Claridge, J. (2017). On matrix channels for network coding. (Doctoral Dissertation). Royal Holloway, University of London. Retrieved from https://pure.royalholloway.ac.uk/portal/en/publications/on-matrix-channels-for-network-coding(012973d4-18c9-4983-ab18-9988a8e8963a).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.792623
Chicago Manual of Style (16th Edition):
Claridge, Jessica. “On matrix channels for network coding.” 2017. Doctoral Dissertation, Royal Holloway, University of London. Accessed April 10, 2021.
https://pure.royalholloway.ac.uk/portal/en/publications/on-matrix-channels-for-network-coding(012973d4-18c9-4983-ab18-9988a8e8963a).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.792623.
MLA Handbook (7th Edition):
Claridge, Jessica. “On matrix channels for network coding.” 2017. Web. 10 Apr 2021.
Vancouver:
Claridge J. On matrix channels for network coding. [Internet] [Doctoral dissertation]. Royal Holloway, University of London; 2017. [cited 2021 Apr 10].
Available from: https://pure.royalholloway.ac.uk/portal/en/publications/on-matrix-channels-for-network-coding(012973d4-18c9-4983-ab18-9988a8e8963a).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.792623.
Council of Science Editors:
Claridge J. On matrix channels for network coding. [Doctoral Dissertation]. Royal Holloway, University of London; 2017. Available from: https://pure.royalholloway.ac.uk/portal/en/publications/on-matrix-channels-for-network-coding(012973d4-18c9-4983-ab18-9988a8e8963a).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.792623
Lehigh University
9.
Xie, Hongmei.
Advanced Error Control Scheme for Noncoherent Random Linear Network Coding.
Degree: PhD, Electrical Engineering, 2015, Lehigh University
URL: https://preserve.lehigh.edu/etd/1676
► Random linear network coding (RLNC) has shown advantages in improved throughput, robustness, and reduced delay over traditional routing in a communication network. However, the underlying…
(more)
▼ Random
linear network coding (RLNC) has shown advantages in improved throughput, robustness, and reduced delay over traditional routing in a communication
network. However, the underlying finite field has to be large enough for RLNC to work effectively, leading to high computational complexity. This dissertation proposes efficient decoding algorithms for RLNC with and without error control schemes, as well as new error control code constructions for a particular realization of RLNC, the
coding for distributed storage systems (DSSs). In RLNC, neither the source nor the sink node has knowledge of the channel transfer characteristic. To deal with errors and erasures in this scenario, subspace codes have been proposed in the literature, including Kotter and Kschischang (KK) codes, lifting of Gabidulin code, and Mahdavifar and Vardy (MV) codes. All these codes can be constructed from evaluations of linearized polynomials. Hence we propose a general interpolation algorithm over linearized polynomials ring, and decode all the three families of codes efficiently. For Gabidulin code, our general interpolation algorithm is deterministic compared to another current decoding algorithm, i.e., it is always be able to produce the correct decoding result when errors are within the error correction capability. For KK codes and MV codes, our algorithm has lower complexity than solving
linear equations, especially for MV codes with large list sizes.For RLNC without error control technique, rank deficient decoding (RDD) has been proposed to decode the package at the receiver, which transforms the decoding problem into that of a
linear block code. To implement RDD efficiently, we first adopt an existing
linear programming (LP) approach to accommodate equations with both even and odd parities over the binary field GF(2). Then, we propose a simplified LP algorithm for codes over extension fields of GF(2), and provide some simulation results to show that less packages are required at the receiver to get a same rate of correctly decoded packets. The data repair and reconstruction problems in distributed storage systems (DSS) were shown to be a multicast problem, thus can be solved by RLNC. Effort has been devoted to explicit code constructions for different optimization goals. We view the DSS
coding from a vector space's perspective, and transform data reconstruction and repair requirements into intersection properties of certain subspaces. Three code constructions are proposed for DSSs under the same vector space structure, aiming at low repair complexity, minimized repair bandwidth, and maximized minimum distance given a repair locality, respectively.
Advisors/Committee Members: Yan, Zhiyuan.
Subjects/Keywords: distributed storage; error control; linear programming; network coding; Electrical and Computer Engineering; Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Xie, H. (2015). Advanced Error Control Scheme for Noncoherent Random Linear Network Coding. (Doctoral Dissertation). Lehigh University. Retrieved from https://preserve.lehigh.edu/etd/1676
Chicago Manual of Style (16th Edition):
Xie, Hongmei. “Advanced Error Control Scheme for Noncoherent Random Linear Network Coding.” 2015. Doctoral Dissertation, Lehigh University. Accessed April 10, 2021.
https://preserve.lehigh.edu/etd/1676.
MLA Handbook (7th Edition):
Xie, Hongmei. “Advanced Error Control Scheme for Noncoherent Random Linear Network Coding.” 2015. Web. 10 Apr 2021.
Vancouver:
Xie H. Advanced Error Control Scheme for Noncoherent Random Linear Network Coding. [Internet] [Doctoral dissertation]. Lehigh University; 2015. [cited 2021 Apr 10].
Available from: https://preserve.lehigh.edu/etd/1676.
Council of Science Editors:
Xie H. Advanced Error Control Scheme for Noncoherent Random Linear Network Coding. [Doctoral Dissertation]. Lehigh University; 2015. Available from: https://preserve.lehigh.edu/etd/1676
Indian Institute of Science
10.
Sharma, Deepak.
Linear Network Coding For Wireline And Wireless Networks.
Degree: MSc Engg, Faculty of Engineering, 2010, Indian Institute of Science
URL: http://etd.iisc.ac.in/handle/2005/638
► Network Coding is a technique which looks beyond traditional store-and-forward approach followed by routers and switches in communication networks, and as an extension introduces maps…
(more)
▼ Network Coding is a technique which looks beyond traditional store-and-forward approach followed by routers and switches in communication networks, and as an extension introduces maps termed as ‘local encoding kernels’ and ‘global encoding kernels’ defined for each communication link in the
network. The purpose of both these maps is to define rules as to how to combine the packets input on the node to form a packet going out on an edge.
The paradigm of
network coding was formally and for the first time introduced by Ahlswede et al. in [1], where they also demonstrated its use in case of single-source multiple-sink
network multicast, although with use of much complex mathematical apparatus. In [1], examples of networks are also presented where it is shown that
network coding can improve the overall throughput of the
network which can not otherwise be realized by the conventional store-and-forward approach. The main result in [1], i.e. the capacity of single-source multiple-sinks information
network is nothing but the minimum of the max-flows from source to each sink, was again proved by Li, Yeung, and Cai in [2] where they showed that only
linear operations suffice to achieve the capacity of multicast
network. The authors in [2] defined generalizations to the multicast problem, which they termed as
linear broadcast,
linear dispersion, and Generic LCM as strict generalizations of
linear multicast, and showed how to build
linear network codes for each of these cases. For the case of
linear multicast, Koetter and Medard in [3] developed an algebraic framework using tools from algebraic geometry which also proved the multicast max-flow min-cut theorem proved in [1] and [2]. It was shown that if the size of the finite field is bigger than a certain threshold, then there always exists a solution to the
linear multicast, provided it is solvable. In other words, a solvable
linear multicast always has a solution in any finite field whose cardinality is greater than the threshold value.
The framework in [3] also dealt with the general
linear network coding problem involving multiple sources and multiple sinks with non-uniform demand functions at the sinks, but did not touched upon the key problem of finding the characteristic(s) of the field in which it may have solution. It was noted in [5] that a solvable
network may not have a
linear solution at all, and then introduced the notion of general
linear network coding, where the authors conjectured that every solvable
network must have a general
linear solution. This was refuted by Dougherty, Freiling, Zeger in [6], where the authors explicitly constructed example of a solvable
network which has no general
linear solution, and also networks which have solution in a finite field of char 2, and not in any other finite field. But an algorithm to find the characteristic of the field in which a scalar or general
linear solution(if at all) exists did not find any mention in [3] or [6]. It was a simultaneous discovery by us(as part of this thesis) as well as by Dougherty, Freiling, Zeger in [7] to…
Advisors/Committee Members: Vijay Kumar, P (advisor).
Subjects/Keywords: Wireless Communication Networks; Network Coding; Linear Network Coding; Vector Linear Network Coding; Wireless Network Coding; Wireline Networks; Wireless Networks; Network Information Flow; Communication Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sharma, D. (2010). Linear Network Coding For Wireline And Wireless Networks. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/638
Chicago Manual of Style (16th Edition):
Sharma, Deepak. “Linear Network Coding For Wireline And Wireless Networks.” 2010. Masters Thesis, Indian Institute of Science. Accessed April 10, 2021.
http://etd.iisc.ac.in/handle/2005/638.
MLA Handbook (7th Edition):
Sharma, Deepak. “Linear Network Coding For Wireline And Wireless Networks.” 2010. Web. 10 Apr 2021.
Vancouver:
Sharma D. Linear Network Coding For Wireline And Wireless Networks. [Internet] [Masters thesis]. Indian Institute of Science; 2010. [cited 2021 Apr 10].
Available from: http://etd.iisc.ac.in/handle/2005/638.
Council of Science Editors:
Sharma D. Linear Network Coding For Wireline And Wireless Networks. [Masters Thesis]. Indian Institute of Science; 2010. Available from: http://etd.iisc.ac.in/handle/2005/638
University of Bradford
11.
Susanto, Misfa.
Network coding for multihop wireless networks : joint random linear network coding and forward error correction with interleaving for multihop wireless networks.
Degree: PhD, 2015, University of Bradford
URL: http://hdl.handle.net/10454/14864
► Optimising the throughput performance for wireless networks is one of the challenging tasks in the objectives of communication engineering, since wireless channels are prone to…
(more)
▼ Optimising the throughput performance for wireless networks is one of the challenging tasks in the objectives of communication engineering, since wireless channels are prone to errors due to path losses, random noise, and fading phenomena. The transmission errors will be worse in a multihop scenario due to its accumulative effects. Network Coding (NC) is an elegant technique to improve the throughput performance of a communication network. There is the fact that the bit error rates over one modulation symbol of 16- and higher order- Quadrature Amplitude Modulation (QAM) scheme follow a certain pattern. The Scattered Random Network Coding (SRNC) system was proposed in the literature to exploit the error pattern of 16-QAM by using bit-scattering to improve the throughput of multihop network to which is being applied the Random Linear Network Coding (RLNC). This thesis aims to improve further the SRNC system by using Forward Error Correction (FEC) code; the proposed system is called Joint RLNC and FEC with interleaving. The first proposed system (System-I) uses Convolutional Code (CC) FEC. The performances analysis of System-I with various CC rates of 1/2, 1/3, 1/4, 1/6, and 1/8 was carried out using the developed simulation tools in MATLAB and compared to two benchmark systems: SRNC system (System-II) and RLNC system (System- III). The second proposed system (System-IV) uses Reed-Solomon (RS) FEC code. Performance evaluation of System IV was carried out and compared to three systems; System-I with 1/2 CC rate, System-II, and System-III. All simulations were carried out over three possible channel environments: 1) AWGN channel, 2) a Rayleigh fading channel, and 3) a Rician fading channel, where both fading channels are in series with the AWGN channel. The simulation results show that the proposed system improves the SRNC system. How much improvement gain can be achieved depends on the FEC type used and the channel environment.
Subjects/Keywords: Modulation scheme; Convolutional code; Reed Solomon code; Serial concatenated code; Interleaving schemes; Random linear network coding; Symbol level network coding; Multihop transmission; Interleaved network-forward error correction coding; Bit and block error rates; Multihop wireless networks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Susanto, M. (2015). Network coding for multihop wireless networks : joint random linear network coding and forward error correction with interleaving for multihop wireless networks. (Doctoral Dissertation). University of Bradford. Retrieved from http://hdl.handle.net/10454/14864
Chicago Manual of Style (16th Edition):
Susanto, Misfa. “Network coding for multihop wireless networks : joint random linear network coding and forward error correction with interleaving for multihop wireless networks.” 2015. Doctoral Dissertation, University of Bradford. Accessed April 10, 2021.
http://hdl.handle.net/10454/14864.
MLA Handbook (7th Edition):
Susanto, Misfa. “Network coding for multihop wireless networks : joint random linear network coding and forward error correction with interleaving for multihop wireless networks.” 2015. Web. 10 Apr 2021.
Vancouver:
Susanto M. Network coding for multihop wireless networks : joint random linear network coding and forward error correction with interleaving for multihop wireless networks. [Internet] [Doctoral dissertation]. University of Bradford; 2015. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/10454/14864.
Council of Science Editors:
Susanto M. Network coding for multihop wireless networks : joint random linear network coding and forward error correction with interleaving for multihop wireless networks. [Doctoral Dissertation]. University of Bradford; 2015. Available from: http://hdl.handle.net/10454/14864
12.
Connelly, Joseph Michael.
Linear Network Coding over Ring Alphabets.
Degree: Electrical Engineering (Communication Theory and Systems), 2018, University of California – San Diego
URL: http://www.escholarship.org/uc/item/6dv5j81z
► As connected devices play an ever-growing role in our society, there is a subsequent need for advances in multi-user communication systems. In a network, senders…
(more)
▼ As connected devices play an ever-growing role in our society, there is a subsequent need for advances in multi-user communication systems. In a network, senders and receivers are connected via a series of intermediate users who share information represented as sequences of bits or elements of some other finite alphabet. By allowing users to transmit functions of their inputs, as opposed to simply relaying received data, the information throughput of a network can be increased. Network codes in which these functions are linear are sub-optimal in general but are of practical interest due to their mathematical tractability and low implementation complexity. The study of linear network coding has primarily been limited to finite field alphabets. In this work, we consider linear network codes over more general algebraically-structured alphabets, namely finite rings. We contrast linear network codes over finite fields, commutative rings, and non-commutative rings, and we discuss cases where non-linear codes attain higher information rates than even very general linear codes. Our results show that finite fields are, in some sense, the best ring alphabets for linear network coding, but in certain instances, it may be advantageous to use linear coding over some other ring alphabet of the same size. Specifically, we prove results related to:(i) network solvability: whether or not a network’s receivers can obtain their desired information using codes over a given alphabet. We characterize the commutative rings for which there exists a network that is linearly solvable over the ring but not over any other commutative ring of the same size. We show that these rings are, in some sense, the best commutative rings of a given size for linear network coding. We then present an infinite class of networks that are linearly solvable over certain non-commutative rings but not over any commutative rings. We also prove that vector linear codes over finite fields minimize the alphabet size needed for linear solvability, which is desirable from an implementation complexity standpoint.(ii) network capacity: how much information per channel use can be sent to the network’s receivers in the limit of large block sizes for transmission. We show that the linear coding capacity of a given network cannot be increased by looking beyond finite fields to more general rings.
Subjects/Keywords: Electrical engineering; Information science; Computer science; Abstract Algebra; Finite Rings; Information Theory; Linear Codes; Network Coding
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Connelly, J. M. (2018). Linear Network Coding over Ring Alphabets. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/6dv5j81z
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Connelly, Joseph Michael. “Linear Network Coding over Ring Alphabets.” 2018. Thesis, University of California – San Diego. Accessed April 10, 2021.
http://www.escholarship.org/uc/item/6dv5j81z.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Connelly, Joseph Michael. “Linear Network Coding over Ring Alphabets.” 2018. Web. 10 Apr 2021.
Vancouver:
Connelly JM. Linear Network Coding over Ring Alphabets. [Internet] [Thesis]. University of California – San Diego; 2018. [cited 2021 Apr 10].
Available from: http://www.escholarship.org/uc/item/6dv5j81z.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Connelly JM. Linear Network Coding over Ring Alphabets. [Thesis]. University of California – San Diego; 2018. Available from: http://www.escholarship.org/uc/item/6dv5j81z
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Australian National University
13.
Esmaeilzadeh Fereydani, Mohammad.
Design and Performance Optimization of Wireless Network Coding for Delay Sensitive Applications
.
Degree: 2015, Australian National University
URL: http://hdl.handle.net/1885/111350
► Over the past decade, network coding (NC) has emerged as a new paradigm for data communications and has attracted much popularity and research interest in…
(more)
▼ Over the past decade, network coding (NC) has emerged as a new
paradigm for data communications and has attracted much
popularity and research interest in information and coding
theory, networking, wireless communications and data storage.
Random linear NC (RLNC) is a subclass of NC that has shown to be
suitable for a wide range of applications thanks to its desirable
properties, namely throughput-optimality, simple encoder design
and efficient operation with minimum feedback requirements.
However, for delay-sensitive applications, the mentioned
advantages come with two main issues that may restrict RLNC usage
in practice. First is the trade-off between the delay and
throughput performances of RLNC, which can adversely affect the
throughput-optimality of RLNC and hence the overall performance
of RLNC. Second is the usage of feedback, where even if feedback
is kept at minimum it can still incur large amount of delay and
thus degrade the RLNC performance, if not optimized properly.
In this thesis, we aim to investigate these issues under two
broad headings: RLNC for applications over time division
duplexing (TDD) channels and RLNC for layered video streaming.
For the first class of problems, we start with the reliable
broadcast communication over TDD wireless channels with memory,
in the presence of large latency. Considering TDD channels with
large latency, excessive use of feedback could be costly.
Therefore, joint optimization of feedback rate and RLNC
parameters has been studied previously for memoryless channels to
minimize the average transmission time for such settings. Here,
we extend the methodology to the case of channels with memory by
benefiting from a Gilbert-Elliot channel model. It is
demonstrated that significant improvement in the performance
could be achieved compared to the scheme which is oblivious to
the temporal correlations in the erasure channels.
Then, keeping our focus on network coded TDD broadcast systems
with large latency, we consider delay sensitive applications and
study the issue of throughput and packet drop rate (PDR)
optimization as two performance metrics when the transmission
time is considered fixed. We propose a systematic framework to
investigate the advantage of using feedback by comparing
feedback-free and feedback schemes. Furthermore, the complicated
interplay of the mean throughputs and PDRs of users with
different packet erasure conditions is discussed. Then, to better
analyze the throughput performance of the proposed feedback-free
scheme, we formulate the probability and cumulative density
functions of users' throughputs and utilize them to investigate
the problem of guaranteeing the quality of service. Finally, it
is shown that the optimized feedback-free RLNC broadcast scheme
works close enough to an idealistic RLNC scheme, where an
…
Subjects/Keywords: Random Linear Network Coding;
Wireless Broadcast;
Time Division Duplexing Channels;
Delay Sensitive Applications;
Layered Video Streaming
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Esmaeilzadeh Fereydani, M. (2015). Design and Performance Optimization of Wireless Network Coding for Delay Sensitive Applications
. (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/111350
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Esmaeilzadeh Fereydani, Mohammad. “Design and Performance Optimization of Wireless Network Coding for Delay Sensitive Applications
.” 2015. Thesis, Australian National University. Accessed April 10, 2021.
http://hdl.handle.net/1885/111350.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Esmaeilzadeh Fereydani, Mohammad. “Design and Performance Optimization of Wireless Network Coding for Delay Sensitive Applications
.” 2015. Web. 10 Apr 2021.
Vancouver:
Esmaeilzadeh Fereydani M. Design and Performance Optimization of Wireless Network Coding for Delay Sensitive Applications
. [Internet] [Thesis]. Australian National University; 2015. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/1885/111350.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Esmaeilzadeh Fereydani M. Design and Performance Optimization of Wireless Network Coding for Delay Sensitive Applications
. [Thesis]. Australian National University; 2015. Available from: http://hdl.handle.net/1885/111350
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Georgia Tech
14.
Torabkhani, Nima.
Modeling and analysis of the performance of networks in finite-buffer regime.
Degree: PhD, Electrical and Computer Engineering, 2014, Georgia Tech
URL: http://hdl.handle.net/1853/51810
► In networks, using large buffers tend to increase end-to-end packet delay and its deviations, conflicting with real-time applications such as online gaming, audio-video services, IPTV,…
(more)
▼ In networks, using large buffers tend to increase end-to-end packet delay and its deviations, conflicting with real-time applications such as online gaming, audio-video services, IPTV, and VoIP. Further, large buffers complicate the design of high speed routers, leading to more power consumption and board space. According to Moore's law, switching speeds double every 18 months while memory access speeds double only every 10 years. Hence, as memory requirements increasingly become a limiting aspect of router design, studying networks in finite-buffer regime seems necessary for
network engineers. This work focuses on both practical and theoretical aspects of finite-buffer networks. In Chapters 1-7, we investigate the effects of finite buffer sizes on the throughput and packet delay in different networks. These performance measures are shown to be linked to the stationary distribution of an underlying irreducible Markov chain that exactly models the changes in the
network. An iterative scheme is proposed to approximate the steady-state distribution of buffer occupancies by decoupling the exact chain to smaller chains. These approximate solutions are used to analytically characterize
network throughput and packet delay, and are also applied to some
network performance optimization problems. Further, using simulations, it is confirmed that the proposed framework yields accurate estimates of the throughput and delay performance measures and captures the vital trends and tradeoffs in these networks. In Chapters 8-10, we address the problem of modeling and analysis of the performance of finite-memory random
linear network coding in erasure networks. When using random
linear network coding, the content of buffers creates dependencies which cannot be captured directly using the classical queueing theoretical models. A careful derivation of the buffer occupancy states and their transition rules are presented as well as decodability conditions when random
linear network coding is performed on a stream of arriving packets.
Advisors/Committee Members: Fekri, Faramarz (advisor), Barry, John R. (committee member), Sivakumar, Raghupathy (committee member), Weiss, Howard (committee member), Zajic, Alenka (committee member).
Subjects/Keywords: Random linear network coding; Markov chain; Finite-buffer; Throughput; Networks; Performance analysis; Computer network protocols; Computer network architecture; Buffer storage (Computer science)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Torabkhani, N. (2014). Modeling and analysis of the performance of networks in finite-buffer regime. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/51810
Chicago Manual of Style (16th Edition):
Torabkhani, Nima. “Modeling and analysis of the performance of networks in finite-buffer regime.” 2014. Doctoral Dissertation, Georgia Tech. Accessed April 10, 2021.
http://hdl.handle.net/1853/51810.
MLA Handbook (7th Edition):
Torabkhani, Nima. “Modeling and analysis of the performance of networks in finite-buffer regime.” 2014. Web. 10 Apr 2021.
Vancouver:
Torabkhani N. Modeling and analysis of the performance of networks in finite-buffer regime. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/1853/51810.
Council of Science Editors:
Torabkhani N. Modeling and analysis of the performance of networks in finite-buffer regime. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/51810
Louisiana State University
15.
Li, Shoupei.
Design of linear Boolean network codes for combination networks.
Degree: MS, Electrical and Computer Engineering, 2006, Louisiana State University
URL: etd-04032006-004254
;
https://digitalcommons.lsu.edu/gradschool_theses/3850
► Network coding is a promising technique to improve the throughput of communication networks. In the thesis, we investigate linear Boolean network codes on a special…
(more)
▼ Network coding is a promising technique to improve the throughput of communication networks. In the thesis, we investigate linear Boolean network codes on a special class of multicast networks, called combination networks. Using companion matrices of primitive polynomials over finite fields, we design a class of symmetric linear Boolean network codes from Reed-Solomon codes for single-source combination networks. We also prove that, for some cases, the linear Boolean network codes are optimal in the sense of minimum network uses. In the thesis, we further consider two-source network coding problem for combination networks and other specific networks. We develop a method to evaluate an outer bound for these two-source networks. By designing linear Boolean network codes which achieve extreme points of rate regions, we show that the outer bound is actually tight for some of these networks.
Subjects/Keywords: min-cut max-flow; combination network; network coding; linear boolean network codes
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Li, S. (2006). Design of linear Boolean network codes for combination networks. (Masters Thesis). Louisiana State University. Retrieved from etd-04032006-004254 ; https://digitalcommons.lsu.edu/gradschool_theses/3850
Chicago Manual of Style (16th Edition):
Li, Shoupei. “Design of linear Boolean network codes for combination networks.” 2006. Masters Thesis, Louisiana State University. Accessed April 10, 2021.
etd-04032006-004254 ; https://digitalcommons.lsu.edu/gradschool_theses/3850.
MLA Handbook (7th Edition):
Li, Shoupei. “Design of linear Boolean network codes for combination networks.” 2006. Web. 10 Apr 2021.
Vancouver:
Li S. Design of linear Boolean network codes for combination networks. [Internet] [Masters thesis]. Louisiana State University; 2006. [cited 2021 Apr 10].
Available from: etd-04032006-004254 ; https://digitalcommons.lsu.edu/gradschool_theses/3850.
Council of Science Editors:
Li S. Design of linear Boolean network codes for combination networks. [Masters Thesis]. Louisiana State University; 2006. Available from: etd-04032006-004254 ; https://digitalcommons.lsu.edu/gradschool_theses/3850
16.
Papanikos, Nikolaos.
Energy - efficient networking in wireless ad hoc networks.
Degree: 2017, University of Ioannina; Πανεπιστήμιο Ιωαννίνων
URL: http://hdl.handle.net/10442/hedi/43260
► Wireless multi-hop ad hoc networks are self-organizing networks that can be spontaneously deployed without any need of fixed infrastructure. In order to enable communication, network…
(more)
▼ Wireless multi-hop ad hoc networks are self-organizing networks that can be spontaneously deployed without any need of fixed infrastructure. In order to enable communication, network nodes share their resources to store and forward other nodes' data packets. However, the current hardware technology significantly limits the battery power network nodes run on. As a result, designing energy-efficient networking algorithms is of paramount importance for the viability of this type of networks. In the present thesis, we study networking algorithms that rely on packet redundancy to provide fair communication. This approach can significantly increase the number of transmissions and have a severe impact on the energy efficiency. Our main goal is to devise novel algorithms that efficiently handle packet redundancy in order to reduce the related energy costs without compromising the overall performance. We focus on two well-known fields; broadcasting in mobile ad hoc networks (MANETs) and routing in opportunistic networks (OppNets). In the first part, we examine energy-efficient broadcasting in MANETs. The latest trend in this field combines traditional broadcast schemes with network coding. Besides enhancing the energy efficiency through the reduction of transmissions, this synergy also increases the resilience to loss and improves security. Initially, we focus on XOR-based broadcasting and reveal cases where the well-established approach suffers performance breakdowns. We attribute this behavior to an essential component of the underlying broadcast algorithm that is inherently incompatible with network coding. To tackle the problem, we introduce a novel coding-friendly broadcast algorithm. Furthermore, for the first time, we use XOR coding as a mechanism not only for enhancing energy efficiency but also for reducing the end-to-end-delay. Through extensive simulations, we demonstrate the effectiveness of the proposed algorithm on improving the energy efficiency, delivery delay and utilization of network resources. Then, we focus on RLNC-based broadcasting and introduce an analytical model that captures the performance of coding-based broadcast schemes. We observe that the traditional approach to combine RLNC and probabilistic forwarding significantly impacts the performance of RLNC. To this end, we design a novel RLNC-based broadcast algorithm that for the first time applies RLNC over CDS-based broadcasting. The proposed algorithm provides a more systematic pruning of redundant transmissions without compromising RLNC's efficiency. We also investigate the generation management that is a key issue in RLNC and introduce a new distributed scheme that is suitable for mobile environments. Finally, through extensive simulations, we show that the proposed algorithm outperforms XOR-based as well as RLNC-based schemes even when global knowledge is used for managing packet generations. In the second part of the thesis, we investigate energy-efficient routing in OppNets. The prominent routing strategy in coping with intermittent…
Subjects/Keywords: Δίκτυα Η/Υ; Ασύρματα αδόμητα δίκτυα; Οπορτουνιστικά δίκτυα; Δρομολόγηση; Ευρεία εκπομπή; Κωδικοποίηση δικτύου; Αλγόριθμοι δικτύωσης; Πρωτόκολλα δρομολόγησης; Εξοικονόμηση ενέργειας; Διακοπτόμενη συνδεσιμότητα; Δρομολόγηση πολλαπλών αντιτύπων; Networking; Wireless ad hoc networks; Mobile ad hoc networks; Opportunistic networks; Routing; Broadcasting; Energy efficiency; Network coding; XOR coding; Random linear network coding; Multi-copy routing; Replication-based routing; RLNC
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Papanikos, N. (2017). Energy - efficient networking in wireless ad hoc networks. (Thesis). University of Ioannina; Πανεπιστήμιο Ιωαννίνων. Retrieved from http://hdl.handle.net/10442/hedi/43260
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Papanikos, Nikolaos. “Energy - efficient networking in wireless ad hoc networks.” 2017. Thesis, University of Ioannina; Πανεπιστήμιο Ιωαννίνων. Accessed April 10, 2021.
http://hdl.handle.net/10442/hedi/43260.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Papanikos, Nikolaos. “Energy - efficient networking in wireless ad hoc networks.” 2017. Web. 10 Apr 2021.
Vancouver:
Papanikos N. Energy - efficient networking in wireless ad hoc networks. [Internet] [Thesis]. University of Ioannina; Πανεπιστήμιο Ιωαννίνων; 2017. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/10442/hedi/43260.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Papanikos N. Energy - efficient networking in wireless ad hoc networks. [Thesis]. University of Ioannina; Πανεπιστήμιο Ιωαννίνων; 2017. Available from: http://hdl.handle.net/10442/hedi/43260
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
17.
Coelho, Nuno Bettencourt.
Implementation of linear network coding over a flexible emulator.
Degree: 2016, RCAAP
URL: https://www.rcaap.pt/detail.jsp?id=oai:repositorio.iscte-iul.pt:10071/13019
► This dissertation has the main objective of study and implement network coding (NC) techniques in a flexible emulator, programmed in a language that allows the…
(more)
▼ This dissertation has the main objective of study and implement network coding (NC) techniques in a flexible emulator, programmed in a language that allows the coexistence of entities running parallel code, in order to emulate each node independently.
The dissertation starts with the study of NC’s concept and with the characterization of the different type of coding methods, with a focus on linear network coding (LNC).
. A flexible Java emulator (named Net Genius) was developed, which not only allows numerous topologies of networks, but also different types of coding. In addition, the emulator allows to emulate the networks in two different modes: with a distributed network or with a centralized network. In order to present the differences between the LNC approach and the traditional approach used in packet networks (based in routing tables), the emulator allows the user to choose between these two types of approach, assessing the impact of having network coding over user-defined networks.
When implementing LNC, the concept of generations of packets was introduced in order to avoid combining packets from different sources. Leveraging on this, the transfer matrix at each node is calculated based on the coded packets and not based on the information stored in each node. In addition to this, a mechanism to code packets at the source was implemented, as well as a mechanism to introduce errors in the connection links. This allowed to emulate networks with different link error probabilities, in order to assess the resilience of the different approaches to the presence of failures.
Esta dissertação visa estudar e a implementar técnicas de network coding (NC) num emulador flexível, programado numa linguagem que permita a coexistência de entidades a correr código em paralelo por forma a simular cada nó de forma independente.
Este trabalho começa com estudo do conceito de NC e da caracterização dos diferentes tipos de métodos de codificação, focando-nos essencialmente no linear network coding (LNC).
Optou-se por criar um emulador flexível em Java (designado por Net Genius), que não só permite várias topologias de redes, mas também vários tipos de codificação. Além disso, o emulador permite emular as redes em dois modos diferentes, um modo com uma rede distribuída e outro com uma rede centralizada. De modo a evidenciar as diferenças entre a abordagem LNC e a abordagem tradicional (sem codificação), o emulador permite escolher o tipo de abordagem em cada emulação, o que permite estudar o impacto do NC em redes definidas por utilizadores.
Procedeu-se à implementação de técnicas LNC e introduziu-se um conceito de gerações de pacotes, de modo a evitar a codificação de pacotes de diferentes fontes. A par disto, a matriz de codificação é calculada com base nos pacotes codificados e não com base na informação guardada em cada nó.
Por último, implementou-se um mecanismo para codificação de pacotes na fonte e um mecanismo de introdução de erros nos links, permitindo emular a rede com diferentes probabilidades de erro, sendo possível…
Advisors/Committee Members: Monteiro, Francisco António Taveira Branco Nunes, Lopes, Rui Jorge Henrique Calado.
Subjects/Keywords: Linear network coding; Node protection; Java emulation; Software-Defined networks; Engenharia informática; Java; Codificação; Software; Rede de transporte; Domínio/Área Científica::Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Coelho, N. B. (2016). Implementation of linear network coding over a flexible emulator. (Thesis). RCAAP. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:repositorio.iscte-iul.pt:10071/13019
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Coelho, Nuno Bettencourt. “Implementation of linear network coding over a flexible emulator.” 2016. Thesis, RCAAP. Accessed April 10, 2021.
https://www.rcaap.pt/detail.jsp?id=oai:repositorio.iscte-iul.pt:10071/13019.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Coelho, Nuno Bettencourt. “Implementation of linear network coding over a flexible emulator.” 2016. Web. 10 Apr 2021.
Vancouver:
Coelho NB. Implementation of linear network coding over a flexible emulator. [Internet] [Thesis]. RCAAP; 2016. [cited 2021 Apr 10].
Available from: https://www.rcaap.pt/detail.jsp?id=oai:repositorio.iscte-iul.pt:10071/13019.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Coelho NB. Implementation of linear network coding over a flexible emulator. [Thesis]. RCAAP; 2016. Available from: https://www.rcaap.pt/detail.jsp?id=oai:repositorio.iscte-iul.pt:10071/13019
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Indian Institute of Science
18.
Vadlamani, Lalitha.
Coding Schemes For Distributed Subspace Computation, Distributed Storage And Local Correctability.
Degree: PhD, Faculty of Engineering, 2017, Indian Institute of Science
URL: http://etd.iisc.ac.in/handle/2005/2646
► In this thesis, three problems have been considered and new coding schemes have been devised for each of them. The first is related to distributed…
(more)
▼ In this thesis, three problems have been considered and new
coding schemes have been devised for each of them. The first is related to distributed function computation, the second to
coding for distributed storage and the final problem is based on locally correctable codes. A common theme of the first two problems considered is distributed computation.
The first problem is motivated by the problem of distributed function computation considered by Korner and Marton, where the goal is to compute XOR of two binary sources at the receiver. It has been shown that
linear encoders give better sum rates for some source distributions as compared to the usual Slepian-Wolf scheme. We generalize this distributed function computation setting to the case of more than two sources and the receiver is interested in computing multiple
linear combinations of the sources. Consider `m' random variables each of which takes values from a finite field and are associated with a certain joint probability distribution. The receiver is interested in the lossless computation of `s'
linear combinations of the m random variables. By considering the set of all
linear combinations of m random variables as a vector space V , this problem can be interpreted as a subspace-computation problem.
For this problem, we develop three increasingly refined approaches, all based on
linear encoders. The first two approaches which are termed as common code approach and selected subspace approach, use a common matrix to encode all the sources. In the common code approach, the desired subspace W is computed at the receiver, whereas in the selected subspace approach, possibly a larger subspace U which contains the desired subspace is computed. The larger subspace U which gives the minimum sum rate itself is based on a decomposition of vector space V into a chain of subspaces. The chain of subspaces is determined by the joint probability distribution of m random variables and a notion of normalized measure of entropy. The third approach is a nested code approach, where all the encoding matrices are nested and the same subspace U which is identified in the selected subspace approach is computed. We characterize the sum rates under all the three approaches. The sum rate under nested code approach is no larger than both selected subspace approach and Slepian-Wolf approach. For a large class of joint distributions and subspaces W , the nested code scheme is shown to improve upon Slepian-Wolf scheme. Additionally, a class of source distributions and subspaces are identified, for which the nested code approach is sum-rate optimal.
In the second problem, we consider a distributed storage
network, where data is stored across nodes in a
network which are failure-prone. The goal is to store data reliably and efficiently. For a required level of reliability, it is of interest to minimise storage overhead and also of interest to perform node repair efficiently. Conventionally replication and maximum distance separable (MDS) codes are employed in such systems. Though…
Advisors/Committee Members: Vijay Kumar, * (advisor).
Subjects/Keywords: Coding Theory; Distributed Function Computation; Distributed Storage Coding; Locally Correctable Codes; Linear Codes; Encoding; Regeneration Codes; Error Correcting Codes; Information Theory; Local Erasure Correction; Minimum Storage Regenerating (MSR) Codes; Distributed Storage Network; Minimum Bandwith Regenerating (MBR) Codes; Distributed Subspace Computation; Computer Science
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Vadlamani, L. (2017). Coding Schemes For Distributed Subspace Computation, Distributed Storage And Local Correctability. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2646
Chicago Manual of Style (16th Edition):
Vadlamani, Lalitha. “Coding Schemes For Distributed Subspace Computation, Distributed Storage And Local Correctability.” 2017. Doctoral Dissertation, Indian Institute of Science. Accessed April 10, 2021.
http://etd.iisc.ac.in/handle/2005/2646.
MLA Handbook (7th Edition):
Vadlamani, Lalitha. “Coding Schemes For Distributed Subspace Computation, Distributed Storage And Local Correctability.” 2017. Web. 10 Apr 2021.
Vancouver:
Vadlamani L. Coding Schemes For Distributed Subspace Computation, Distributed Storage And Local Correctability. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2017. [cited 2021 Apr 10].
Available from: http://etd.iisc.ac.in/handle/2005/2646.
Council of Science Editors:
Vadlamani L. Coding Schemes For Distributed Subspace Computation, Distributed Storage And Local Correctability. [Doctoral Dissertation]. Indian Institute of Science; 2017. Available from: http://etd.iisc.ac.in/handle/2005/2646
Brno University of Technology
19.
Hrušovský, Enrik.
Automatická klasifikace výslovnosti hlásky R: Automatic classification of pronunciation of the letter „R“.
Degree: 2018, Brno University of Technology
URL: http://hdl.handle.net/11012/81555
► This diploma thesis deals with automatic clasification of vowel R. Purpose of this thesis is to made program for detection of pronounciation of speech defects…
(more)
▼ This diploma thesis deals with automatic clasification of vowel R. Purpose of this thesis is to made program for detection of pronounciation of speech defects at vowel R in children. In thesis are processed parts as speech creation, speech therapy, dyslalia and subsequently speech signal processing and analysis methods. In the last part is designed software for automatic detection of pronounciation of vowel R. For recognition of pronounciation is used algorithm MFCC for extracting features. This features are subsequently classified by neural
network to the group of correct or incorrect pronounciation and is evaluated classification success.
Advisors/Committee Members: Harabiš, Vratislav (advisor), Vičar, Tomáš (referee).
Subjects/Keywords: tvorba reči; logopédia; dyslália; segmentácia; spektrálna analýza; lineárne prediktívna analýza; percepčne lineárne prediktívna analýza; mel-frekvenčné kepstrálne koeficienty; neurónová sieť; automatická klasifikácia výslovnosti; speech creation; speech therapy; dyslalia; segmentation; spectral analysis; linear predicive coding; perceptual linear prediction; mel-frequency cepstral coefficients; neural network; automatic classification of pronounciation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hrušovský, E. (2018). Automatická klasifikace výslovnosti hlásky R: Automatic classification of pronunciation of the letter „R“. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/81555
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Hrušovský, Enrik. “Automatická klasifikace výslovnosti hlásky R: Automatic classification of pronunciation of the letter „R“.” 2018. Thesis, Brno University of Technology. Accessed April 10, 2021.
http://hdl.handle.net/11012/81555.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Hrušovský, Enrik. “Automatická klasifikace výslovnosti hlásky R: Automatic classification of pronunciation of the letter „R“.” 2018. Web. 10 Apr 2021.
Vancouver:
Hrušovský E. Automatická klasifikace výslovnosti hlásky R: Automatic classification of pronunciation of the letter „R“. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/11012/81555.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Hrušovský E. Automatická klasifikace výslovnosti hlásky R: Automatic classification of pronunciation of the letter „R“. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/81555
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Indian Institute of Science
20.
Ganesan, Abhinav.
Precoding for Interference Management in Wireless and Wireline Networks.
Degree: PhD, Faculty of Engineering, 2018, Indian Institute of Science
URL: http://etd.iisc.ac.in/handle/2005/3190
► Multiple users compete for a common resource like bandwidth to communicate data in interference networks. Existing approaches in dealing with interference limit the rate of…
(more)
▼ Multiple users compete for a common resource like bandwidth to communicate
data in interference networks. Existing approaches in dealing with interference
limit the rate of communication due to paucity of shared resources. This limitation
in the rate gets more glaring as the number of users in the
network increases.
For example, existing wireless systems either choose to orthogonalize the users
(for example, Frequency Division Multiple Access (FDMA) systems or Code Division
Multiple Access (CDMA) systems) or treat interference as Gaussian noise at
the receivers. It is well known that these approaches are sub-optimal in general.
Orthogonalization of users limit the number of available interference-free channels
(known as degrees of freedom, abbreviated as DoF) and treating interference as
noise means that the receiver cannot make use of the structure in the interfering
signals. This motivates the need to analyze alternate transmit and decoding
schemes in interference networks.
This thesis mainly analyzes transmit schemes that use
linear precoding for
various configurations of interference networks with some practical constraints
imposed by the use of finite input constellations, propagation delays, and channel
state availability at the transmitters. The main contributions of this thesis are
listed below.
Achievable rates using precoding with finite constellation inputs in Gaussian
Interference Channels (GIC) is analyzed. A metric for finding the approximate
angle of rotation to maximally enlarge the Constellation Constrained (CC) capacity
of two-user Gaussian Strong Interference Channel (GSIC) is proposed. Even as
the Gaussian alphabet FDMA rate curve touches the capacity curve of the GSIC,
with both the users using the same finite constellation, we show that the CC
FDMA rate curve lies strictly inside the CC capacity curve at high powers. For a
K-user MIMO GIC, a set of necessary and sufficient conditions on the precoders
under which the mutual information between between relevant transmit-receive
pairs saturate like in the single user case is derived. Gradient-ascent based algorithms
to optimize the sum-rate achieved by precoding with finite constellation
inputs and treating interference as noise are proposed.
For a class of Gaussian interference networks with general message demands,
identified as symmetrically connected interference networks, the expected sumspectral efficiency (in bits/sec/Hz) is shown to grow linearly with the number
of transmitters at finite SNR, using a time-domain Interference Alignment (IA)
scheme in the presence of line of sight (LOS) channels.
For a 2×2 MIMO X-
Network with M antennas at each node, we identify spacetime
block codes that could be coupled with an appropriate precoding scheme to
achieve the maximum possible sum-DoF of 4M
3 , for M = 3, 4. The proposed
schemes are shown to achieve a diversity gain of M with SNR-independent finite
constellation inputs. The proposed schemes have lower CSIT requirements
compared to existing schemes.
This thesis also makes an attempt to guarantee…
Advisors/Committee Members: Rajan, B Sundar (advisor).
Subjects/Keywords: Wireless Networkw; Wireline Networks; Interference Networks; Gaussian Interfernece Channels; Frequency Division Multiple Access (FDMA); MIMO Gaussian Interfernce Channels; Acyclic Networks; Wireless Communications; Gaussian Interference Channel (GIC); Finite Constellation Input; Linear Network Coding; Precoding Based Network Alignment (PBNA); Communication Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ganesan, A. (2018). Precoding for Interference Management in Wireless and Wireline Networks. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3190
Chicago Manual of Style (16th Edition):
Ganesan, Abhinav. “Precoding for Interference Management in Wireless and Wireline Networks.” 2018. Doctoral Dissertation, Indian Institute of Science. Accessed April 10, 2021.
http://etd.iisc.ac.in/handle/2005/3190.
MLA Handbook (7th Edition):
Ganesan, Abhinav. “Precoding for Interference Management in Wireless and Wireline Networks.” 2018. Web. 10 Apr 2021.
Vancouver:
Ganesan A. Precoding for Interference Management in Wireless and Wireline Networks. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2018. [cited 2021 Apr 10].
Available from: http://etd.iisc.ac.in/handle/2005/3190.
Council of Science Editors:
Ganesan A. Precoding for Interference Management in Wireless and Wireline Networks. [Doctoral Dissertation]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3190
21.
Ali, Arshad.
Topics in Delay Tolerant Networks (DTNs) : reliable transports, estimation and tracking : Transport fiable, estimation et poursuite dans les réseaux Delay Tolerant Networks (DTNs).
Degree: Docteur es, Télécommunications, 2012, Evry, Institut national des télécommunications
URL: http://www.theses.fr/2012TELE0038
► Les réseaux mobiles Ad hoc (MANETs) visent à permettent à des noeuds mobiles de communiquer sans aucun support d'infrastructure. Les MANETs dispersés entrent dans la…
(more)
▼ Les réseaux mobiles Ad hoc (MANETs) visent à permettent à des noeuds mobiles de communiquer sans aucun support d'infrastructure. Les MANETs dispersés entrent dans la catégorie des réseaux tolérants aux délais (DTN), qui sont des réseaux connectés par intermittence et où il n'y a aucun chemin de bout-en-bout persistant à n'importe quel temps donné. Nous proposons, d'abord, un nouveau protocole de transport fiable pour les DTNs basé sur l'utilisation d'accusés de réception ainsi que le codage linéaire aléatoire. Nous modélisons l'évolution du réseau conformément à notre plan en utilisant l'approche fluide. Nous obtenons le temps de transfert d'un fichier en fonction de certains paramètres optimaux obtenus par l'approche d'évolution différentielle. Deuxièmement, Nous proposons ainsi et étudions un nouveau mécanisme d'ACK augmenté, pour améliorer le transport fiable pour les DTNs, pour les cas unicast et multicast. Nous nous servons du codage linéaire aléatoire aux relais pour que les paquets puissent atteindre la destination plus rapidement. Nous obtenons la fiabilité basée sur l'utilisation Global Sélective ACKnowledgement. Enfin, nous abordons le problème de l'estimation de propagation des fichiers dans les DTNs avec livraison directe et le routage épidémique. Nous estimons et suivons le degré de propagation d'un message dans le réseau. Nous fournissons la base analytique à notre cadre d'évaluation avec des aperçus validés en se basant sur des simulations. En plus, nous utilisons le filtre de Kalman et Minimum- Mean-Squared Error (MMSE) pour suivre le processus de propagation et trouvons que le filtre de Kalman fournit des résultats plus précis par rapport à MMSE
Mobile Ad hoc NETworks (MANETs) aim at making communication between mobile nodes feasible without any infrastructure support. Sparse MANETs fall into the class of Delay Tolerant Networks which are intermittently connected networks and where there is no contemporaneous end-to-end path at any given time. We first, propose a new reliable transport scheme for DTNs based on the use of ACKnowledgments and random linear coding. We model the evolution of the network under our scheme using a fluid-limit approach. We optimize our scheme to obtain mean file transfer times on certain optimal parameters obtained through differential evolution approach. Secondly, we propose and study a novel and enhanced ACK to improve reliable transport for DTNs covering both unicast and multicast flows. We make use of random linear coding at relays so that packets can reach the destination faster. We obtain reliability based on the use of so-called Global Selective ACKnowledgment. We obtain significant improvement through G-SACKs and coding at relays. Finally, we tackle the problem of estimating file-spread in DTNs with direct delivery and epidemic routing. We estimate and track the degree of spread of a message in the network. We provide analytical basis to our estimation framework alongwith insights validated with simulations. We observe that the deterministic fluid model can indeed…
Advisors/Committee Members: Chahed, Tijani (thesis director), Altman, Eitan (thesis director).
Subjects/Keywords: Delay tolerant networks; Transport; Codage linéaire aléatoire; Accusé de reception; Approximation de fluide et diffusion; Filtre de Kalman; Delay tolerant networks; Transport; Linear network coding; Acknowledgements; Fluid and diffusion approximation; Filtering Kalman
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ali, A. (2012). Topics in Delay Tolerant Networks (DTNs) : reliable transports, estimation and tracking : Transport fiable, estimation et poursuite dans les réseaux Delay Tolerant Networks (DTNs). (Doctoral Dissertation). Evry, Institut national des télécommunications. Retrieved from http://www.theses.fr/2012TELE0038
Chicago Manual of Style (16th Edition):
Ali, Arshad. “Topics in Delay Tolerant Networks (DTNs) : reliable transports, estimation and tracking : Transport fiable, estimation et poursuite dans les réseaux Delay Tolerant Networks (DTNs).” 2012. Doctoral Dissertation, Evry, Institut national des télécommunications. Accessed April 10, 2021.
http://www.theses.fr/2012TELE0038.
MLA Handbook (7th Edition):
Ali, Arshad. “Topics in Delay Tolerant Networks (DTNs) : reliable transports, estimation and tracking : Transport fiable, estimation et poursuite dans les réseaux Delay Tolerant Networks (DTNs).” 2012. Web. 10 Apr 2021.
Vancouver:
Ali A. Topics in Delay Tolerant Networks (DTNs) : reliable transports, estimation and tracking : Transport fiable, estimation et poursuite dans les réseaux Delay Tolerant Networks (DTNs). [Internet] [Doctoral dissertation]. Evry, Institut national des télécommunications; 2012. [cited 2021 Apr 10].
Available from: http://www.theses.fr/2012TELE0038.
Council of Science Editors:
Ali A. Topics in Delay Tolerant Networks (DTNs) : reliable transports, estimation and tracking : Transport fiable, estimation et poursuite dans les réseaux Delay Tolerant Networks (DTNs). [Doctoral Dissertation]. Evry, Institut national des télécommunications; 2012. Available from: http://www.theses.fr/2012TELE0038
22.
Muralidhar, Anand.
A digital interface for wireless networks.
Degree: PhD, 1200, 2011, University of Illinois – Urbana-Champaign
URL: http://hdl.handle.net/2142/26043
► This dissertation addresses the problem of determining the capacity of wireless networks and how to operate them. Within this context we present results on Gaussian…
(more)
▼ This dissertation addresses the problem of determining the capacity of wireless networks and how to operate them. Within this context we present results on Gaussian relay, interference, and multicast networks.
Two new models for wireless networks are introduced here: the discrete
network and the superposition
network. As with a Gaussian
network, one can construct either a discrete
network or a superposition
network. The discrete
network is obtained by simply quantizing the received signals in the Gaussian model and by restricting the transmit signals to a finite alphabet. The superposition
network, inspired by the Gaussian model, is a noiseless deterministic
network, the inputs and outputs of the channels are discrete, and channel gains are signed integers.
The capacity of a class of Gaussian relay networks and its corresponding discrete or superposition
network is always within a bounded gap, where the gap is independent of channel gains or signal-to-noise ratio (SNR), and depends only on the number M of nodes in the
network. More importantly, a near-optimal
coding strategy for either the discrete or the superposition
network can be converted into a near-optimal
coding strategy for the original Gaussian
network. Hence, both these networks serve as near-optimal digital interfaces for operating the Gaussian
network.
The discrete
network is obtained from a Gaussian
network by simply quantizing the received signals and restricting transmitted signals to a certain finite precision. Since its signals are obtained from those of a Gaussian
network and its transmissions are transmittable as-is on a Gaussian
network, the discrete
network provides a particularly simple quantization-based digital interface for operating layered Gaussian relay networks. These are relay networks in which the nodes are grouped into layers, and only nodes of one layer can transmit to the nodes of the next layer. The cut-set upper bounds on the capacities of the Gaussian and the discrete
network are within an SNR-independent bounded gap of O(M log M) bits. Moreover, a simple
linear network code is a near-optimal
coding strategy for the discrete relay
network, achieving all rates within O(M
2) bits of its cut-set bound, where the bound is independent of channel gains or SNR. The
linear code can be used as-is on the Gaussian
network after quantizing its received signals. It achieves all rates within O(M
2) bits of the capacity for Gaussian relay networks. The
linear network code improves on existing approximately-optimal
coding schemes for the relay
network by virtue of its simplicity and robustness, and it explicitly connects wireline
network coding with codes for Gaussian networks.
The approximation of Gaussian networks by other previously proposed deterministic networks is also studied in this dissertation, and two main results are presented, one positive and the other negative. The gap between the capacity of a Gaussian relay
network and a corresponding
linear deterministic
network can be unbounded. The key…
Advisors/Committee Members: Kumar, P. R. (advisor), Kumar, P. R. (Committee Chair), Hajek, Bruce (committee member), Moulin, Pierre (committee member), Coleman, Todd P. (committee member).
Subjects/Keywords: digital interface; approximate capacity; relay networks; interference networks; linear codes; network coding
…generalization of random linear network
2
coding for wireline networks [8, 9], or for… …SUMMARY OF
2.1 Relay networks . . . .
2.2 Network coding . . . .
2.3 Interference networks… …5 LINEAR NETWORK CODE FOR RELAY NETWORKS
5.1 Linear network code for layered discrete… …relay networks . . . . . .
5.2 Linear network code for layered Gaussian networks… …67
CHAPTER 6 LIFTING CODING SCHEMES FOR THE SUPERPOSITION NETWORK TO THE GAUSSIAN NETWORK…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Muralidhar, A. (2011). A digital interface for wireless networks. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/26043
Chicago Manual of Style (16th Edition):
Muralidhar, Anand. “A digital interface for wireless networks.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 10, 2021.
http://hdl.handle.net/2142/26043.
MLA Handbook (7th Edition):
Muralidhar, Anand. “A digital interface for wireless networks.” 2011. Web. 10 Apr 2021.
Vancouver:
Muralidhar A. A digital interface for wireless networks. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/2142/26043.
Council of Science Editors:
Muralidhar A. A digital interface for wireless networks. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/26043
Georgia Tech
23.
Lanfranchi, Laetitia I.
MPEG-4 AVC traffic analysis and bandwidth prediction for broadband cable networks.
Degree: MS, Electrical and Computer Engineering, 2008, Georgia Tech
URL: http://hdl.handle.net/1853/29776
► In this thesis, we analyze the bandwidth requirements of MPEG-4 AVC video traffic and then propose and evaluate the accuracy of new MPEG-4 AVC video…
(more)
▼ In this thesis, we analyze the bandwidth requirements of MPEG-4 AVC video traffic and then propose and evaluate the accuracy of new MPEG-4 AVC video traffic models.
First, we analyze the bandwidth requirements of the videos by comparing the statistical characteristics of the different frame types. We analyze their coefficient of variability, autocorrelation, and crosscorrelation in both short and long term. The Hurst parameter is also used to investigate the long range dependence of the video traces. We then provide an insight into B-frame dropping and its impact on the statistical characteristics of the video trace.
This leads us to design two algorithms that predict the size of the B-frame and the size of the group of pictures (GOP) in the short-term. To evaluate the accuracy of the prediction, a model for the error is proposed. In a broadband cable
network, B-frame size prediction can be employed by a cable headend to provision video bandwidth efficiently or more importantly, reduce bit rate variability and bandwidth requirements via selective B-frame dropping, thereby minimizing buffering requirements and packet losses at the set top box. It will be shown that the model provides highly accurate prediction, in particular for movies encoded in high quality resolution. The GOP size prediction can be used to provision bandwidth. We then enhance the B-frame and GOP size prediction models using a new scene change detector metric.
Finally, we design an algorithm that predicts the size of different frame types in the long-term. Clearly, a long-term prediction algorithm may suffer degraded prediction accuracy and the higher complexity may result in higher latency. However, this is offset by the additional time available for long-term prediction and the need to forecast bandwidth usage well ahead of time in order to minimize packet losses during periods of peak bandwidth demands. We also analyze the impact of the video quality and the video standard on the accuracy of the model.
Advisors/Committee Members: Bing Benny (Committee Chair), Fred B-H. Juang (Committee Co-Chair), Gee-Kung Chang (Committee Member).
Subjects/Keywords: Video bandwidth analysis; Linear prediction; MPEG-4 AVC; MPEG-4 AAC (Audio coding standard); Broadband communication systems; Cable television; Network performance (Telecommunication); Algorithms; Streaming technology (Telecommunications); Telecommunication Traffic
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lanfranchi, L. I. (2008). MPEG-4 AVC traffic analysis and bandwidth prediction for broadband cable networks. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/29776
Chicago Manual of Style (16th Edition):
Lanfranchi, Laetitia I. “MPEG-4 AVC traffic analysis and bandwidth prediction for broadband cable networks.” 2008. Masters Thesis, Georgia Tech. Accessed April 10, 2021.
http://hdl.handle.net/1853/29776.
MLA Handbook (7th Edition):
Lanfranchi, Laetitia I. “MPEG-4 AVC traffic analysis and bandwidth prediction for broadband cable networks.” 2008. Web. 10 Apr 2021.
Vancouver:
Lanfranchi LI. MPEG-4 AVC traffic analysis and bandwidth prediction for broadband cable networks. [Internet] [Masters thesis]. Georgia Tech; 2008. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/1853/29776.
Council of Science Editors:
Lanfranchi LI. MPEG-4 AVC traffic analysis and bandwidth prediction for broadband cable networks. [Masters Thesis]. Georgia Tech; 2008. Available from: http://hdl.handle.net/1853/29776
24.
Fashandi, Shervan.
Diversity and Reliability in Erasure Networks: Rate Allocation, Coding, and Routing.
Degree: 2012, University of Waterloo
URL: http://hdl.handle.net/10012/6538
► Recently, erasure networks have received significant attention in the literature as they are used to model both wireless and wireline packet-switched networks. Many packet-switched data…
(more)
▼ Recently, erasure networks have received significant attention in the literature as they are used to model both wireless and wireline packet-switched networks. Many packet-switched data networks like wireless mesh networks, the Internet, and Peer-to-peer networks can be modeled as erasure networks. In any erasure network, path diversity works by setting up multiple parallel connections between the end points using the topological path redundancy of the network. Our analysis of diversity over erasure networks studies the problem of rate allocation (RA) across multiple independent paths, coding over erasure channels, and the trade-off between rate and diversity gain in three consecutive chapters.
In the chapter 2, Forward Error Correction (FEC) is applied across multiple independent paths to enhance the end-to-end reliability. We prove that the probability of irrecoverable loss (P_E) decays exponentially with the number of paths. Furthermore, the RA problem across independent paths is studied. Our objective is to find the optimal RA, i.e. the allocation which minimizes P_E. Using memoization technique, a heuristic suboptimal algorithm with polynomial runtime is proposed for RA over a finite number of paths. This algorithm converges to the asymptotically optimal RA when the number of paths is large. For practical number of paths, the simulation results demonstrate the close-to-optimal performance of the proposed algorithm. Chapter 3 addresses the problem of lower-bounding the probability of error (PE) for any block code over an input-independent channel. We derive a lower-bound on PE for a general input-independent channel and find the necessary and sufficient condition to meet this bound with equality. The rest of this chapter applies this lower-bound to three special input-independent channels: erasure channel, super-symmetric Discrete Memoryless Channel (DMC), and q-ary symmetric DMC. It is proved that Maximum Distance Separable (MDS) codes achieve the minimum probability of error over any erasure channel (with or without memory). Chapter 4 addresses a fundamental trade-off between rate and diversity gain of an end-to-end connection in erasure networks. We prove that there exist general erasure networks for which any conventional routing strategy fails to achieve the optimum diversity-rate trade-off.
However, for any general erasure graph, we show that there exists a linear network coding strategy which achieves the optimum diversity-rate trade-off. Unlike the previous works which suggest the potential benefit of linear network coding in the error-free multicast scenario (in terms of the achievable rate), our result demonstrates the benefit of linear network coding in the erasure single-source single-destination scenario (in terms of the diversity gain).
Subjects/Keywords: Erasure networks; Diversity; Routing; Internet; Linear network coding; Diversity-rate trade-off; Path diversity; rate allocation; MDS codes; Forward error correction
…4.2.4 Conventional Routing & Linear Network Coding
4.2.5 Diversity Gain… …4.5.2 Random Routing vs. Linear Network Coding . .
4.6 Conclusion… …1
Copmaring PE of linear network coding, MMR, and MMRD vs. p
. . . . .
1
Copmaring PE of… …linear network coding, MMR, and MMRD vs. p . . . . .
BA model: linear network coding compared… …with conventional routing . . .
Waxman model: linear network coding compared with…
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Fashandi, S. (2012). Diversity and Reliability in Erasure Networks: Rate Allocation, Coding, and Routing. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6538
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Fashandi, Shervan. “Diversity and Reliability in Erasure Networks: Rate Allocation, Coding, and Routing.” 2012. Thesis, University of Waterloo. Accessed April 10, 2021.
http://hdl.handle.net/10012/6538.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Fashandi, Shervan. “Diversity and Reliability in Erasure Networks: Rate Allocation, Coding, and Routing.” 2012. Web. 10 Apr 2021.
Vancouver:
Fashandi S. Diversity and Reliability in Erasure Networks: Rate Allocation, Coding, and Routing. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2021 Apr 10].
Available from: http://hdl.handle.net/10012/6538.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Fashandi S. Diversity and Reliability in Erasure Networks: Rate Allocation, Coding, and Routing. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6538
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
25.
Iwaza, Lana.
Joint Source-Network Coding & Decoding : Codage/Décodage Source-Réseau Conjoint.
Degree: Docteur es, Physique, 2013, Université Paris-Sud – Paris XI
URL: http://www.theses.fr/2013PA112048
► Dans les réseaux traditionnels, la transmission de flux de données s'effectuaient par routage des paquets de la source vers le ou les destinataires. Le codage…
(more)
▼ Dans les réseaux traditionnels, la transmission de flux de données s'effectuaient par routage des paquets de la source vers le ou les destinataires. Le codage réseau (NC) permet aux nœuds intermédiaires du réseau d'effectuer des combinaisons linéaires des paquets de données qui arrivent à leurs liens entrants. Les opérations de codage ont lieu dans un corps de Galois de taille finie q. Aux destinataires, le décodage se fait par une élimination de Gauss des paquets codés-réseau reçus. Cependant, dans les réseaux sans fils, le codage réseau doit souvent faire face à des erreurs de transmission causées par le bruit, les effacements, et les interférences. Ceci est particulièrement problématique pour les applications temps réel, telle la transmission de contenus multimédia, où les contraintes en termes de délais d'acheminement peuvent aboutir à la réception d'un nombre insuffisant de paquets, et par conséquent à des difficultés à décoder les paquets transmis. Dans le meilleurs des cas, certains paquets arrivent à être décodés. Dans le pire des cas, aucun paquet ne peut être décodé.Dans cette thèse, nous proposons des schémas de codage conjoint source-réseau dont l'objectif est de fournir une reconstruction approximative de la source, dans des situations où un décodage parfait est impossible. L'idée consiste à exploiter la redondance de la source au niveau du décodeur afin d'estimer les paquets émis, même quand certains de ces paquets sont perdus après avoir subi un codage réseau. La redondance peut être soit naturelle, c'est-à-dire déjà existante, ou introduite de manière artificielle.Concernant la redondance artificielle, le codage à descriptions multiples (MDC) est choisi comme moyen d'introduire de la redondance structurée entre les paquets non corrélés. En combinant le codage à descriptions multiples et le codage réseau, nous cherchons à obtenir une qualité de reconstruction qui s'améliore progressivement avec le nombre de paquets codés-réseau reçus.Nous considérons deux approches différentes pour générer les descriptions. La première approche consiste à générer les descriptions par une expansion sur trame appliquée à la source avant la quantification. La reconstruction de données se fait par la résolution d'un problème d' optimisation quadratique mixte. La seconde technique utilise une matrice de transformée dans un corps de Galois donné, afin de générer les descriptions, et le décodage se fait par une simple éliminationde Gauss. Ces schémas sont particulièrement intéressants dans un contexte de transmission de contenus multimédia, comme le streaming vidéo, où la qualité s'améliore avec le nombre de descriptions reçues.Une seconde application de tels schémas consiste en la diffusion de données vers des terminaux mobiles à travers des canaux de transmission dont les conditions sont variables. Dans ce contexte, nous étudions la qualité de décodage obtenue pour chacun des deux schémas de codage proposés, et nous comparons les résultats obtenus avec ceux fournis par un schéma de codage réseau classique.En ce qui concerne…
Advisors/Committee Members: Kieffer, Michel (thesis director), Agha, Khaldoun Al (thesis director).
Subjects/Keywords: Codage réseau; Codage à descriptions multiples; Expansion sur trame; Décodage approximatif; Estimation MAP; Problème d'optimisation quadratique mixte; Network coding; Multiple Description Coding; Frame Expansion; Approximate Decoding; MAP estimation; Mixed Integer Linear Problem
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Iwaza, L. (2013). Joint Source-Network Coding & Decoding : Codage/Décodage Source-Réseau Conjoint. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2013PA112048
Chicago Manual of Style (16th Edition):
Iwaza, Lana. “Joint Source-Network Coding & Decoding : Codage/Décodage Source-Réseau Conjoint.” 2013. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed April 10, 2021.
http://www.theses.fr/2013PA112048.
MLA Handbook (7th Edition):
Iwaza, Lana. “Joint Source-Network Coding & Decoding : Codage/Décodage Source-Réseau Conjoint.” 2013. Web. 10 Apr 2021.
Vancouver:
Iwaza L. Joint Source-Network Coding & Decoding : Codage/Décodage Source-Réseau Conjoint. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2013. [cited 2021 Apr 10].
Available from: http://www.theses.fr/2013PA112048.
Council of Science Editors:
Iwaza L. Joint Source-Network Coding & Decoding : Codage/Décodage Source-Réseau Conjoint. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2013. Available from: http://www.theses.fr/2013PA112048
Vilnius Gediminas Technical University
26.
Leonavičius, Romas.
Melizmų sintezė dirbtinių neuronų
tinklais.
Degree: Dissertation, Electronics and Electrical
Engineering, 2007, Vilnius Gediminas Technical University
URL: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2006~D_20070112_145929-44906
;
► Modern methods of speech synthesis are not suitable for restoration of song signals due to lack of vitality and intonation in the resulted sounds. The…
(more)
▼ Modern methods of speech synthesis are not
suitable for restoration of song signals due to lack of vitality
and intonation in the resulted sounds. The aim of presented work is
to synthesize melismas met in Lithuanian folk songs, by applying
Artificial Neural Networks. An analytical survey of rather a
widespread literature is presented. First classification and
comprehensive discussion of melismas are given. The theory of
dynamic systems which will make the basis for studying melismas is
presented and finally the relationship for modeling a melisma with
nonlinear and dynamic systems is outlined. Investigation of the
most widely used
Linear Prediction
Coding method and possibilities
of its improvement. The modification of original
Linear Prediction
method based on dynamic LPC frame positioning is proposed. On its
basis, the new melisma synthesis technique is presented. Developed
flexible generalized melisma model, based on two Artificial Neural
Networks – a Multilayer Perceptron and Adaline – as well as on two
network training algorithms – Levenberg- Marquardt and the Least
Squares error minimization – is presented. Moreover, original
mathematical models of Fortis, Gruppett, Mordent and Trill are
created, fit for synthesizing melismas, and their minimal sizes are
proposed. The last chapter concerns experimental investigation,
using over 500 melisma records, and corroborates application of the
new mathematical models to melisma synthesis of one
performer.
Advisors/Committee Members: Skudutis, Julius (Doctoral dissertation committee member), Rudžionis, Algimantas (Doctoral dissertation committee member), Paulikas, Šarūnas (Doctoral dissertation opponent), Apanavičius, Romualdas (Doctoral dissertation opponent), Lipeika, Antanas Leonas (Doctoral dissertation committee member), Kajackas, Algimantas (Doctoral dissertation committee member), Martavičius, Romanas (Doctoral dissertation committee chair), Navakauskas, Dalius (Doctoral dissertation supervisor).
Subjects/Keywords: Mordentas; Fortis; Mordent; Gruppett; Dirbtinių neuronų tinklai; Grupetas; TPK; Trelė; Adaline; Daina; Song; Sintezė; Synthesis; VNR; Artificial neural network; Melizma; LPC; Multilayer perceptron; DNT; Tiesinės prognozės
koeficientai; ANT; Levenberg-Marquardt; Mean opinion score; Linear prediction coding; Foršlagas; Adalina; Daugiasluoksnis perceptronas; Melisma; MOS; Vidutinės nuomonės
rezultatas; Trill
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Leonavičius, R. (2007). Melizmų sintezė dirbtinių neuronų
tinklais. (Doctoral Dissertation). Vilnius Gediminas Technical University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2006~D_20070112_145929-44906 ;
Chicago Manual of Style (16th Edition):
Leonavičius, Romas. “Melizmų sintezė dirbtinių neuronų
tinklais.” 2007. Doctoral Dissertation, Vilnius Gediminas Technical University. Accessed April 10, 2021.
http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2006~D_20070112_145929-44906 ;.
MLA Handbook (7th Edition):
Leonavičius, Romas. “Melizmų sintezė dirbtinių neuronų
tinklais.” 2007. Web. 10 Apr 2021.
Vancouver:
Leonavičius R. Melizmų sintezė dirbtinių neuronų
tinklais. [Internet] [Doctoral dissertation]. Vilnius Gediminas Technical University; 2007. [cited 2021 Apr 10].
Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2006~D_20070112_145929-44906 ;.
Council of Science Editors:
Leonavičius R. Melizmų sintezė dirbtinių neuronų
tinklais. [Doctoral Dissertation]. Vilnius Gediminas Technical University; 2007. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2006~D_20070112_145929-44906 ;
Vilnius Gediminas Technical University
27.
Leonavičius, Romas.
Melizmų sintezė dirbtinių neuronų
tinklais.
Degree: PhD, Electronics and Electrical
Engineering, 2007, Vilnius Gediminas Technical University
URL: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2006~D_20070112_151232-71106
;
► Modern methods of speech synthesis are not suitable for restoration of song signals due to lack of vitality and intonation in the resulted sounds. The…
(more)
▼ Modern methods of speech synthesis are not
suitable for restoration of song signals due to lack of vitality
and intonation in the resulted sounds. The aim of presented work is
to synthesize melismas met in Lithuanian folk songs, by applying
Artificial Neural Networks. An analytical survey of rather a
widespread literature is presented. First classification and
comprehensive discussion of melismas are given. The theory of
dynamic systems which will make the basis for studying melismas is
presented and finally the relationship for modeling a melisma with
nonlinear and dynamic systems is outlined. Investigation of the
most widely used
Linear Prediction
Coding method and possibilities
of its improvement. The modification of original
Linear Prediction
method based on dynamic LPC frame positioning is proposed. On its
basis, the new melisma synthesis technique is presented. Developed
flexible generalized melisma model, based on two Artificial Neural
Networks – a Multilayer Perceptron and Adaline – as well as on two
network training algorithms – Levenberg- Marquardt and the Least
Squares error minimization – is presented. Moreover, original
mathematical models of Fortis, Gruppett, Mordent and Trill are
created, fit for synthesizing melismas, and their minimal sizes are
proposed. The last chapter concerns experimental investigation,
using over 500 melisma records, and corroborates application of the
new mathematical models to melisma synthesis of one
performer.
Advisors/Committee Members: Paulikas, Šarūnas (Doctoral dissertation opponent), Skudutis, Julius (Doctoral dissertation committee member), Martavičius, Romanas (Doctoral dissertation committee chair), Apanavičius, Romualdas (Doctoral dissertation opponent), Navakauskas, Dalius (Doctoral dissertation supervisor), Lipeika, Antanas Leonas (Doctoral dissertation committee member), Kajackas, Algimantas (Doctoral dissertation committee member), Rudžionis, Algimantas (Doctoral dissertation committee member).
Subjects/Keywords: Melisma; Grupetas; Mean opinion score; Foršlagas; Trill; Mordentas; Dirbtinių neuronų tinklai; VNR; TPK; Song; Synthesis; Melizma; Adalina; Vidutinės nuomonės
rezultatas; Artificial neural network; Gruppett; Linear prediction coding; LPC; DNT; Daugiasluoksnis perceptronas; Daina; ANT; MOS; Levenberg-Marquardt; Multilayer perceptron; Mordent; Tiesinės prognozės
koeficientai; Fortis; Adaline; Sintezė; Trelė
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Leonavičius, R. (2007). Melizmų sintezė dirbtinių neuronų
tinklais. (Doctoral Dissertation). Vilnius Gediminas Technical University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2006~D_20070112_151232-71106 ;
Chicago Manual of Style (16th Edition):
Leonavičius, Romas. “Melizmų sintezė dirbtinių neuronų
tinklais.” 2007. Doctoral Dissertation, Vilnius Gediminas Technical University. Accessed April 10, 2021.
http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2006~D_20070112_151232-71106 ;.
MLA Handbook (7th Edition):
Leonavičius, Romas. “Melizmų sintezė dirbtinių neuronų
tinklais.” 2007. Web. 10 Apr 2021.
Vancouver:
Leonavičius R. Melizmų sintezė dirbtinių neuronų
tinklais. [Internet] [Doctoral dissertation]. Vilnius Gediminas Technical University; 2007. [cited 2021 Apr 10].
Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2006~D_20070112_151232-71106 ;.
Council of Science Editors:
Leonavičius R. Melizmų sintezė dirbtinių neuronų
tinklais. [Doctoral Dissertation]. Vilnius Gediminas Technical University; 2007. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2006~D_20070112_151232-71106 ;
. 
Open Access Theses and Dissertations
