Andrew J. Blanksby
Broadcom
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Andrew J. Blanksby.
international solid-state circuits conference | 2014
Michael Boers; Iason Vassiliou; Saikat Sarkar; Sean Nicolson; Ehsan Adabi; Bagher Afshar; Bevin George Perumana; Theodoros Chalvatzis; S. Kavadias; Padmanava Sen; Wei Liat Chan; Alvin Yu; Ali Parsa; Med Nariman; Seunghwan Yoon; Alfred Grau Besoli; Chryssoula Kyriazidou; Gerasimos Zochios; Namik Kocaman; Adesh Garg; Hans Eberhart; Phil Yang; Hongyu Xie; Hea Joung Kim; Alireza Tarighat; David Garrett; Andrew J. Blanksby; Mong Kuan Wong; Durai Pandian Thirupathi; Siukai Mak
The IEEE 802.11ad standard supports PHY rates up to 6.7 Gbps on four 2 GHz-wide channels from 57 to 64 GHz. A 60 GHz system offers higher throughput than existing 802.11ac solutions but has several challenges for high-volume production including: integration in the host platform, automated test, and high link loss due to blockage and polarization mismatch. This paper presents a 802.11ad radio chipset capable of SC and OFDM modulation using a 16TX-16RX beamforming RF front-end, complete with an antenna array that supports polarization diversity. To aid low-cost integration in PC platforms, a single coaxial cable interface is used between chips. The chipset is capable of maintaining a link of 4.6 Gbps (PHY rate) at 10 m.
Proceedings of the 2010 ACM international workshop on mmWave communications: from circuits to networks | 2010
Andrew J. Blanksby; Ba-Zhong Shen; Jason A. Trachewsky
A low-density parity-check (LDPC) code set is presented that is specifically designed for multi-gigabit throughput wireless communication in the 60GHz band. The code set is structured to enable low power decoder and encoder implementation while providing excellent coding gain over a wide variety of channels.
international conference on telecommunications | 2016
Matthias Korb; Andrew J. Blanksby
It is almost always assumed that the algebraic structure underlying non-binary Low-Density Parity-Check (LDPC) codes are Finite Fields. However, when considering non-binary LDPC belief-propagation (BP) decoding, Finite Fields are actually over constrained. In this contribution, we discuss the minimal requirements of the algebraic structure used for non-binary LDPC decoding which we denote Finite Division Near Ring over a Subtractive Near Group. To verify the requirements, a general Min-Max decoding algorithm is derived that incorporates any algebraic structure fulfilling this minimal requirement set. It is shown that by relaxing the mathematical constraints, the decoding performance of non-binary LDPC codes can be incrementally improved compared to a Finite-Field-based LDPC code without any additional hardware cost.
Archive | 2007
Andrew J. Blanksby
Archive | 2013
Jason A. Trachewsky; Ba-Zhong Shen; Andrew J. Blanksby; Joonsuk Kim
Archive | 2007
Alvin Lai Lin; Andrew J. Blanksby
Archive | 2007
Andrew J. Blanksby; Alvin Lai Lin
Archive | 2009
Andrew J. Blanksby
Archive | 2010
Andrew J. Blanksby; Ba-Zhong Shen; Jason A. Trachewsky
Archive | 2009
Andrew J. Blanksby; Alvin Lai Lin