MINIMAL SQUARE ROOTING

被引:15
|
作者
METZE, G
机构
来源
关键词
D O I
10.1109/PGEC.1965.263963
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
引用
收藏
页码:181 / &
相关论文
共 50 条
  • [31] Modified Square Rooting Companding Technique to Reduced PAPR for FBMC/OQAM
    Shaheen, Imad A.
    Zekry, Abdelhalim
    Newagy, Fatma
    Ibrahim, Reem
    2017 PALESTINIAN INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGY (PICICT), 2017, : 66 - 70
  • [32] High speed self-timed pipelined datapath for square rooting
    Cappuccino, G
    Cocurullo, G
    Corsonello, P
    Perri, S
    IEE PROCEEDINGS-CIRCUITS DEVICES AND SYSTEMS, 1999, 146 (01): : 16 - 22
  • [33] Novel seed generation and quadrature-based square rooting algorithms
    Amal Altamimi
    Belgacem Ben Youssef
    Scientific Reports, 12
  • [34] Fast Algorithm of Square Rooting in Some Finite Fields of Odd Characteristic
    Gashkov S.B.
    Gashkov I.B.
    Moscow University Mathematics Bulletin, 2018, 73 (5) : 176 - 181
  • [35] SQUARE-ROOTING AND VECTOR SUMMATION CIRCUITS USING CURRENT CONVEYORS
    LIU, SI
    IEE PROCEEDINGS-CIRCUITS DEVICES AND SYSTEMS, 1995, 142 (04): : 223 - 226
  • [36] PAPR REDUCTION FOR OFDM SYSTEMS USING CLIPPING AND SQUARE ROOTING TECHNIQUES
    Deepa, T.
    Kumar, R.
    PROCEEDINGS OF THE 2012 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI'12), 2012, : 740 - 744
  • [37] On the minimal length curve that densifies the square
    Mora, Gaspar
    Cherruault, Yves
    Kybernetes, 1999, 28 (8-9): : 1054 - 1064
  • [38] Computing almost minimal formulas on the square
    Festa, Mattia
    Sommariva, Alvise
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2012, 236 (17) : 4296 - 4302
  • [39] SQUARE-ROOTING ALGORITHMS FOR HIGH-SPEED DIGITAL CIRCUITS
    MAJERSKI, S
    IEEE TRANSACTIONS ON COMPUTERS, 1985, 34 (08) : 724 - 733
  • [40] THE DECOMPOSITION OF A SQUARE INTO RECTANGLES OF MINIMAL PERIMETER
    KONG, TY
    MOUNT, DM
    WERMAN, M
    DISCRETE APPLIED MATHEMATICS, 1987, 16 (03) : 239 - 243