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

University: Indian Institute of Science

You searched for subject:(Decoding). Showing records 1 – 14 of 14 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Indian Institute of Science

1. Natarajan, Lakshmi Prasad. Low-Complexity Decoding and Construction of Space-Time Block Codes.

Degree: 2013, Indian Institute of Science

 Space-Time Block Coding is an efficient communication technique used in multiple-input multiple-output wireless systems. The complexity with which a Space-Time Block Code (STBC) can be… (more)

Subjects/Keywords: Space-Time Block Codes (STBC); Multiple-input Multiple-Output (MIMO) Channels; Decoding (Space-Time Block Codes); Low Complexity Decoding; Fading Channels; Non Maximum-Likelihood Decoding; Decoders (Electronics); Wireless Communication Systems; Maximum-Likelihood Decoding; Coding Theory; Zero-Forcing Decoding; Zero-Forcing Decoder; STBCs; Communication Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Natarajan, L. P. (2013). Low-Complexity Decoding and Construction of Space-Time Block Codes. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/2005/3372 ; http://etd.iisc.ernet.in/abstracts/4238/G25772-Abs.pdf

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

Natarajan, Lakshmi Prasad. “Low-Complexity Decoding and Construction of Space-Time Block Codes.” 2013. Thesis, Indian Institute of Science. Accessed March 28, 2020. http://etd.iisc.ernet.in/2005/3372 ; http://etd.iisc.ernet.in/abstracts/4238/G25772-Abs.pdf.

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

MLA Handbook (7th Edition):

Natarajan, Lakshmi Prasad. “Low-Complexity Decoding and Construction of Space-Time Block Codes.” 2013. Web. 28 Mar 2020.

Vancouver:

Natarajan LP. Low-Complexity Decoding and Construction of Space-Time Block Codes. [Internet] [Thesis]. Indian Institute of Science; 2013. [cited 2020 Mar 28]. Available from: http://etd.iisc.ernet.in/2005/3372 ; http://etd.iisc.ernet.in/abstracts/4238/G25772-Abs.pdf.

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

Council of Science Editors:

Natarajan LP. Low-Complexity Decoding and Construction of Space-Time Block Codes. [Thesis]. Indian Institute of Science; 2013. Available from: http://etd.iisc.ernet.in/2005/3372 ; http://etd.iisc.ernet.in/abstracts/4238/G25772-Abs.pdf

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


Indian Institute of Science

2. Jithamithra, G R. Space-Time Block Codes With Low Sphere-Decoding Complexity.

Degree: 2013, Indian Institute of Science

 One of the most popular ways to exploit the advantages of a multiple-input multiple-output (MIMO) system is using space time block coding. A space time… (more)

Subjects/Keywords: Multiple-Input Multiple-Output (MIMO) Systems; Space-Time Block Codes; Block Orthogonal Space-Time Block Codes; Low Sphere Decoding Complexity; Decoders (Electronics); Sphere Decoder; Hurwitz-Radon Quadratic Form (HRQF); Maximum-Likelihood Decoding; Sphere Decoding Complexity; Fast Sphere Decoding Complexity; Block Orthogonal Codes; Block Orthogonal STBCs; Communication Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jithamithra, G. R. (2013). Space-Time Block Codes With Low Sphere-Decoding Complexity. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2612 ; http://etd.ncsi.iisc.ernet.in/abstracts/3405/G26284-Abs.pdf

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

Jithamithra, G R. “Space-Time Block Codes With Low Sphere-Decoding Complexity.” 2013. Thesis, Indian Institute of Science. Accessed March 28, 2020. http://etd.iisc.ernet.in/handle/2005/2612 ; http://etd.ncsi.iisc.ernet.in/abstracts/3405/G26284-Abs.pdf.

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

MLA Handbook (7th Edition):

Jithamithra, G R. “Space-Time Block Codes With Low Sphere-Decoding Complexity.” 2013. Web. 28 Mar 2020.

Vancouver:

Jithamithra GR. Space-Time Block Codes With Low Sphere-Decoding Complexity. [Internet] [Thesis]. Indian Institute of Science; 2013. [cited 2020 Mar 28]. Available from: http://etd.iisc.ernet.in/handle/2005/2612 ; http://etd.ncsi.iisc.ernet.in/abstracts/3405/G26284-Abs.pdf.

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

Council of Science Editors:

