서창호 교수
Changho Seo
KAIST 반도체시스템공학과 · 컴퓨터과학
연구실 소개
서창호 교수의 연구실은 무선 통신 시스템의 핵심 과제인 간섭 관리와 효율적 데이터 복구 기법을 중심으로 연구를 진행하고 있습니다. 특히 다셀러리 제어 기반 간섭 정렬 기법과 고속 대역폭을 확보하는 데 기여하는 정확한 복구가 가능한 MDS 코드 설계 기법을 개발하여, 현대 무선 네트워크의 성능 한계를 극복하고자 합니다. 또한 OFDM 기반 다중방송 전송 및 피드백을 활용한 간섭 채널의 용량 한계 분석을 통해 실용적이고 고성능의 통신 시스템 설계에 기여하고 있습니다.
연구 현황
연구 성과 추이
표시된 성과는 수집된 데이터 기준으로 산출되며, 일부 차이가 있을 수 있습니다.
주요 논문
15In this paper, we propose a new way of interference management for cellular networks. We develop the scheme that approaches to <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">interference-free</i> degree-of-freedom (dof) as the number <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> of users in each cell increases. Also we find the corresponding bandwidth scaling conditions for typical wireless channel
We develop an interference alignment (IA) technique for a downlink cellular system. In the uplink, IA schemes need channel-state-information exchange across base-stations of different cells, but our downlink IA technique requires feedback only within a cell. As a result, the proposed scheme can be implemented with a few changes to an existing cellular system where the feedback mechanism (within a cell) is already being considered for supporting multi-user MIMO. Not only is our proposed scheme im
The high repair cost of <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex Notation="TeX">$(n,k)$</tex></formula> Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of MDS codes, called Repair MDS codes, that can significantly reduce repair bandwidth over conventional MDS codes. In this paper, we describe <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlin
We characterize the capacity region to within 2 bits/s/Hz and the symmetric capacity to within 1 bit/s/Hz for the two-user Gaussian interference channel (IC) with feedback. We develop achievable schemes and derive a new outer bound to arrive at this conclusion. One consequence of the result is that feedback provides multiplicative gain at high signal-to-noise ratio: the gain becomes arbitrarily large for certain channel parameters. This finding is in contrast to point-to-point and multiple-acces
We consider a multicast resource allocation problem for the downlink in OFDM-based wireless cellular network systems. In a conventional multicast system, to accommodate users with bad channel conditions, the transmission is based on the worst case user. We show that such a multicast system saturates the capacity when the number of users increases in fading environments. We exploit the multicarrier nature of OFDM and advances in coding techniques such as MDC (multiple description coding), in whic
The high repair cost of (n, k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of codes, called Regenerating Codes, that optimally trade off storage cost for repair bandwidth. In this paper, we address bandwidth-optimal (n, k, d) Exact-Repair MDS codes, which allow for any failed node to be repaired exactly with access to arbitrary d survivor nodes, where k ≤ d ≤ n - 1. Under scalarlinear codes which do not permit symbol-splitting, we construct Exact-Repair MDS
We develop an interference alignment (IA) technique for a downlink cellular system. In the uplink, IA schemes need channel-state-information exchange across base-stations of different cells, but our downlink IA technique requires feedback only within a cell. As a result, the proposed scheme can be implemented with minimal changes to an existing cellular system where the feedback mechanism (within a cell) is already being considered for supporting multi-user MIMO. Not only is our proposed scheme
The high repair cost of (n,k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of codes, called Regenerating Codes, that optimally trade off storage cost for repair bandwidth. On one end of this spectrum of Regenerating Codes are Minimum Storage Regenerating (MSR) codes that can match the minimum storage cost of MDS codes while also significantly reducing repair bandwidth. In this paper, we describe Exact-MSR codes which allow for any failed nodes (whether they a
The high repair cost of (n,k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of codes, called Regenerating Codes, that optimally trade off storage cost for repair bandwidth. In this paper, we address bandwidth-optimal (n,k,d) Exact-Repair MDS codes, which allow for any failed node to be repaired exactly with access to arbitrary d survivor nodes, where k<=d<=n-1. We show the existence of Exact-Repair MDS codes that achieve minimum repair bandwidth (matchin
We consider two-way interference channels (ICs) where forward and backward channels are ICs but not necessarily the same. We first consider a scenario where there are only two forward messages and feedback is offered through the backward IC for aiding forward-message transmission. For a linear deterministic model of this channel, we develop inner and outer bounds that match for a wide range of channel parameters. We find that the backward IC can be more efficiently used for feedback rather than
We develop an interference alignment (IA) technique for a downlink cellular system. In the uplink, IA schemes need channel-state-information exchange across base-stations of different cells, but our downlink IA technique requires feedback only within a cell. As a result, the proposed scheme can be implemented with a few changes to an existing cellular system where the feedback mechanism (within a cell) is already being considered for supporting multi-user MIMO. Not only is our proposed scheme im
We consider a multicast resource allocation problem for the downlink in OFDM-based wireless cellular network systems. In a conventional multicast system, to accommodate users with bad channel conditions, the transmission is based on the worst case user. We show that such a multicast system saturates the capacity when the number of users increases in fading environments. We exploit the multicarrier nature of OFDM and advances in,coding techniques such as MDC (multiple description coding), in whic
In multicast orthogonal frequency division multiplexing (OFDM) systems, the difference in link conditions of users complicates adaptive modulation because modulation should be adjusted to serve the user who experiences the worst channel condition. If we assume that the multicast data are separated into layers and any combination of the layers can be decoded at the receiver, the network throughput can be increased by performing subcarrier/bit allocation. In this paper, in order to increase networ
The time-domain channel estimator is compared with the frequency-domain channel estimator when multiple-input-multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) is employed. The time-domain maximum likelihood channel estimation (TMLE) and its mean square error (MSE) are derived assuming the knowledge of the maximum channel length. If we use only one OFDM symbol for the estimation, the preamble sequence of each transmit antenna uses a different set of subcarriers in MIMO-OFD
We characterize the symmetric capacity to within 1.7075 bits/s/Hz for the two-user Gaussian interference channel with feedback. The result makes use of a deterministic model to provide insights into the Gaussian channel. We derive a new outer bound to show that a proposed achievable scheme can achieve the symmetric capacity to within 1.7075 bits for all channel parameters. From this result, we show that feedback provides unbounded gain, i.e., the gain becomes arbitrarily large for certain channe
대표 연구 분야
서창호 교수의 연구를 Nubint에서 더 깊이 살펴보세요
이 연구실의 논문을 앱에서 열어 AI와 함께 읽고, 핵심을 요약하고, 내 글에 인용하세요.