請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/43605完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 林茂昭(Mao-Chao Lin) | |
| dc.contributor.author | Yung-Chih Tsai | en |
| dc.contributor.author | 蔡勇志 | zh_TW |
| dc.date.accessioned | 2021-06-15T02:24:14Z | - |
| dc.date.available | 2011-08-20 | |
| dc.date.copyright | 2009-08-20 | |
| dc.date.issued | 2009 | |
| dc.date.submitted | 2009-08-18 | |
| dc.identifier.citation | R.~Bauml, R.~Fischer, and J.~Huber, ``Reducing the peak-to-average power ratio of multicarrier modulation by selected mapping,' Electronics Letters,vol.~32, pp.~2056--2057, Oct. 1996.
Z.~Li and B.~V. K.~V. Kumar, ``Low-density parity-check codes with run length limited (RLL) constraints,' IEEE Trans. Magn., vol.42, pp.~344--349, Feb. 2006. X.~Lei, Y.~Tang, S.~Li, and Y.~T. Li, ``A minimum clipping power loss scheme for mitigating the clipping noise in OFDM,' GlobalTelecommnuications Conference, vol.~1, pp.~6--9, Dec. 2003. M.~C. Lin, K.~C. Chen, and S.~L. Li, ``Turbo coded OFDM system with peak power reduction,' Vehicular Technology Conference, vol.~4, pp.~2282--2286, Oct. 2003. H.~Ochiai and H.~Imai, ``Performance of the deliberate clipping with adaptive symbol selection for strictly band-limited OFDM systems,' IEEE J. Select. Areas Commun., vol.~18, pp.~2270--2277, Nov. 2000. M.~Breiling, S.~H. Muller-Weinfurtner, and J.~B. Huber, ``SLM peak-powerreduction without explicit side information,' IEEE Commun. Lett.,vol.~5, pp.~239--241, June 2001. J.~B. Anderson and S.~M. Hladik, ``Tailbiting MAP decoders,' IEEE J.Select. Areas Commun., vol.~16, pp.~297--302, Feb. 1998. H.~Chen and A.~M. Haimovich, ``Iterative estimation and cancellation of clipping noise for OFDM signals,' IEEE Commun. Lett., vol.~7, pp.~305--307, July 2003. H.~Nikopour, A.~K. Khandani, and S.~H. Jamali, ``Turbo-coded OFDM transmission over a nonlinear channel,' IEEE Trans. Veh. Technol.,vol.~54, pp.~1361--1371, July 2005. J.~G.~D. Forney, ``Trellis shaping,' IEEE Trans. Inform. Theory, vol.~38, pp.~281--300, Mar. 1992. Y.~C. Tsai, H.~H. Chung, and M.~C. Lin, ``Scrambling-based shaping for turbo coded modulation,' submitted to IEEE Trans. Commun. A.~D.~S. Jayalath and C.~Tellambura, ``SLM and PTS peak-power reduction of OFDM signals without side information,' IEEE Trans. Wireless Commun., vol.~4, pp.~2006--2013, Sept. 2005. R.~Gross and D.~Veeneman, ``Clipping distortion in DMT ADSL systems,' Electronics Letters, vol.~29, pp.~2080--2081, Nov. 1993. M.~Pauli and H.~P. Kuchenbecker, ``Minimization of the Intermodulation Distortion of a Nonlinearly Amplified OFDM Signal,' Wireless Personal Communications, vol.~4, pp.~93--101, 1996. X.~Li and L.~J.~C. Jr., ``Effects of clipping and filtering on the performance of OFDM,' IEEE Commun. Lett., vol.~2, pp.~131--133, May 1998. J.~Armstrong, ``Peak-to-average power ratio reduction for OFDM by repeated clipping and frequency domain filtering,' Electronic Letters, vol.~38, pp.~246--247, Feb. 2002. B.~S. Krongold and D.~L. Jones, ``PAR reduction in OFDM via active constellation extension,' IEEE Trans. Broadcasting, vol.~49, pp.~258--268, Sept. 2003. S.~K. Deng and M.~C. Lin, ``Recursive clipping and filtering with bounded distortion for PAPR reduction,' IEEE Trans. Commun., vol.~55, pp.~227--230, Jan. 2007. J.~Tellado, ``Multicarrier modulation with low PAR - applications to DSL and wireless,' Jan. 2000. T.~A. Wilkinson and A.~E. Jones, ``Minimisation of the peak to mean envelope power ratio of multicarrier transmission schemes by block coding,' IEEE Vehicular Technology Conference, vol.~2, pp.~825--829, July 1995. S.~J. Shepherd, P.~W. J.~V. Eetvelt, C.~Wyatt-Millington, and S.~Barton, ``Simple coding scheme to reduce peak factor in QPSK multicarrier modulation,' Electronics Letters, vol.~31, pp.~1131--1132, July 1995. P.~V. Etvelt, G.~Wade, and M.~Tomlinson, ``Peak to average power reduction for OFDM schemes by selective scrambling,' Electronics Letters, vol.~32, pp.~1963--1964, Oct. 1996. A.~D.~S. Jayalath and C.~Tellambura, ``The use of interleaving to reduce the peak-to-average power ratio of an OFDM signal,' Proc. IEEE GLOBECOM 2000, vol.~1, pp.~82--86, Nov. 2000. D.~J.~G. Mestdagh and P.~Spruyt, ``A method to reduce the probability of clipping in DMT-based transceivers,' IEEE Trans. Commun., vol.~44, pp.~1234--1238, Oct. 1996. C.~Weiss, C.~Bettstetter, and S.~Riedel, ``Code construction and decoding of parallel concatenated tail-biting codes,' IEEE Trans. Inform. Theory, vol.~47, pp.~366--386, Jan. 2001. H.~Ochiai and H.~Imai, ``On the distribution of the peak-to-average power ratio in OFDM signals,' IEEE Trans. Commun., vol.~49, pp.~282--289, Feb. 2001. S.~L. Goff, A.~Glavieux, and C.~Berrou, ``Turbo-codes and high spectral efficiency modulation,' Proc. of IEEE ICC'94, vol.~2, pp.~645--649, May 1994. O.~Y. Takeshita and J.~D.~J.~Costello, ``New deterministic interleaver designs for turbo codes,' IEEE Trans. Inform. Theory, vol.~46, pp.~1988--2006, Sept. 2000. N.~Ohkubo and T.~Ohtsuki, ``A peak to average power ration reduction of multicarrier CDMA using selected mapping,' Proc. VTC'02, pp.~2086--2090, Sept. 2002. A.~V. Oppenheim, R.~Schafer, and J.~R. Buck, Discrete-time signal processing. Prentice Hall, 2~ed., 1999. D.~Haccoun and G.~Begin, ``High rate punctured convolutional codes for viterbi and sequential decoding,' IEEE Trans. Commun., vol.~37, pp.~1113--1125, Nov. 1989. S.~Benedetto and G.~Montorsi, ``Unveiling turbo codes : Some results on parallel concatenated coding schemes,' IEEE Trans. Inform. Theory, vol.~42, pp.~409--428, Mar. 1996. J.~G.~D.~Forney, ``Generalized minimum distance decoding,' IEEE Trans. Inform. Theory, vol.~12, pp.~125--131, Apr. 1966. R.~O'Neill and L.~B. Lopes, ``Envelope variations and spectral splatter in clipped multicarrier signals,' Proc. IEEE PIMRC'95, pp.~71--75, Sept. 1995. J.~Armstrong, ``New OFDM peak-to-average power reduction scheme,' Vehicular Technology Conference, May 2001. H.~Imai and S.~Hirakawa, ``A new multilevel coding method using error correcting codes,' IEEE Trans. Inform. Theory, vol.~23, pp.~371--377, May 1977. G.~Ungerboeck, ``Channel coding with multilevel/phase signals,'IEEE Trans. Inform. Theory, vol.~28, pp.~55--67, Jan. 1982. C.~Berrou, A.~Glavieux, and P.~Thitimajshima, ``Near shannon limit error-correcting coding and decoding: Turbo-codes,' Proc. ICC'93, pp.~1064--1070, May 1993. P.~Robertson and T.~Worz, ``Bandwidth efficient turbo trellis coded modulation using punctured component codes,' IEEE J. Select. Areas Commun., vol.~16, pp.~206--218, Feb. 1998. S.~Benedetto, D.~Divsalar, G.~Montorsi, and F.~Pollara, ``Bandwidth efficient parallel concatenated coding schemes,' Electronics Letters, vol.~31,pp.~2067--2069, Nov. 1995. C.~Fragouli and R.~D. Wesel, ``Turbo-encoder design for symbol-interleaved parallel concatenated trellis-coded modulation,' IEEE Trans. Commun., vol.~49, pp.~425--435, Mar. 2001. U.~Wachsmann, R.~F.~H. Fischer, and J.~B. Huber, ``Multilevel codes:theoretical concepts and practical design rules,' IEEE Trans. Inform. Theory, vol.~45, pp.~1361--1391, July 1999. J.~G.~D. Forney, R.~Gallager, G.~Lang, F.~Longstaff, and S.~Qureshi,``Efficient modulation for band-limited channels,' IEEE J. Select. Areas Commun., vol.~2, pp.~632--647, Sept. 1984. J.~G.~D. Forney and L.~F. Wei, ``Multidimensional constellations-Part I: Introduction, figures of merit, and generalized cross constellations,' IEEE J. Select. Areas Commun., vol.~7, pp.~877--892, Aug. 1989. A.~K. Khandani and P.~Kabal, ``Shaping multidimensional signal spaces-Part I: Optimum shaping, shell mapping,' IEEE Trans. Inform. Theory,vol.~39, pp.~1799--1808, Nov. 1993. A.~K. Khandani and P.~Kabal, ``Shaping multidimensional signal spaces-Part II: Shell-addressed constellations,' IEEE Trans. Inform. Theory, vol.~39, pp.~1809--1819, Nov. 1993. A.~K. Khandani and W.~Tong, ``Application of shaping technique with turbo coset codes,' IEEE Trans. Veh. Technol., vol.~56, pp.~3770--3779, Nov. 2007. F.~W. Sun and H.~C.~A. van Tilborg, ``Approaching capacity by equiprobable signaling on the gaussian channel,' IEEE Trans. Inform. Theory, vol.~39, pp.~1714--1716, Sept. 1993. D.~Sommer and G.~Fettweis, ``Signal shaping by nonuniform QAM for AWGN channels and applications using turbo coding,' Proc. ITG Conf. Source and Channel Coding, pp.~81--86, Jan. 2000. C.~Fragouli, R.~D. Wesel, D.~Sommer, and G.~P. Fettweis, ``Turbo codes with non-uniform constellations,' ICC 2001, vol.~1, pp.~70--73, June 2001. A.~R. Calderbank and L.~H. Ozarow, ``Nonequiprobable signaling on the gaussian channel,' IEEE Trans. Inform. Theory, vol.~36, pp.~726--740, July 1990. F.~R. Kschischang and S.~Pasupathy, ``Optimal nonuniform signaling for gaussian channels,' IEEE Trans. Inform. Theory, vol.~39, pp.~913--929, May 1993. D.~Raphaeli and A.~Gurevitz, ``Constellation shaping for pragmatic turbo-coded modulation with high spectral efficiency,' IEEE Trans. Commun.,vol.~52, pp.~341--345, Mar. 2004. S.~Y.~L. Goff, B.~K. Khoo, C.~Tsimenidis, and B.~S. Sharif, ``Constellation shaping for bandwidth-efficient turbo-coded modulation with iterative receiver,' IEEE Trans. Wireless Commun., vol.~6, pp.~2223--2233, June 2007. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/43605 | - |
| dc.description.abstract | 多信號產生技術的原理，就是將相同的使用者資料，利用某種方法產生Q>1種不同的表示信號。傳送端根據不同的傳送需求從中選出一個信號來傳送。一般而言，在傳送端傳送資料時，附帶消息必須隨著被傳送的資料一同被傳出。如此，接收端才能根據所收到的附帶消息，來復原被傳送資料。但這額外傳送的附帶資料將會造成一些資料量的損失，或者是在接收端時解碼時，錯誤的附帶資料將會造成增加系統錯誤率。
本篇論文中，我們提出兩種具多信號產生特性之渦輪碼。第一類是在渦輪碼的系統下利用不同的交錯器或是隨機序列來產生多個信號。這一類系統的特點是就是傳送端不需要傳送額外的附帶資料，在接收端我們利用渦輪解碼時的判別能力來挑選可能被傳送的資料。 另一類多信號產生的技術是採用咬合碼的觀念，這想法可以適用於任何有關於咬合碼的編碼中。例如：咬合式迴旋碼，咬合式渦輪碼。利用咬合碼的限制條件，在不需要明確附帶資料的情況下，接收端一樣可以判別出正確的訊號。 為了驗證所提出的多信號產生與判別的技術，我們提供了三種渦輪碼系統分別是用來降低高峰均值比、信號衰減與傳送功率的應用。在這些實例中我們發現，所提出的這些多信號產生技術，能比現有的技術提供更好的系統效能或是減少的系統資料量的損失。 最後，我們所提出的信號產生與判別的觀念不只能應用於渦輪碼上，也適用於其他的編碼系統中。 | zh_TW |
| dc.description.abstract | The concept of multiple-candidate is implemented by choosing a candidate from Q>1 candidates, that carry the same user data, for actual transmission based on an appropriate criterion. In general, side information (SI) is included in the transmitted symbols such that receiver can recovery the SI and associated candidate. The extra SI would induce rate loss and incorrect SI would degrade the system performance. In this thesis, we propose two multiple-candidate generation methods for turbo coding.
First, the generation of multiple-candidate without SI by using various interleaver or random sequence in turbo coded system is proposed. Using the powerful discriminating capacity of turbo decoding, the SI can be removed and waived into the turbo codeword. Another multiple-candidate generation with inexplicit SI by employing the tail-biting bits of tail-biting (recursive) convolutional codes or turbo codes is also proposed. Using the tail-biting constraint, the decoding could select the correct candidate sent from transmitter without explicit SI. Three turbo coded systems, which respective aim to reduce the peak to average power ration (PAPR), clipping noise, and average transmit power, are constructed to demonstrate the advantage of the proposed multiple-candidate methods. Compared to the conventional methods, these proposed schemes can eliminate the serious degradation in bit-error performance which results from the incorrect recovery of SI at receiver and avoid/alleviate the rate loss. Finally, not only the turbo coding, the proposed multiple-candidate generations could also apply to other coded systems. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-15T02:24:14Z (GMT). No. of bitstreams: 1 ntu-98-D92942009-1.pdf: 2483486 bytes, checksum: b7affd163613b765621cad581d8b2c10 (MD5) Previous issue date: 2009 | en |
| dc.description.tableofcontents | Abstract --- ii
List of Tables --- vi List of Figures --- vii 1 Introduction for Multiple-Candidate Representation --- 1 1.1 Methods of generating multiple candidates --- 6 1.1.1 Conventional generation method of multiple candidates --- 8 2 Multiple candidates for PAPR Reduction --- 11 2.1 Introduction --- 11 2.2 Selective-Mapping for PAPR Reduction --- 16 2.3 Selective-Mapping: without Side Information --- 21 2.3.1 Multiple Interleavers --- 22 2.3.2 Multiple Random Sequences --- 25 2.4 Simulation results and Performance Analysis --- 36 2.4.1 PAPR Distribution --- 37 2.4.2 Complexity --- 44 2.4.3 Error Performance Analysis --- 45 2.4.4 long code application --- 56 2.5 Concluding Remarks --- 60 3 Multiple candidates for Clipping noise Alleviation ---62 3.1 Introduction --- 62 3.2 Selective-Clipping for Clipping noise Alleviation --- 64 3.3 Selective Clipping: with inexplicit Side Information --- 67 3.3.1 Tail-biting Bits of Tail-Biting RSC Codes --- 67 3.3.2 Tail-biting Bits and Some Information Bits of Tail-Biting RSC Codes --- 70 3.3.3 Tail-biting Bits of Tail-Biting Turbo codes --- 71 3.4 Simulation results and Performance Analysis --- 73 3.4.1 Error Performance and Complexity --- 73 3.4.2 Performance Analysis --- 77 3.5 Concluding Remarks --- 79 4 Multiple candidates for Transmitted Power Minimization --- 81 4.1 Introduction --- 81 4.2 Analysis of the Capacity of average power reduction --- 84 4.2.1 Power distribution of M^2-QAM signal points for Q=1 --- 85 4.2.2 Power distribution of M^2-QAM signal points for Q>1 --- 87 4.3 Multiple-candidate shaping for Turbo coded modulation ----- 92 4.3.1 Shaping for Turbo Trellis-Coded Modulation --- 92 4.3.2 Shaping for Pragmatic Turbo Coded Modulation ---104 4.4 Simulation results and Performance Analysis --- 106 4.5 Concluding Remarks --- 113 5 Conclusion --- 115 Bibliography --- 118 | |
| dc.language.iso | en | |
| dc.subject | 峰均值比 | zh_TW |
| dc.subject | 正交分頻多工系統 | zh_TW |
| dc.subject | 多信號產生技術 | zh_TW |
| dc.subject | 渦輪碼 | zh_TW |
| dc.subject | 咬合碼 | zh_TW |
| dc.subject | 選擇式映射 | zh_TW |
| dc.subject | multiple-candidate | en |
| dc.subject | shaping. | en |
| dc.subject | selective-clipping | en |
| dc.subject | selective-mapping (SLM) | en |
| dc.subject | tail-biting | en |
| dc.subject | peak-to-average power ratio (PAPR) | en |
| dc.subject | Orthogonal frequency-division multiplexing (OFDM) | en |
| dc.subject | Turbo codes | en |
| dc.title | 具多信號產生與判別特性之渦輪碼 | zh_TW |
| dc.title | Multiple-Candidate Generation and Separation by Turbo Coding | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 97-2 | |
| dc.description.degree | 博士 | |
| dc.contributor.oralexamcommittee | 蘇育德,蘇賜麟,呂忠津,趙啟超,楊谷章,蘇炫榮,陸曉? | |
| dc.subject.keyword | 渦輪碼,多信號產生技術,正交分頻多工系統,峰均值比,咬合碼,選擇式映射, | zh_TW |
| dc.subject.keyword | Turbo codes,multiple-candidate,Orthogonal frequency-division multiplexing (OFDM),peak-to-average power ratio (PAPR),tail-biting,selective-mapping (SLM),selective-clipping,shaping., | en |
| dc.relation.page | 126 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2009-08-18 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
| 顯示於系所單位： | 電信工程學研究所 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-98-1.pdf 未授權公開取用 | 2.43 MB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。