Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/13747
DC FieldValue
dc.titleData transmissions through HFC return channels
dc.contributor.authorTONG YAO
dc.date.accessioned2010-04-08T10:36:03Z
dc.date.available2010-04-08T10:36:03Z
dc.date.issued2004-03-03
dc.identifier.citationTONG YAO (2004-03-03). Data transmissions through HFC return channels. ScholarBank@NUS Repository.
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/13747
dc.description.abstractThe objective of this thesis is to investigate various methods to combat ingress noise in the Community Antenna Television (CATV) return channel. First upstream CATV channel models of Hybrid-Fiber Coaxing (HFC) networks are discussed paying particular attention to channel impairments of the return path. Two methods were then studied in depth to overcome ingress noise present in the network. One approach is to use Discrete Multitone (DMT) together with a bit-loading algorithm which avoids the frequency bands where ingress noise exists. The other approach is to use Tomlinson-Harashima Precoding (THP) together with an Interference Rejection Filter (IRF) that minimizes the signal distortion while whitens the ingress noise in the receiver side. We observe from the simulations that the performance of DMT bit-loading system is better than the THP-IRF system. We conclude that both the interference cancellation and DMT are efficient methods in overcoming ingress noise in the CATV return channel.
dc.language.isoen
dc.subjectHFC, DMT, THP, IRF
dc.typeThesis
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.degreeMaster's
dc.description.degreeconferredMASTER OF ENGINEERING
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Master's Theses (Open)

Show simple item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
Data_Transmissions_Through_HFC_Return_Channels.pdf988.09 kBAdobe PDF

OPEN

NoneView/Download

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.