Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(noisy feedback). Showing records 1 – 3 of 3 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Notre Dame

1. Utsaw Kumar. Network Communications with Feedback via Stochastic Approximation</h1>.

Degree: MSin Electrical Engineering, Electrical Engineering, 2009, University of Notre Dame

It is known that noiseless feedback does not increase the capacity of memoryless point-to-point channels. However, such feedback can considerably increase the reliability or reduce the coding complexity of schemes that approach capacity. This thesis first develops a new class of coding schemes for additive white noise channels with feedback corrupted by additive noise, focusing much of the results and discussions on additive white Gaussian noise channels. These schemes are variants of the well-known Schalkwijk-Kailath coding scheme and are based upon techniques from stochastic approximation. The resulting schemes enable a tradeoff between transmission rate and mean-square error performance in the presence of noisy feedback. By contrast, straightforward application of the classic Schalkwijk-Kailath schemes offer enhanced rate or reliability in the presence of noisy feedback, but do not provide a trade-off between the two. This thesis also develops cooperative communication strategies based upon distributed stochastic approximation algorithms for the Gaussian relay channel with several configurations of perfect and noisy feedback. In addition to being simple, the strategies can be shown to provide doubly exponential error decay in the case of noiseless feedback and appealing tradeoffs between effective transmission rate and reliability in the case of noisy feedback. Advisors/Committee Members: J. N. Laneman, Committee Chair, V. Gupta, Committee Co-Chair.

Subjects/Keywords: stochastic approximation; noisy feedback; cascade of point-to-point channels; consensus algorithms; relay channel

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kumar, U. (2009). Network Communications with Feedback via Stochastic Approximation</h1>. (Masters Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/xp68kd20018

Chicago Manual of Style (16th Edition):

Kumar, Utsaw. “Network Communications with Feedback via Stochastic Approximation</h1>.” 2009. Masters Thesis, University of Notre Dame. Accessed October 22, 2019. https://curate.nd.edu/show/xp68kd20018.

MLA Handbook (7th Edition):

Kumar, Utsaw. “Network Communications with Feedback via Stochastic Approximation</h1>.” 2009. Web. 22 Oct 2019.

Vancouver:

Kumar U. Network Communications with Feedback via Stochastic Approximation</h1>. [Internet] [Masters thesis]. University of Notre Dame; 2009. [cited 2019 Oct 22]. Available from: https://curate.nd.edu/show/xp68kd20018.

Council of Science Editors:

Kumar U. Network Communications with Feedback via Stochastic Approximation</h1>. [Masters Thesis]. University of Notre Dame; 2009. Available from: https://curate.nd.edu/show/xp68kd20018


University of California – San Diego

2. Chiu, Sung-En. Noisy Binary Search: Practical Algorithms and Applications.

Degree: Electrical and Computer Engineering, 2019, University of California – San Diego

This dissertation addresses the problem of searching a target within a region by sequentialqueries with noisy responses. A Bayesian decision maker is responsible to collect observationsamples so as to enhance his knowledge about the true location in a speedy manner. When theresponse is noiseless, the classical binary search solves such a problem optimally. Noisy binary search,on the other hand, has also been formulated and studied extensively in theory over the past 60 yearssince Horstein (1963). However, the algorithms developed in noisy binary search problem findlimited practical applications in real-world engineer problem. Motivated by bridging theory andpractice, we formulate the noisy binary search problem by identifying practical scenarios andconstraints that naturally rises with practical applications such as spectrum sensing in cognitivecommunication, AoA estimation by adaptive beamforming in large antenna array system, visualimage inspection, bit-wise data transmission, heavy hitter detection in network system, etc.The first part of the dissertation (Chapter 2) focuses on theoretical understanding anddeveloping noisy binary search algorithms under those practical constraints. Three algorithmssortPM, dyaPM, hiePM are proposed. Using the extrinsic Jensen Divergence from information theory, we provide upper bound for the expected search time of each of the algorithms. Bycomparing with an information theoretic lower bound, we demonstrate the asymptotic optimalityand suboptimality of the proposed algorithms (asymptotic in the resolution of the target location).The second part of the dissertation applies the proposed hiePM to practical problems. Inparticular, Chapter 3 demonstrates the application of hiePM on the data transmission problemwith noiseless feedback. The dyadic hierarchical query area of hiePM relates directly to thebit representation of the data stream. This simplifies significantly the corresponding adaptiveencoding scheme and allows a bit-wise encoding. Chapter 4 considers the initial beam alignmentproblem in 5G mmWave communication using beamforming. With a single-path channel model,the problem is reduced to actively searching the Angle-of-Arrival (AoA) of the signal sent fromthe user to the Base Station (BS). hiePM is applied to adaptively and sequentially choose thebeamforming from the hierarchical beamforming codebook. The proposed algorithm is comparedto prior works of initial beam alignment that employs linear beam search, repeat binary search,or random beam search, respectively, and gives the state-of-art performance in terms of bothAoA estimation error at the end of the initial alignment, and the spectral efficiency during thecommunication phase.

Subjects/Keywords: Electrical engineering; Theoretical mathematics; Information science; Beamforming; Extrinsic Jensen Shannon Divergence; Feedback Coding; Initial Beam Alignment; mmWave communication; Noisy Binary Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chiu, S. (2019). Noisy Binary Search: Practical Algorithms and Applications. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/88f4m6m7

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):