Jithamithra GR. Space-Time Block Codes With Low Sphere-Decoding Complexity. [Thesis]. Indian Institute of Science; 2013. Available from: http://etd.iisc.ernet.in/handle/2005/2612 ; http://etd.ncsi.iisc.ernet.in/abstracts/3405/G26284-Abs.pdf

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


Indian Institute of Science

3. Jithamithra, G R. Space-Time Block Codes With Low Sphere-Decoding Complexity.

Degree: 2013, Indian Institute of Science

 One of the most popular ways to exploit the advantages of a multiple-input multiple-output (MIMO) system is using space time block coding. A space time… (more)

Subjects/Keywords: Multiple-Input Multiple-Output (MIMO) Systems; Space-Time Block Codes; Block Orthogonal Space-Time Block Codes; Low Sphere Decoding Complexity; Decoders (Electronics); Sphere Decoder; Hurwitz-Radon Quadratic Form (HRQF); Maximum-Likelihood Decoding; Sphere Decoding Complexity; Fast Sphere Decoding Complexity; Block Orthogonal Codes; Block Orthogonal STBCs; Communication Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jithamithra, G. R. (2013). Space-Time Block Codes With Low Sphere-Decoding Complexity. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2612

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

Jithamithra, G R. “Space-Time Block Codes With Low Sphere-Decoding Complexity.” 2013. Thesis, Indian Institute of Science. Accessed March 28, 2020. http://hdl.handle.net/2005/2612.

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

MLA Handbook (7th Edition):

Jithamithra, G R. “Space-Time Block Codes With Low Sphere-Decoding Complexity.” 2013. Web. 28 Mar 2020.

Vancouver:

Jithamithra GR. Space-Time Block Codes With Low Sphere-Decoding Complexity. [Internet] [Thesis]. Indian Institute of Science; 2013. [cited 2020 Mar 28]. Available from: http://hdl.handle.net/2005/2612.

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

Council of Science Editors:

Jithamithra GR. Space-Time Block Codes With Low Sphere-Decoding Complexity. [Thesis]. Indian Institute of Science; 2013. Available from: http://hdl.handle.net/2005/2612

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


Indian Institute of Science

4. Krishnan, K Murali. Computational Problems In Codes On Graphs.

Degree: 2007, Indian Institute of Science

 Two standard graph representations for linear codes are the Tanner graph and the tailbiting trellis. Such graph representations allow the decoding problem for a code… (more)

Subjects/Keywords: Coding Theory; Graphs And Graphical Representation; Tanner Graphs; Tail-biting Trellises; Decoding; Tail-biting Trellis Decoding; LDPC Codes; Linear Codes; Linear Block Codes; Stopping Distance; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krishnan, K. M. (2007). Computational Problems In Codes On Graphs. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/487

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

Krishnan, K Murali. “Computational Problems In Codes On Graphs.” 2007. Thesis, Indian Institute of Science. Accessed March 28, 2020. http://hdl.handle.net/2005/487.

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

MLA Handbook (7th Edition):

Krishnan, K Murali. “Computational Problems In Codes On Graphs.” 2007. Web. 28 Mar 2020.

Vancouver:

Krishnan KM. Computational Problems In Codes On Graphs. [Internet] [Thesis]. Indian Institute of Science; 2007. [cited 2020 Mar 28]. Available from: http://hdl.handle.net/2005/487.

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

Council of Science Editors:

Krishnan KM. Computational Problems In Codes On Graphs. [Thesis]. Indian Institute of Science; 2007. Available from: http://hdl.handle.net/2005/487

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


Indian Institute of Science

5. Gupta, Anindya. Functional Index Coding, Network Function Computation, and Sum-Product Algorithm for Decoding Network Codes.

Degree: 2016, Indian Institute of Science

 Network coding was introduced as a means to increase throughput in communication networks when compared to routing. Network coding can be used not only to… (more)

Subjects/Keywords: Network Coding; Functional Index Coding; Network Function Computation; Sum-Product Algorithm; Functional Source Coding; Error Correcting Codes (Information Theory); Scalar Codes; Matroidal Networks; Error Correcting Functional Source Codes; Decoding Network Codes; Decoding Nonlinear Network Codes; Functional Index Coding Problems; Electrical Communication Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gupta, A. (2016). Functional Index Coding, Network Function Computation, and Sum-Product Algorithm for Decoding Network Codes. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2999

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

