Báo cáo hóa học: " Research Article Design Criteria for Hierarchical Exclusive Code with Parameter-Invariant Decision Regions for"

Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article Design Criteria for Hierarchical Exclusive Code with Parameter-Invariant Decision Regions for | Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 2010 Article ID 921427 13 pages doi 2010 921427 Research Article Design Criteria for Hierarchical Exclusive Code with Parameter-Invariant Decision Regions for Wireless 2-Way Relay Channel Tomas Uricar and Jan Sykora Department of Radio Engineering Faculty of Electrical Engineering Czech Technical University in Prague Technicka 2 166 27 Praha 6 Czech Republic Correspondence should be addressed to Tomas Uricar uricatom@ Received 31 December 2009 Revised 12 May 2010 Accepted 30 June 2010 Academic Editor Meixia Tao Copyright 2010 T. Uricar and J. Sykora. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited. The unavoidable parametrization of the wireless link represents a major problem of the network-coded modulation synthesis in a 2-way relay channel. Composite hierarchical codeword received at the relay is generally parametrized by the channel gain forcing any processing on the relay to be dependent on channel parameters. In this paper we introduce the codebook design criteria which ensure that all permissible hierarchical codewords have decision regions invariant to the channel parameters as seen by the relay . We utilize the criterion for parameter-invariant constellation space boundary to obtain the codebooks with channel parameter-invariant decision regions at the relay. Since the requirements on such codebooks are relatively strict the construction of higher-order codebooks will require a slightly simplified design criteria. We will show that the construction algorithm based on these relaxed criteria provides a feasible way to the design of codebooks with arbitrary cardinality. The promising performance benefits of the example codebooks compared to a classical linear modulation alphabets will be

Không thể tạo bản xem trước, hãy bấm tải xuống
TÀI LIỆU LIÊN QUAN
TÀI LIỆU MỚI ĐĂNG
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.