Chiu, Sung-En. “Noisy Binary Search: Practical Algorithms and Applications.” 2019. Thesis, University of California – San Diego. Accessed October 22, 2019. http://www.escholarship.org/uc/item/88f4m6m7.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chiu, Sung-En. “Noisy Binary Search: Practical Algorithms and Applications.” 2019. Web. 22 Oct 2019.

Vancouver:

Chiu S. Noisy Binary Search: Practical Algorithms and Applications. [Internet] [Thesis]. University of California – San Diego; 2019. [cited 2019 Oct 22]. Available from: http://www.escholarship.org/uc/item/88f4m6m7.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chiu S. Noisy Binary Search: Practical Algorithms and Applications. [Thesis]. University of California – San Diego; 2019. Available from: http://www.escholarship.org/uc/item/88f4m6m7

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


ETH Zürich

3. Wigger, Angela Michèle. Cooperation on the Multiple-Access Channel.

Degree: 2008, ETH Zürich

We study the two-user additive white Gaussian noise (AWGN) multipleaccess channel (MAC), i.e., a scenario where two transmitters communicate with a common receiver and where the receiver observes the sum of the two transmitted signals in additive white Gaussian noise. In the classical MAC the transmitters can cooperate only through the choice of the codebooks but not based on their messages, because each transmitter is completely ignorant of the other transmitter’s message. Here, we consider two variations of the classical MAC where the transmitters have additional means to cooperate. The first variation involves that the two transmitters observe imperfect feedback from the channel outputs, and thus each transmitter can generate its signal also depending on the observed feedback outputs (which depend on both messages). The second variation involves that prior to each transmission block the two transmitters can communicate over noise-free bit-pipes of given capacities. Thus, each transmitter can generate its signal also depending on the observed pipe outputs (which depend on the other transmitter’s message). For the first variation, called the AWGN MAC with imperfect feedback, we study four different kinds of imperfect feedback: 1.) noisy feedback, where both transmitters have feedback that is corrupted by additive white Gaussian noise; 2.) noisy partial feedback, where one transmitter has noisy feedback and the other no feedback; 3.) perfect partial feedback, where one transmitter has perfect feedback and the other no feedback; and 4.) noisy feedback with receiver side-information, where both transmitters have noisy feedback and the receiver is perfectly cognizant of the feedback noises. For all four kinds of feedback we derive new achievable rate regions. These regions exhibit that, irrespective of the Gaussian feedback-noise variances, for all four kinds of feedback the capacity region with feedback is strictly larger than without. Moreover, for certain channel parameters our new achievable region for perfect partial feedback is strictly larger than the Cover-Leung region. This answers in the negative a question posed by van der Meulen as to whether the Cover-Leung region equals the capacity region of the AWGN MAC with perfect partial feedback. Finally, our achievable region for noisy feedback converges to the perfectfeedback capacity region as both feedback-noise variances tend to 0. For the second variation, called the two-user AWGN MAC with conferencing encoders, we derive the capacity region. Our derivation introduces a new technique for proving optimality of Gaussian distributions in certain optimization problems involving mutual information expressions with a Markovity constraint. This technique is fairly general and can also be used to establish optimality of jointly Gaussian Markov distributions for the Slepian-Wolf region (for the AWGN MAC with a common message) and for the Cover-Leung region (for the AWGN MAC with perfect or perfect partial feedback). We also consider a Costa-type extension of the AWGNMAC… Advisors/Committee Members: Lapidoth, Amos, Gastpar, Michael, Lapidoth, Amos.

Subjects/Keywords: Costa; channel capacity; GAUSSSCHES RAUSCHEN + WEISSES RAUSCHEN (WAHRSCHEINLICHKEITSRECHNUNG); interference, Markov conditions; capacity region; multiple-access channel; QUELLCODIERUNG + KANALCODIERUNG (INFORMATIONSTHEORIE); writing on dirty paper; additive white Gaussian noise; conferencing encoders; SOURCE CODING + CHANNEL CODING (INFORMATION THEORY); MATHEMATICAL ASPECTS OF INFORMATION THEORY; feedback; partial feedback; bit-pipes; noisy feedback; GAUSSIAN NOISE + WHITE NOISE (PROBABILITY THEORY); cooperation; MATHEMATISCHE ASPEKTE DER INFORMATIONSTHEORIE; info:eu-repo/classification/ddc/621.3; Electric engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wigger, A. M. (2008). Cooperation on the Multiple-Access Channel. (Doctoral Dissertation). ETH Zürich. Retrieved from http://hdl.handle.net/20.500.11850/13053

Chicago Manual of Style (16th Edition):

Wigger, Angela Michèle. “Cooperation on the Multiple-Access Channel.” 2008. Doctoral Dissertation, ETH Zürich. Accessed October 22, 2019. http://hdl.handle.net/20.500.11850/13053.

MLA Handbook (7th Edition):

Wigger, Angela Michèle. “Cooperation on the Multiple-Access Channel.” 2008. Web. 22 Oct 2019.

Vancouver:

Wigger AM. Cooperation on the Multiple-Access Channel. [Internet] [Doctoral dissertation]. ETH Zürich; 2008. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/20.500.11850/13053.

Council of Science Editors:

Wigger AM. Cooperation on the Multiple-Access Channel. [Doctoral Dissertation]. ETH Zürich; 2008. Available from: http://hdl.handle.net/20.500.11850/13053

.