Gupta, Anindya. “Functional Index Coding, Network Function Computation, and Sum-Product Algorithm for Decoding Network Codes.” 2016. Thesis, Indian Institute of Science. Accessed March 28, 2020. http://hdl.handle.net/2005/2999.

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

MLA Handbook (7th Edition):

Gupta, Anindya. “Functional Index Coding, Network Function Computation, and Sum-Product Algorithm for Decoding Network Codes.” 2016. Web. 28 Mar 2020.

Vancouver:

Gupta A. Functional Index Coding, Network Function Computation, and Sum-Product Algorithm for Decoding Network Codes. [Internet] [Thesis]. Indian Institute of Science; 2016. [cited 2020 Mar 28]. Available from: http://hdl.handle.net/2005/2999.

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

Council of Science Editors:

Gupta A. Functional Index Coding, Network Function Computation, and Sum-Product Algorithm for Decoding Network Codes. [Thesis]. Indian Institute of Science; 2016. Available from: http://hdl.handle.net/2005/2999

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


Indian Institute of Science

6. Raveendran, Nithin. A Modified Sum-Product Algorithm over Graphs with Short Cycles.

Degree: 2015, Indian Institute of Science

 We investigate into the limitations of the sum-product algorithm for binary low density parity check (LDPC) codes having isolated short cycles. Independence assumption among messages… (more)

Subjects/Keywords: Computer Mathematics; Decoding Algorithms; Sum-Product Algorithms; Low Density Parity Check Codes (LDPC); Error Control Codes; Graphical Codes; Modified Message Passing Algorithm; Tanner Grpahs; Graph Algorithms; Cycle (Graph Theory); Short Cycle Graphs; Graphs; Iterative Decoding Algorithm; Electronic System Engineerin

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Raveendran, N. (2015). A Modified Sum-Product Algorithm over Graphs with Short Cycles. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/2005/3847 ; http://etd.iisc.ernet.in/abstracts/4719/G27110-Abs.pdf

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

Raveendran, Nithin. “A Modified Sum-Product Algorithm over Graphs with Short Cycles.” 2015. Thesis, Indian Institute of Science. Accessed March 28, 2020. http://etd.iisc.ernet.in/2005/3847 ; http://etd.iisc.ernet.in/abstracts/4719/G27110-Abs.pdf.

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

MLA Handbook (7th Edition):

Raveendran, Nithin. “A Modified Sum-Product Algorithm over Graphs with Short Cycles.” 2015. Web. 28 Mar 2020.

Vancouver:

Raveendran N. A Modified Sum-Product Algorithm over Graphs with Short Cycles. [Internet] [Thesis]. Indian Institute of Science; 2015. [cited 2020 Mar 28]. Available from: http://etd.iisc.ernet.in/2005/3847 ; http://etd.iisc.ernet.in/abstracts/4719/G27110-Abs.pdf.

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

Council of Science Editors:

Raveendran N. A Modified Sum-Product Algorithm over Graphs with Short Cycles. [Thesis]. Indian Institute of Science; 2015. Available from: http://etd.iisc.ernet.in/2005/3847 ; http://etd.iisc.ernet.in/abstracts/4719/G27110-Abs.pdf

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


Indian Institute of Science

7. Adarsha Rao, S J. Polymorphic ASIC : For Video Decoding.

Degree: 2013, Indian Institute of Science

 Video applications are becoming ubiquitous in recent times due to an explosion in the number of devices with video capture and display capabilities. Traditionally, video… (more)

Subjects/Keywords: Application Specific Integrated Circuits (ASIC); Polymorphic ASIC (Applicaion Specific Integrated Circuits); Unified Software and Hardware Architecture (USHA); Video Decoding; Polymorphic ASIC Architecture; Multiprocessor System-On-Chip (MPSoC); H.264 Decoder; Video Encoding; H.264 Decoders; H.264 Decoding; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Adarsha Rao, S. J. (2013). Polymorphic ASIC : For Video Decoding. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/3291

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

Adarsha Rao, S J. “Polymorphic ASIC : For Video Decoding.” 2013. Thesis, Indian Institute of Science. Accessed March 28, 2020. http://hdl.handle.net/2005/3291.

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

MLA Handbook (7th Edition):

Adarsha Rao, S J. “Polymorphic ASIC : For Video Decoding.” 2013. Web. 28 Mar 2020.

Vancouver:

Adarsha Rao SJ. Polymorphic ASIC : For Video Decoding. [Internet] [Thesis]. Indian Institute of Science; 2013. [cited 2020 Mar 28]. Available from: http://hdl.handle.net/2005/3291.

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

