-
-
-
公开(公告)号：KR1020100088513A
公开(公告)日：2010-08-09
申请号：KR1020090052912
申请日：2009-06-15
Applicant: 한국전자통신연구원
CPC classification number: H04L27/265 , H04L25/0204 , H04L27/38
Abstract: PURPOSE: A multi-channel down-converter and a multi-channel down-converting method for generating a narrowband channel using fast Fourier transform are provided to reduce hardware complexity of the multi-channel down-converter or reduce an operation amount when realizing the multi-channel down-converter by a DSP(Digital Signal Processor). CONSTITUTION: A buffer(110) converts a broadband signal of a time domain into a data vector with a fixed length. A preprocessor(120) pre-processes the data vector saved in the buffer. An FFT(Fast Fourier Transform) processing unit(130) converts the pre-processed data vector into frequency domain data. A baseband processor(140) adds a frequency value in which a narrowband channel exists in the frequency domain data and converts the added value into a baseband.
Abstract translation: 目的：提供一种用于使用快速傅立叶变换产生窄带信道的多通道下变频器和多通道下变频方法，以降低多通道下变频器的硬件复杂度，或者在实现多通道下变频器时减少操作量 通道DSP（数字信号处理器）的通道下变频器。 构成：缓冲器（110）将时域的宽带信号转换成具有固定长度的数据向量。 预处理器（120）预处理保存在缓冲器中的数据向量。 FFT（快速傅里叶变换）处理单元将预处理的数据向量转换为频域数据。 基带处理器（140）将在频域数据中存在窄带信道的频率值相加，并将该相加值转换为基带。
-
-
公开(公告)号：KR101693396B1
公开(公告)日：2017-01-05
申请号：KR1020130145059
申请日：2013-11-27
Applicant: 한국전자통신연구원
Abstract: 본발명은최소제곱평균과실효값을이용한백색가우시안잡음대역결정시스템및 그방법에관한것이다. 이러한본 명세서는입력신호로부터협대역데이터를생성하는단계, 상기협대역데이터에대한자기상관행렬을계산하는단계, 상기자기상관행렬의누적분포함수에대한최소제곱평균(Least Mean Square, LMS)을계산하는단계및 상기계산된최소제곱평균과미리설정된임계값을비교하여잡음대역여부를결정하는단계를포함하는백색가우시안잡음대역을결정하는방법을제공한다.
Abstract translation: 本发明涉及一种使用LMS和RMS确定白高斯噪声频带的系统及其方法。 本说明书提供了用于确定白高斯噪声频带的方法，其包括以下步骤：从输入信号产生窄带数据; 计算关于窄带数据的自相关矩阵; 针对自相关矩阵的累积分布函数计算最小均方（LMS）; 以及通过将计算的LMS与预设的临界值进行比较来确定噪声带。
-
Patent Agency Ranking
公开(公告)号：KR101675963B1
公开(公告)日：2016-11-15
申请号：KR1020120098777
申请日：2012-09-06
Applicant: 한국전자통신연구원
CPC classification number: H04L27/38 , H04L27/0012 , H04L27/10 , H04L27/18
Abstract: 본발명은신호에대한정보를알 수없는상태에서목적신호에대한변조방식을자동분류하는알고리즘의실용적인설계에관한것이다. 통상, 정보를알 수없는신호에대하여종래의대부분의자동분류알고리즘은사전에신호와관련한정보를일정수준알고있다는가정하에알고리즘을제시하여적대적통신등 실환경상태의신호에대해적용하기어렵고, 대상신호를제한하는것이일반적이다. 또한, 전송주파수복원없이는자동변조방식분류알고리즘설계가어려운상황이다. 본발명에서는대상신호의효율적인정보획득을위하여입력신호의위상차이를활용해 PSK(single carrier), FSK(variant carrier) 계열로분류한후 자기상관함수(Auto Correlation Function)의특성을이용하여복잡한계산없이대상신호의변조지수 M(Modulation index)을결정하는기법을제안하고자한다.
-
公开(公告)号：KR1020150049423A
公开(公告)日：2015-05-08
申请号：KR1020130129991
申请日：2013-10-30
Applicant: 한국전자통신연구원
IPC: H04L25/02
CPC classification number: H04L25/03261 , H03H2017/0081
Abstract: 본발명은, 통신시스템에서유한임펄스응답필터구현방법에있어서, 유한임펄스응답필터를구현하기위한필터파라미터들을설정하는단계; 상기설정된필터파라미터들에근거하여입력데이터에미리설정된배수의제로패딩을하고, 윈도우함수를연산하는단계; 상기연산된윈도우함수에근거하여고속퓨리에변환을수행하는단계; 및신호의특성에따라적응하는데이터의중첩개수와미리설정된개수의채널합을설정하여상기고속퓨리에변환을이용한유한임펄스응답필터를구현하는단계를포함하고, 상기필터파라미터를설계하는단계는필터파라미터들중에서채널샘플링율을채널대역폭의두 배로설정하는단계를포함하는것을특징으로한다.
Abstract translation: 本发明涉及一种在通信系统中设计有限脉冲响应滤波器的方法，该方法包括设置滤波器参数以确保有限脉冲响应滤波器的步骤; 基于预定的滤波器参数对输入数据执行预定倍数的零填补来计算窗函数的步骤; 基于所计算的窗口函数执行高速傅里叶变换的步骤; 以及根据信号的特性设定预定数量的信道总和和重叠数据的步骤，并通过使用高速傅里叶变换来确保有限脉冲响应滤波器。 设计滤波器参数的步骤包括允许滤波器参数中的信道采样率为两倍带宽信道的步骤。
-
公开(公告)号：KR1020140058330A
公开(公告)日：2014-05-14
申请号：KR1020130120307
申请日：2013-10-10
Applicant: 한국전자통신연구원
Abstract: A conventional method excludes interference from a reception signal of an antenna array through digital beam-forming. The method is advantageous for signal finding by reducing the interference of a target signal, but has a limit in improving the performance of direction finding. The present invention detects space partition signals which are obtained using a digital beam-forming method and analyzes the signals in advance to collect and provide a variety of information used for direction finding, thereby providing a technology for executing accurate direction finding, which improves the analysis of direction finding signals and the accuracy of direction finding in the conventional technology.
Abstract translation: 常规方法通过数字波束形成排除来自天线阵列的接收信号的干扰。 该方法通过减少目标信号的干扰而有利于信号发现，但是在改进方向性能方面具有局限性。 本发明检测使用数字波束成形方法获得的空间分区信号，并且预先分析信号以收集和提供用于方向查找的各种信息，从而提供用于执行精确方向查找的技术，其改进了分析 的方向发现信号和传统技术中的测向精度。
-
公开(公告)号：KR1020140032190A
公开(公告)日：2014-03-14
申请号：KR1020120098777
申请日：2012-09-06
Applicant: 한국전자통신연구원
CPC classification number: H04L27/38 , H04L27/0012 , H04L27/10 , H04L27/18 , H04L27/00 , H04L27/0008 , H04L27/02 , H04L27/04 , H04L2025/03394 , H04L2025/03401
Abstract: The present invention relates to a practical design of an algorithm in which modulation schemes are automatically classified for a target signal in the state that the information of the target signal cannot be known. In general, most conventional automatic classification algorithms may be not applied to signals under actual environment states such as hostile communication and restrict a target signal because the algorithms are suggested under the assumption that information of the signal is previously known to some extent. In addition, the automatic modulation scheme classifying algorithm may be not designed without recovering a propagation frequency. The present invent suggests a scheme of determining a modulation index (M) of the target signal without complex computations by using the characteristic of an auto correlation function after classifying the signal into a PSK (single carrier) class signal and an FSK (variant carrier) class signal by utilizing a phase difference of an input signal in order to effectively acquire the information of the target signal. [Reference numerals] (AA) unknown signal; (BB) PSK class; (CC) FSK class
Abstract translation: 本发明涉及一种算法的实际设计，其中在目标信号的信息不能被知道的状态下，调制方案被自动分类为目标信号。 通常，大多数传统的自动分类算法可能不适用于诸如敌对通信之类的实际环境状态下的信号，并且限制目标信号，因为在某种程度上先前已知该信号的信息的假设下建议算法。 此外，自动调制方式分类算法可以不设计而不恢复传播频率。 本发明提出了一种在将信号分类为PSK（单载波）等级信号和FSK（变型载波）之后，通过使用自相关函数的特性来确定目标信号的调制指数（M）而不进行复杂计算的方案， 通过利用输入信号的相位差来实现等级信号，以有效地获取目标信号的信息。 （标号）（AA）未知信号; （BB）PSK类; （CC）FSK类
-
公开(公告)号：KR101145097B1
公开(公告)日：2012-05-14
申请号：KR1020090052912
申请日：2009-06-15
Applicant: 한국전자통신연구원
Abstract: 본 발명은 다중 채널 하향 변환기 및 다중 채널 하향 변환 방법에 관한 것으로, 구체적으로는 단 한번의 FFT(Fast Fourier Transform) 연산으로 필터링을 대체하여 복수 개의 협대역 채널을 생성함으로써 수반되는 하드웨어의 복잡도를 현저하게 줄일 수 있다.
FFT, 다중 채널 하향 변환기, 광대역, 협대역, 다중 채널 분석 시스템
-
-
-
-
-
-
-
-
-
Search Results
20
records
(took 0.048 seconds)