Council of Science Editors:

Adarsha Rao SJ. Polymorphic ASIC : For Video Decoding. [Thesis]. Indian Institute of Science; 2013. Available from: http://hdl.handle.net/2005/3291

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


Indian Institute of Science

8. Kalyanarama Sesha Sayee, KCV. Scheduling For Stable And Reliable Communication Over Multiaccess Channels And Degraded Broadcast Channels.

Degree: 2006, Indian Institute of Science

 Information-theoretic arguments focus on modeling the reliability of information transmission, assuming availability of infinite data at sources, thus ignoring randomness in message generation times at… (more)

Subjects/Keywords: Broadcasting Channels; Telecommunication; Wireless Communication Systems; Information Theory; Coding And Decoding; Multiaccess Communication; Multiclass Discrete-Time Processor-Sharing Queueing Model; Degraded Broadcast Channels; Multiaccess Channels; Communications Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kalyanarama Sesha Sayee, K. (2006). Scheduling For Stable And Reliable Communication Over Multiaccess Channels And Degraded Broadcast Channels. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/362

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

Kalyanarama Sesha Sayee, KCV. “Scheduling For Stable And Reliable Communication Over Multiaccess Channels And Degraded Broadcast Channels.” 2006. Thesis, Indian Institute of Science. Accessed March 28, 2020. http://hdl.handle.net/2005/362.

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

MLA Handbook (7th Edition):

Kalyanarama Sesha Sayee, KCV. “Scheduling For Stable And Reliable Communication Over Multiaccess Channels And Degraded Broadcast Channels.” 2006. Web. 28 Mar 2020.

Vancouver:

Kalyanarama Sesha Sayee K. Scheduling For Stable And Reliable Communication Over Multiaccess Channels And Degraded Broadcast Channels. [Internet] [Thesis]. Indian Institute of Science; 2006. [cited 2020 Mar 28]. Available from: http://hdl.handle.net/2005/362.

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

Council of Science Editors:

Kalyanarama Sesha Sayee K. Scheduling For Stable And Reliable Communication Over Multiaccess Channels And Degraded Broadcast Channels. [Thesis]. Indian Institute of Science; 2006. Available from: http://hdl.handle.net/2005/362

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


Indian Institute of Science

9. Garga, Ganesh. Flexible Constraint Length Viterbi Decoders On Large Wire-area Interconnection Topologies.

Degree: 2009, Indian Institute of Science

 To achieve the goal of efficient ”anytime, anywhere” communication, it is essential to develop mobile devices which can efficiently support multiple wireless communication standards. Also,… (more)

Subjects/Keywords: Computer Network Topology; Wide Area Communication; Channel Coding; Viterbi Decoder; Channel Decoding Algorithms; Convolutional Coding; Turbo Coding; Mobile Communication; De Bruijn Interconnection Network; Communication Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Garga, G. (2009). Flexible Constraint Length Viterbi Decoders On Large Wire-area Interconnection Topologies. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/975

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

Garga, Ganesh. “Flexible Constraint Length Viterbi Decoders On Large Wire-area Interconnection Topologies.” 2009. Thesis, Indian Institute of Science. Accessed March 28, 2020. http://hdl.handle.net/2005/975.

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

MLA Handbook (7th Edition):

Garga, Ganesh. “Flexible Constraint Length Viterbi Decoders On Large Wire-area Interconnection Topologies.” 2009. Web. 28 Mar 2020.

Vancouver:

Garga G. Flexible Constraint Length Viterbi Decoders On Large Wire-area Interconnection Topologies. [Internet] [Thesis]. Indian Institute of Science; 2009. [cited 2020 Mar 28]. Available from: http://hdl.handle.net/2005/975.

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

Council of Science Editors:

Garga G. Flexible Constraint Length Viterbi Decoders On Large Wire-area Interconnection Topologies. [Thesis]. Indian Institute of Science; 2009. Available from: http://hdl.handle.net/2005/975

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


Indian Institute of Science

10. Deshpande, Naveen. Constellation Constrained Capacity For Two-User Broadcast Channels.

Degree: 2010, Indian Institute of Science

 A Broadcast Channel is a communication path between a single source and two or more receivers or users. The source intends to communicate independent information… (more)

Subjects/Keywords: Communication Networks; Gaussian Brodcast Channel (GBC); Fading Broadcast Channel (FBC); Broadcasting Channels; Coding and Decoding; Telecommunication; Broadcast Channels; Additive White Gaussian Noise (AWGN); Communication Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Deshpande, N. (2010). Constellation Constrained Capacity For Two-User Broadcast Channels. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/1281

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

Deshpande, Naveen. “Constellation Constrained Capacity For Two-User Broadcast Channels.” 2010. Thesis, Indian Institute of Science. Accessed March 28, 2020. http://hdl.handle.net/2005/1281.

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

MLA Handbook (7th Edition):

Deshpande, Naveen. “Constellation Constrained Capacity For Two-User Broadcast Channels.” 2010. Web. 28 Mar 2020.

Vancouver:

Deshpande N. Constellation Constrained Capacity For Two-User Broadcast Channels. [Internet] [Thesis]. Indian Institute of Science; 2010. [cited 2020 Mar 28]. Available from: http://hdl.handle.net/2005/1281.

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

Council of Science Editors:

Deshpande N. Constellation Constrained Capacity For Two-User Broadcast Channels. [Thesis]. Indian Institute of Science; 2010. Available from: http://hdl.handle.net/2005/1281

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


Indian Institute of Science

11. Deshpande, Naveen. Constellation Constrained Capacity For Two-User Broadcast Channels.

Degree: 2010, Indian Institute of Science

 A Broadcast Channel is a communication path between a single source and two or more receivers or users. The source intends to communicate independent information… (more)

Subjects/Keywords: Communication Networks; Gaussian Brodcast Channel (GBC); Fading Broadcast Channel (FBC); Broadcasting Channels; Coding and Decoding; Telecommunication; Broadcast Channels; Additive White Gaussian Noise (AWGN); Communication Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Deshpande, N. (2010). Constellation Constrained Capacity For Two-User Broadcast Channels. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/1281 ; http://etd.ncsi.iisc.ernet.in/abstracts/1663/G23606-Abs.pdf

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

Deshpande, Naveen. “Constellation Constrained Capacity For Two-User Broadcast Channels.” 2010. Thesis, Indian Institute of Science. Accessed March 28, 2020. http://etd.iisc.ernet.in/handle/2005/1281 ; http://etd.ncsi.iisc.ernet.in/abstracts/1663/G23606-Abs.pdf.

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

MLA Handbook (7th Edition):

Deshpande, Naveen. “Constellation Constrained Capacity For Two-User Broadcast Channels.” 2010. Web. 28 Mar 2020.

Vancouver:

Deshpande N. Constellation Constrained Capacity For Two-User Broadcast Channels. [Internet] [Thesis]. Indian Institute of Science; 2010. [cited 2020 Mar 28]. Available from: http://etd.iisc.ernet.in/handle/2005/1281 ; http://etd.ncsi.iisc.ernet.in/abstracts/1663/G23606-Abs.pdf.

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

Council of Science Editors:

Deshpande N. Constellation Constrained Capacity For Two-User Broadcast Channels. [Thesis]. Indian Institute of Science; 2010. Available from: http://etd.iisc.ernet.in/handle/2005/1281 ; http://etd.ncsi.iisc.ernet.in/abstracts/1663/G23606-Abs.pdf

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


Indian Institute of Science

12. Rakshith, M R. Algorithms For Spatial Modulation Systems.

Degree: 2013, Indian Institute of Science

 It is well known that multiple antennas at the transmitter and receiver are imperative for reliable and high data-rate communication over wireless channels. However, these… (more)

Subjects/Keywords: Wireless Communication; Spatial Modulation - Algorithms; Reduced-Complexity Maximum-Likelihood Decoding Algorithms; Transmit Antenna Selection Algorithms; Spatial Modulation Systems; SM Systems; Frequency Selective Channels; Space-Time Shift Keying; Communication Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rakshith, M. R. (2013). Algorithms For Spatial Modulation Systems. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/2005/3905 ; http://etd.iisc.ernet.in/abstracts/4780/G25952-Abs.pdf

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

Rakshith, M R. “Algorithms For Spatial Modulation Systems.” 2013. Thesis, Indian Institute of Science. Accessed March 28, 2020. http://etd.iisc.ernet.in/2005/3905 ; http://etd.iisc.ernet.in/abstracts/4780/G25952-Abs.pdf.

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

MLA Handbook (7th Edition):

Rakshith, M R. “Algorithms For Spatial Modulation Systems.” 2013. Web. 28 Mar 2020.

Vancouver:

Rakshith MR. Algorithms For Spatial Modulation Systems. [Internet] [Thesis]. Indian Institute of Science; 2013. [cited 2020 Mar 28]. Available from: http://etd.iisc.ernet.in/2005/3905 ; http://etd.iisc.ernet.in/abstracts/4780/G25952-Abs.pdf.

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

Council of Science Editors:

Rakshith MR. Algorithms For Spatial Modulation Systems. [Thesis]. Indian Institute of Science; 2013. Available from: http://etd.iisc.ernet.in/2005/3905 ; http://etd.iisc.ernet.in/abstracts/4780/G25952-Abs.pdf

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


Indian Institute of Science

13. Rajan, G Susinder. Low Decoding Complexity Space-Time Block Codes For Point To Point MIMO Systems And Relay Networks.

Degree: 2008, Indian Institute of Science

 It is well known that communication using multiple antennas provides high data rate and reliability. Coding across space and time is necessary to fully exploit… (more)

Subjects/Keywords: Signal Processing - Digital Techniques; Antennas; Coding Theory; Space-time Block Codes (STBCs); Distributed Space-time Block Codes (DSTBCs); Multiple Input Multiple Output Systems; Decoding; MIMO Systems; Maximum Likelihood (ML) Decoding Complexity; Orthogonal Frequency Division Multiplexing (OFDM); Relay Networks; Distributed Differential Space-Time Block Coding (DDSTBC); Clifford Unitary Weight (CUW); Minimum Mean Squared Error (MMSE); Communication Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rajan, G. S. (2008). Low Decoding Complexity Space-Time Block Codes For Point To Point MIMO Systems And Relay Networks. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/742

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

Rajan, G Susinder. “Low Decoding Complexity Space-Time Block Codes For Point To Point MIMO Systems And Relay Networks.” 2008. Thesis, Indian Institute of Science. Accessed March 28, 2020. http://hdl.handle.net/2005/742.

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

MLA Handbook (7th Edition):

Rajan, G Susinder. “Low Decoding Complexity Space-Time Block Codes For Point To Point MIMO Systems And Relay Networks.” 2008. Web. 28 Mar 2020.

Vancouver:

Rajan GS. Low Decoding Complexity Space-Time Block Codes For Point To Point MIMO Systems And Relay Networks. [Internet] [Thesis]. Indian Institute of Science; 2008. [cited 2020 Mar 28]. Available from: http://hdl.handle.net/2005/742.

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

Council of Science Editors:

Rajan GS. Low Decoding Complexity Space-Time Block Codes For Point To Point MIMO Systems And Relay Networks. [Thesis]. Indian Institute of Science; 2008. Available from: http://hdl.handle.net/2005/742

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


Indian Institute of Science

14. Dang, Rajdeep Singh. Experimental Studies On A New Class Of Combinatorial LDPC Codes.

Degree: 2007, Indian Institute of Science

 We implement a package for the construction of a new class of Low Density Parity Check (LDPC) codes based on a new random high girth… (more)

Subjects/Keywords: Computer Mathematics; Low Density Parity Check Codes; Graph Construction Technique; Sum-Product Algorithm; Decoding Algorithms; Progressive Edge Growth (PEG) Codes; Almost Regular High Girth (ARG) Codes; Additive White Gaussian Noise (AWGN); Binary Erasure Channel (BEC); High Girth Construction; LDPC Codes; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dang, R. S. (2007). Experimental Studies On A New Class Of Combinatorial LDPC Codes. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/523

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

Dang, Rajdeep Singh. “Experimental Studies On A New Class Of Combinatorial LDPC Codes.” 2007. Thesis, Indian Institute of Science. Accessed March 28, 2020. http://hdl.handle.net/2005/523.

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

MLA Handbook (7th Edition):

Dang, Rajdeep Singh. “Experimental Studies On A New Class Of Combinatorial LDPC Codes.” 2007. Web. 28 Mar 2020.

Vancouver:

Dang RS. Experimental Studies On A New Class Of Combinatorial LDPC Codes. [Internet] [Thesis]. Indian Institute of Science; 2007. [cited 2020 Mar 28]. Available from: http://hdl.handle.net/2005/523.

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

Council of Science Editors:

Dang RS. Experimental Studies On A New Class Of Combinatorial LDPC Codes. [Thesis]. Indian Institute of Science; 2007. Available from: http://hdl.handle.net/2005/523

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

.